Random

random@lists.dm.unipi.it

5 participants
5326 discussions

Seminar RUSSO
by Stefano Pagliarani 10 May '24

10 May '24

Dear all, On May 15th, at 11 am, in the classroom Aula Seminari VIII Piano, Department of Mathematics of the University of Bologna, Francesco RUSSO will give a seminar entitled WEAK DIRICHLET PROCESSES AND BSDE<https://www.dm.unibo.it/seminari/mat/seminars/2024/05/15/francesco-russo>s The abstract is available at https://www.dm.unibo.it/seminari/mat/seminars/2024/05/15/francesco-russo For any question, please contact the organizers: Cristina di Girolami and Stefano Pagliarani. Best regards, ------------------------------------------------------------------------------------------------------------------------ Stefano Pagliarani, Associate Professor Piazza di Porta S. Donato, 5 University of Bologna (Alma Mater) 40126 Bologna (BO), Italy Department of Mathematics Cell. Phone +39 366 5013755 Email: stepagliara1(a)gmail.com<mailto:stepagliara1@gmail.com>, <mailto:stefano.pagliarani9@unibo.it> stefano.pagliarani9(a)unibo.it<mailto:stefano.pagliarani9@unibo.it> Zoom: https://unibo.zoom.us/j/3755841669 -----------------------------------------------------------------------------------------------------------------------

1 0

Fwd: Summer School Ischia ESI
by Roy Cerqueti 09 May '24

09 May '24

Dear all, please, find the flyer of this Summer School, that can be of interest to some young scholars. Thank you. Yours sincerely, Roy Cerqueti -- *Fai crescere le giovani ricercatrici e i giovani ricercatori*** *con il 5 per mille alla Sapienza* Scrivi il codice fiscale dell'Università *80209930587 **Cinque per mille <https://www.uniroma1.it/it/node/23149>*

1 0

Fwd: Next LTI@Unito Seminar: Stéphane Villeneuve | May 13 @ 12:00 - 13:00
by Luca Regis 08 May '24

08 May '24

Dear colleagues, please find below the announcement of the seminar by Stephane Villeneuve (TSE) organized by LTI@UniTO and Collegio Carlo Alberto. The seminar can be attended via zoom clicking on the button below. Best regards, Luca Regis ---------------------------------------- Associate Professor ESOMAS Department, University of Torino Affiliate, Collegio Carlo Alberto sites.google.com/view/lucaregis Office: +39 011 670 6065 www.carloalberto.org/lti Next LTI@Unito Seminar: Stéphane Villeneuve | May 13 @ 12:00 - 13:00 <https://4z5y5.r.sp1-brevo.net/mk/cl/f/sh/SMK1E8tHeFuBop7S3TtlKvKzHBSs/4oJ_v…> LTI@UniTO and Fondazione Collegio Carlo Alberto are pleased to invite you to the following seminar: *May 13, 2024 | 12:00 - 13:00* *Dynamic contracting with many agents* *Stéphane Villeneuve (Toulouse School of Economics)* *Abstract: *We analyze dynamic capital allocation and risk sharing between a principal and many agents, who privately observe their output. The state variables of the mechanism design problem are aggregate capital and the distribution of continuation utilities across agents. This gives rise to a Bellman equation in an infinite dimensional space, which we solve with mean-field techniques. We fully characterize the optimal mechanism and show that the level of risk agents must be exposed to for incentive reasons is decreasing in their initial outside utility. We extend classical welfare theorems by showing that any incentive-constrained optimal allocation can be implemented as an equilibrium allocation, with appropriate money issuance and wealth taxation by the principal. To attend online, join Zoom meeting <https://4z5y5.r.sp1-brevo.net/mk/cl/f/sh/SMK1E8tHeG13GxwPEe3FQkdjFU38/HGpf3…> *Fondazione Collegio Carlo Alberto* Piazza Arbarello 8 - 10122 Torino, Italy phone: +3901115630800 <tel:+3901115630800> segreteria(a)carloalberto.org - www.carloalberto.org <https://4z5y5.r.sp1-brevo.net/mk/mr/sh/SMJz09SDriOHWoY4zxneDRikeAJG/JT1digZ…> <https://4z5y5.r.sp1-brevo.net/mk/cl/f/sh/SMK1E8tHeG7uj6lMPoCjWZwTDmdO/xbd5a…> <https://4z5y5.r.sp1-brevo.net/mk/cl/f/sh/SMK1E8tHeGEmBFaJayMDcPFDC5De/7R5hd…> <https://4z5y5.r.sp1-brevo.net/mk/cl/f/sh/SMK1E8tHeGLddOPGm8VhiEXxANnu/KmFdZ…> <https://4z5y5.r.sp1-brevo.net/mk/cl/f/sh/SMK1E8tHeGSV5XEDxIfBo3qh8gOA/THQZY…> <https://4z5y5.r.sp1-brevo.net/mk/cl/f/sh/SMK1E8tHeGZMXg3B8Softt9R6yyQ/xDNI-…> <https://4z5y5.r.sp1-brevo.net/mk/cl/f/sh/SMK1E8tHeGgDzos8Jcy9ziSB5HYg/jDbOw…> *Founders* <https://4z5y5.r.sp1-brevo.net/mk/cl/f/sh/SMK1E8tHeGn5Rxh5Un7e5Xkv3a8w/r0Vb5…> <https://4z5y5.r.sp1-brevo.net/mk/cl/f/sh/SMK1E8tHeGtwu6W2fxH8BN3f1sjC/phw27…> *Sostieni il Collegio Carlo Alberto con il 5x1000 | c.f. 94049090015* *INFORMATION UNDER THE NEW GENERAL DATA PROTECTION REGULATION (GDPR)* Your personal information has been gathered for the exclusive purpose of informing you about the Collegio's initiatives, considering our and your legitimate interest or your consent. If you wish to have your personal data modified please contact Fondazione Collegio Carlo Alberto, piazza Arbarello 8, 1022 Torino, Italy - phone:+39011 15630 800 - privacy(a)carloalberto.org <https://4z5y5.r.sp1-brevo.net/mk/cl/f/sh/1t6Af4OiGsDhYHezxFlTns9XmrPqba/o-w…> To find out about the policies regarding the processing of personal data pursuant to articles 13-14 of EU Regulation 2016/679, consult the information at the following link _https://www.carloalberto.org/privacy/_ <https://4z5y5.r.sp1-brevo.net/mk/cl/f/sh/1t6Af4OiGsE9szrQLbrOy8DNAgOaJe/Drj…> *Unsubscribe* <https://4z5y5.r.sp1-brevo.net/mk/un/sh/SMJz09a0vkbXsu1klhxRMEbrtrvO/3tb3NOW…> *© 2022 Fondazione Collegio Carlo Alberto*

1 0

STATISTICAL REFLECTIONS: Half-day Workshop on Statistical Methods - Ca’ Foscari University (Scientific Campus Venezia Mestre)
by Carlo Gaetan 08 May '24

08 May '24

Dear all, the STREAM group (https://www.unive.it/pag/16818/) of the Ca’ Foscari university invites to *STATISTICAL REFLECTIONS* *Half-day Workshop on Statistical Methods* *Venice May 22, 2024* Ca’ Foscari University Scientific Campus Aula Delta 1B Via Torino 155 Venezia Mestre Program: -14:00 David Firth (University of Warwick): Compositional quasi-likelihood and logit models -14:45 Ioannis Kosmidis (University of Warwick): Consistent, tuning-free model selection in regression problems -15:30 Omiros Papaspiliopoulos (Bocconi University): Functional estimation of the marginal likelihood Abstracts: Professor David Firth University of Warwick, UK https://warwick.ac.uk/dfirth Compositional quasi-likelihood and logit models A composition vector describes the relative sizes of parts of a thing. Some important modern application areas are microbiome analysis, time-use analysis and archaeometry (to name just three). We develop model-based analysis of composition, through the first two moments of measurements on their original scale. In current applied work the most-used route to compositional data analysis, following an approach introduced by the late John Aitchison in the 1980s, is based on contrasts among log-transformed measurements. The quasi-likelihood model framework developed here provides a general alternative with several advantages. These include robustness to secondary aspects of model specification, stability when there are zero-valued or near-zero measurements in the data, and more direct interpretation. Linear models for log-contrast transformed data are replaced by generalized linear models with logit link, and variance-covariance estimation is straightforward via suitably standardized residuals. Joint work with Fiona Sammut, University of Malta. Professor Ioannis Kosmidis University of Warwick, UK https://www.ikosmidis.com Consistent, tuning-free model selection in regression problems We present a family of consistent model selection procedures for regression problems, which appropriately threshold readily available statistics after estimating the model with all covariate information. The model selection procedures rely only on standard assumptions about information accumulation that guarantee the typically expected asymptotic properties of the estimators (e.g., consistency) and require neither the selection of tuning parameters nor the fitting of all possible models. We apply our thresholding methodology in widely used statistical models (e.g. generalized linear models and beta regression), demonstrate that it is easily implementable as part of the standard maximum likelihood output, and compare its performance to existing techniques, illustrating its effectiveness. Joint work with Patrick Zietkiewicz, University of Warwick. Professor Omiros Papaspiliopoulos Bocconi University, Italy https://dec.unibocconi.eu/people/omiros-papaspiliopoulos Functional estimation of the marginal likelihood We consider the problem of exploring the marginal likelihood of low-dimensional hyperparameters from high-dimensional Bayesian hierarchical models. We provide a unified framework that connects seemingly unconnected approaches to estimating normalizing constants, including the Vardi estimator, the umbrella sampling and the Gibbs sampler. The framework requires Monte Carlo sampling from the posteriors of the high-dimensional parameters for different values of the hyperparameters on a lattice. We establish a surprising reproducing property that leads to a functional estimator of the marginal likelihood and establish consistency both fixed-lattice and lattice-infill consistency. The resultant method is highly practical, black-box with theoretical guarantees. Best regards, Carlo Gaetan -- - Dipartimento di Scienze Ambientali, Informatica e Statistica - DAIS Università Ca' Foscari - Venezia Z.A12 - Edificio Zeta Via Torino, 155 I-30172 Mestre (VE) ITALY phone: ++39 041 234 8404 e-mail:[gaetan"at"unive"dot"it] web:[http://www.dais.unive.it/~gaetan] Please don't print this e-mail unless you really need to. Please avoid sending me Word, Excel or PowerPoint attachments. Seehttp://www.gnu.org/philosophy/no-word-attachments.html. Per favore non stampate questo messaggio se non è proprio necessario. Per favore non mandatemi allegati in Word, Excel o PowerPoint. Le ragioni sono spiegate quihttp://www.gnu.org/philosophy/no-word-attachments.it.html

1 0

Kolmogorov meets Turing - May 23, 11am - 6pm, DIAG, Sapienza, Rome
by Marco Scarsini 07 May '24

07 May '24

Kolmogorov meets Turing *Workshop on probabilistic methods for the analysis of stochastic processes and randomized algorithms* This year's edition of the Kolmogorov meets Turing Workshop will take place on Thursday, May 23rd 2024, at DIAG <https://www.diag.uniroma1.it/>, via Ariosto 25, Aula Magna I floor. The purpose of KmT is to bring together researchers from Computer Science, Economics, Mathematics and related fields to present and discuss research on probabilistic methods for the analysis of games, distributed and stochastic processes, dynamic processes and randomized algorithms. When: Thursday May 23rd, 2024 Where: Dipartimento di Ingegneria Informatica, Automatica e Gestionale “A. Ruberti”, via Ariosto 25, Roma – Aula Magna, I floor Schedule Morning session 11.00 – 12.00. Nicolò Cesa-Bianchi (Università degli Studi di Milano): The mathematics of machine learning: between statistics and game theory 12.00 – 12.30. Xavier Mathieu Raymond Venel (Luiss University): Weighted average-convexity in Cooperative Games 12.30 – 13.00. Guido Schaefer (CWI, Netherlands): To Trust or Not to Trust: Assignment Mechanisms with Predictions 13.00 – 14.30: Lunch break Afternoon session 14.30 – 15.00. Pietro Caputo (University Roma Tre): Nonlinear Monte Carlo dynamics for the Ising model: some convergence results 15.00 – 15.30. Matteo Quattropani (Sapienza University of Rome): Mixing of the Averaging process on graphs and hypergraphs 15.30 – 16.00. Robin Vacus (Bocconi University): Minority Dynamics: the Short and Winding Road to Consensus 16.00 – 16.30: Coffee break 16.30 – 17.00. Maria Sofia Bucarelli (Sapienza University of Rome): On Generalization Bounds for Projective Clustering 17.00 – 17.30. Francesco D'Amore (Bocconi University): The Strong Lottery Ticket Hypothesis and the Random Subset Sum Problem 17.30 – 18.00. Federico Fusco (Sapienza University of Rome): The Role of Transparency in Repeated First-Price Auctions with Unknown Valuations _______________________________________________________ LIST OF ABSTRACTS Maria Sofia Bucarelli: On Generalization Bounds for Projective Clustering. Given a set of points, clustering consists of finding a partition of a point set into k clusters such that the center to which a point is assigned is as close as possible. Most commonly, centers are points themselves, which leads to the famous k-median and k-means objectives. One may also choose centers to be j dimensional subspaces, which gives rise to subspace clustering. In this paper, we consider learning bounds for these problems. That is, given a set of n samples P drawn independently from some unknown, but fixed distribution D, how quickly does a solution computed on P converge to the optimal clustering of D? We give several near p optimal results. In particular, 1) For center-based objectives, we show a convergence rate of O(√k/n). This matches the known optimal bounds of [Fefferman, Mitter, and Narayanan, Journal of the Mathematical Society 2016] and [Bartlett, Linder, and Lugosi, IEEE Trans. Inf. Theory 1998] for k-means and extends it to other important objectives such as k-median. 2) For subspace clustering with j-dimensional subspaces, we show a convergence rate of O(√kj2/n). These are the first provable bounds for most of these problems. For the specific case of projective clustering, which generalizes k-means, we show a converge rate of Ω(√kj/n) is necessary, thereby proving that the bounds from [Fefferman, Mitter, and Narayanan, Journal of the Mathematical Society 2016] are essentially optimal. Nicolò Cesa-Bianchi: The mathematics of machine learning: between statistics and game theory. Machine learning is the main driving force behind the current AI revolution. To provide a solid mathematical foundation to learning systems, we must formally characterize what a machine can learn and what is the minimal amount of training data needed to achieve a desired performance. In this talk, I will describe the two main approaches to algorithmic learnability, one rooted in statistics and one in game theory, and explore their connections. Pietro Caputo: Nonlinear Monte Carlo dynamics for the Ising model: some convergence results. We introduce and analyze a natural class of nonlinear Monte Carlo dynamics for spin systems such as the Ising model. The evolution is based on the framework of mass action kinetics, which models systems undergoing collisions, and captures a number of nonlinear models from various fields, including chemical reaction networks, Boltzmann’s model of an ideal gas, recombination in population genetics and genetic algorithms. In the context of spin systems, it is a nonlinear analog of the familiar Monte Carlo method based on Markov chains, such as Glauber dynamics and block dynamics, which are by now well understood. The nonlinearity makes the dynamics much harder to analyze, and even the most basic convergence issues are far from being settled. We discuss several open problems. The main result is an optimal estimate on the rate of convergence to stationarity in a regime of high temperature. Our analysis combines tools from percolation, branching and fragmentation processes. Based on joint work with Alistair Sinclair. Francesco D’Amore: The Strong Lottery Ticket Hypothesis and the Random Subset Sum Problem. The Strong Lottery Ticket Hypothesis (SLTH) posits that randomly-initialized neural networks contain subnetworks (strong lottery tickets) that achieve competitive accuracy when compared to sufficiently small target networks, even those that have been trained. Empirical evidence for this phenomenon was first observed by Ramanujan et al. in 2020, spurring a line of theoretical research: Malach et al. (ICML ’20), Pensia et al. (NeurIPS ’20), da Cunha et al. (ICLR ’20), and Burkholz (ICML & ICLR ’22) have analytically proved formulations of the SLTH in various neural network classes and under different hypotheses. In this presentation, we provide an overview of the state-of-the-art theoretical research on the SLTH and its connection with the Random Subset Sum (RSS) problem in theoretical computer science. While previous works on the SLTH ensure that the strong lottery ticket can be obtained via unstructured pruning, we demonstrate how recent advances in the multidimensional generalization of the RSS problem can be leveraged to obtain forms of structured pruning. Additionally, we highlight how refining the RSS results would yield tighter formulations of the SLTH. This presentation is based on a joint work with A. Da Cunha and E. Natale appeared at NeurIPS 2023. Federico Fusco: The Role of Transparency in Repeated First-Price Auctions with Unknown Valuations. We study the problem of regret minimization for a single bidder in a sequence of first-price auctions where the bidder discovers the item’s value only if the auction is won. Our main contribution is a complete characterization, up to logarithmic factors, of the minimax regret in terms of the auction’s transparency, which controls the amount of information on competing bids disclosed by the auctioneer at the end of each auction. Our results hold under different assumptions (stochastic, adversarial, and their smoothed variants) on the environment generating the bidder’s valuations and competing bids. These minimax rates reveal how the interplay between transparency and the nature of the environment affects how fast one can learn to bid optimally in first-price auctions. The talk is based on a joint work with Nicolò Cesa-Bianchi, Tommaso Cesari, Roberto Colomboni, and Stefano Leonardi, which will appear at STOC 2024. Matteo Quattropani: Mixing of the Averaging process on graphs and hypergraphs. The Averaging process is a mass redistribution process over the vertex set of a graph or, more generally, a hypergraph. Given a (hyper)graph G, the process starts with a non-negative mass associated with each vertex. At each discrete time step, one of the (hyper)edges of G is sampled at random and the total mass associated with the vertices of the chosen (hyper)edge is equally redistributed among its vertices. Clearly, as time grows to infinity, the state of the system will converge to a flat configuration in which all the vertices have the same mass. This very simple process appeared in different literatures under various names, and it was introduced to the probabilistic community by Aldous and Lanoue in 2012. However, until a few years ago, there were no sharp quantitative results on the time needed to reach equilibrium. Indeed, the analysis of this process requires different tools compared to the classical Markov chain framework, and even in the case of seemingly straightforward geometries—such as the complete graph or the cycle—it can be handled only by means of nontrivial probabilistic and functional analytic techniques. During the talk, I’ll give an overview of the problem and its difficulties, present the classes of examples that are currently settled, and mention some possible future directions of investigation. Based on joint work with Pietro Caputo and Federico Sau. Guido Schaefer: To Trust or Not to Trust: Assignment Mechanisms with Predictions. The realm of algorithms with predictions has led to the development of several new algorithms that leverage (potentially erroneous) predictions to enhance their performance guarantees. The challenge here is to devise algorithms that achieve optimal approximation guarantees as the prediction quality varies from perfect (consistency) to imperfect (robustness). This framework is particularly appealing in mechanism design contexts, where predictions might convey private information about the agents. In this talk, we present our recent results on the design of truthful mechanisms that leverage predictions to achieve improved approximation guarantees for several variants of the generalized assignment problem (GAP). We consider the private graph model introduced by Dughmi and Ghosh (2010), where the set of resources that an agent is compatible with is private information. We investigate GAP in the private graph model augmented with a prediction of the optimal assignment. We give a deterministic group-strategyproof mechanism that is (1 + 1/γ)-consistent and (1 + γ)-robust for the special case of bipartite matching, where γ ≥ 1 is some confidence parameter. We also prove that this is best possible. Remarkably, our mechanism draws inspiration from the renowned Gale-Shapley algorithm, incorporating predictions as a crucial element. For more general GAP variants, we introduce a unified greedy scheme and use randomization to derive universally group-strategyproof mechanisms that achieve improved consistency and robustness guarantees in expectation. Robin Vacus: Minority Dynamics: the Short and Winding Road to Consensus. The ”minority” rule is a peculiar opinion dynamics, which prompts agents to adopt the opinion least represented in a sample – in contrast to its far more famous and natural counterpart, the majority rule. Yet, as long as the sample size is large enough and communications happen in parallel, it proves to be an efficient way to reach agreement. Moreover, contrary to traditional consensus protocols, it demonstrates extreme sensitivity to even a small number of ”stubborn” individuals, enabling fast information propagation within the group. In this presentation, I will describe an analysis of convergence time, showcase simulation results, and discuss several open problems, shedding light on what is currently understood and what remains to be explored about this fascinating dynamic. This talk is based on a recent work with Luca Becchetti, Andrea Clementi, Francesco Pasquale, Luca Trevisan and Isabella Ziccardi, that was published in SODA 2024. Xavier Mathieu Raymond Venel: Weighted average-convexity in Cooperative Games. It is well known that the Shapley value of a convex game always belongs to the core. Looking for a weaker condition than convexity insuring that the Shapley value of a game lies in the core, Inarra and Usategui (1993) relaxed the convexity assumption by introducing the notion of average convexity. Assuming that weights are associated with the players, we generalize the notion of convexity and average-convexity for cooperative TU games to the notion of weighted average-convexity. We prove that if a game is weighted average-convex, then the corresponding weighted Shapley value is in the core. We then study the relations between weighted average-convexity, core-inclusion, and communication TU-games. We exhibit necessary and sufficient conditions on the underlying graph to preserve weighted average-convexity from any communication game to the associated Myerson restricted game, extending some previous results established in Slikker (1998). Joint work with Alexandre Skoda.

1 0

Seminar Dr Frank Fu (MathWorks) - Roma Tre University
by Francesco Cesarone 07 May '24

07 May '24

Dear all, I am pleased to announce the upcoming seminar "MATLAB Applications in Finance<https://it.mathworks.com/company/events/seminars/matlab-applications-in-fin…>" held by Frank Fu, Academic Manager MathWorks, on May 17th, 2024. The seminar is part of a series (Friday Seminar Series) organized by the Research Group in Quantitative Finance, Department of Business Studies - Roma Tre University. It is aimed at students majoring in or interested in business, economics, and finance, lecturers, and professors who teach such subjects or do academic research in those areas. The seminar can be attended physically at the Computer Lab (small classroom) on the ground floor (Department of Business Studies - Roma Tre University, Via Silvio D'Amico, 77, 00145 Rome, Italy) or online via teams. Participation is free, but registration for the seminar is mandatory (link<https://it.mathworks.com/company/events/seminars/matlab-applications-in-fin…>). More information can be also found on the following webpage<https://www.francescocesarone.com/msc-in-finance/friday-seminar-series>. Best regards, Francesco Cesarone F Cesarone (2020), Computational Finance. MATLAB oriented modeling, Routledge-Giappichelli Studies in Business and Management, ISBN 978-0-367-49303-5<https://www.giappichelli.it/computational-finance> For more info: https://www.francescocesarone.com/books -- Francesco Cesarone - Ph.D. Associate Professor Department of Business Studies Roma Tre University Via Silvio D'Amico, 77 00145 - Roma, Italy tel: +39 06 57335744 Skype: francesco.cesarone email: francesco.cesarone(a)uniroma3.it<mailto:francesco.cesarone@uniroma3.it> Studio n. 20 piano V WWW: https://www.francescocesarone.com/

1 0

Seminario di Federico Sau a Roma Tre il 14 maggio
by Pietro Caputo 07 May '24

07 May '24

Martedì* 14 Maggio* 2024 alle ore *14:30*, Federico Sau (Università degli Studi di Trieste) terrà il seminario di Probabilità dal titolo "*Scaling limits of the averaging process*". Abstract: The averaging process on a graph is a continuous-space Markov chain, which is commonly interpreted as an opinion dynamics, a distributed algorithm, or an interface moving through a randomized sequence of deterministic local updates. Its dynamics goes as follows. Attach i.i.d. Poisson clocks to edges, and assign real values to vertices; at the arrival times of these clocks, update the values with their average. As time runs, the averaging process converges to a flat configuration, and one major problem in the field is that of quantifying the speed of convergence to its degenerate equilibrium in terms of characteristic features of the underlying graph. In this talk, after reviewing some basic properties and recent results on mixing times for the averaging process on general graphs, we focus on the discrete $d$-dimensional torus, and on some finer properties of the process in this setting. We discuss some quantitative features (e.g., limit profile, early concentration and local smoothness), and look at nonequilibrium fluctuations, a particularly interesting problem in this degenerate context lacking a non-trivial notion of local equilibrium. If time permits, we will touch on the main ideas of the proof of such scaling limits, which combine tools from Malliavin calculus in Poisson space, their probabilistic dynamic interpretations, and some new discrete-gradient estimates. Talk based on the preprints arXiv.2311.14176, arXiv.2403.02032. Il seminario si svolgerà in presenza presso il Dipartimento di Matematica e Fisica - Lungotevere Dante 376 (Blocco Aule) - *Aula M2*

1 0

RTT MAT/06 - Milano Statale
by Andrea Cosso 06 May '24

06 May '24

Buonasera, vi segnalo che è stato bandito un posto di ricercatore tenure-track (RTT) in MAT/06 presso il Dipartimento di Matematica dell’Università degli Studi di Milano. Il bando si trova al seguente link: https://www.unimi.it/it/ateneo/lavora-con-noi/reclutamento-ricercatori/sele… La scadenza per la presentazione delle domande è il 31 maggio 2024. Cordiali saluti, Andrea Cosso English version Dear colleagues, the Mathematics Department of the University of Milan has opened a position as tenure-track researcher (RTT) in the scientific sector MAT/06 (Probability and Mathematical Statistics): https://www.unimi.it/en/university/work-us/researcher-recruitment/researche… The deadline for applications is May 31, 2024. Best regards, Andrea Cosso

1 0

COPA 2024 @ Polimi | Registration is now open
by Simone Vantini 06 May '24

06 May '24

Dear all, we announce that registrations for COPA 2024 - 13th Symposium on Conformal and Probabilistic Prediction with Applications (September 9-11, 2024, Politecnico di Milano) are now open! The early bird rates are available until May 30, 2024 together with discount rates for PhD students. The registration fee cover: Participation to keynote lectures, conference tutorials, contributed sessions, and poster session. Coffee breaks and lunches. Walking tour of the historical center of Milan. Visit to the Leonardo da Vinci’s Last Supper. An additional fee of 60 euros is required to attend the social dinner scheduled for Wednesday, September 11, 2014. You can find the link to register on the Conference webpage: https://copa-conference.com/ <https://copa-conference.com/>. In addition, we inform you that the call for papers successfully closed on April 15, 2024. We are now pleased to announce the opening of the call for posters! This is a fantastic opportunity to share your innovative ideas and ongoing research with a global audience. Submit your abstract (max 300 words) by May 17, 2024 on Easychair: https://easychair.org/cfp/copa2024 <https://easychair.org/cfp/copa2024>. Join us for an event filled with insightful discussions, groundbreaking research presentations, and networking opportunities. We eagerly look forward to your participation! Kind regards, Simone Vantini Associate Professor of Statistics MOX Laboratory for Modeling and Scientific Computing Department of Mathematics, Politecnico di Milano simone.vantini(a)polimi.it <mailto:simone.vantini@polimi.it> Matteo Fontana Lecturer in Data Science Department of Computer Science School of Engineering, Physical and Mathematical Sciences, Royal Holloway, University of London matteo.fontana(a)rhul.ac.uk <mailto:matteo.fontana@rhul.ac.uk>

1 0

Seminario PRISMA oggi
by Francesco Caravenna 06 May '24

06 May '24

Seminari on-line del gruppo UMI - PRISMA (http://www.umi-prisma.polito.it/ <http://www.umi-prisma.polito.it/>) Ricordiamo che oggi, lunedì 6 maggio 2024, Domenico Marinucci (Università di Roma Tor Vergata) e Anna Vidotto (Università di Napoli Federico II) ci parleranno di La geometria degli insiemi di escursione per campi aleatori Gaussiani e La geometria dei campi aleatori sfera-per-tempo con il seguente orario: 16:00 Primo seminario 16:30 Pausa e discussione 16:45 Secondo seminario 17:15 Conclusione e discussione Trovate di seguito il riassunto. I seminari verranno trasmessi via Zoom al seguente link: https://uniroma1.zoom.us/j/82939128330 <https://uniroma1.zoom.us/j/82939128330> Meeting ID: 829 3912 8330 Vi aspettiamo numerosi, Valentina Cammarota e Francesco Caravenna %%%%%%%%%%%%%%%%%%%%%%%%%%%% RELATORI: Domenico Marinucci (Università di Roma Tor Vergata) e Anna Vidotto (Università di Napoli Federico II) TITOLO: La geometria degli insiemi di escursione per campi aleatori Gaussiani. RIASSUNTO: Obiettivo del seminario sarà di presentare una panoramica relativamente informale su alcuni risultati nell'analisi della geometria dei campi aleatori che sono stati ottenuti negli ultimi 10 anni circa. In particolare, si inizierà ricordando i risultati sulle curvature di Lipschitz-Killing di insiemi di escursione per campi Gaussiani (la Gaussian Kinematic Formula di Adler e Taylor); si proseguirà quindi con risultati per la varianza e teoremi del limite centrale nel regime di asintotica ad alta frequenza, discutendo anche le connessioni con altri campi della probabilità (in particolare, le espansioni in caos di Wiener ed il metodo di Stein-Malliavin). Se il tempo lo permetterà, si discuterà altresì la struttura di interdipendenza tra curvature di Lipschitz-Killing e punti critici, con alcuni cenni agli sviluppi più recenti (la geometria dei fibrati aleatori) e alle motivazioni/applicazioni di questi risultati. TITOLO: La geometria dei campi aleatori sfera-per-tempo. RIASSUNTO: Obiettivo del mio seminario sarà introdurre un nuovo regime asintotico per lo studio di campi aleatori definiti sulla sfera unitaria e dipendenti dal tempo. Considereremo statistiche di diversi funzionali geometrici costruite a partire dagli insiemi di livello del campo aleatorio e definite su un arco temporale crescente. Vedremo che le loro proprietà asintotiche, in particolare varianza e distribuzione limite, dipenderanno da un’interazione tra memoria temporale e livello. Infine, discuteremo brevemente le possibili applicazioni di questi modelli e dei risultati enunciati ad uno studio statistico delle proprietà dei campi aleatori di partenza, e conseguenti risvolti pratici nel campo delle scienze del Clima. %%%%%%%%%%%%%%%%%%%%%%%%%%%% I seminari PRISMA hanno un formato di "colloquium" per creare un'occasione di scambio e discussione con tutta la comunità dei probabilisti e statistici italiani. Ogni giornata comprende due relatori che tengono due seminari di 30 minuti strettamente connessi, per presentare alla comunità una prospettiva sul proprio ambito di ricerca. Da quest'anno le registrazioni dei seminari vengono pubblicate sul canale YouTube dell'UMI: https://youtube.com/playlist?list=PLmySpc-jrtAMq84VH71evyqPc1hl6eEQb <https://youtube.com/playlist?list=PLmySpc-jrtAMq84VH71evyqPc1hl6eEQb> %%%%%%%%%%%%%%%%%%%%%%%%%%%%

1 0

Jump to page:

2025

2024

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

Random