Date/heure
12 mars 2026
09:15 - 10:15
Lieu
Salle de conférences Nancy
Oratrice ou orateur
Mariana Olvera-Cravioto (UNC Chapel Hill)
Catégorie d'évènement Groupe de travail Probabilités et Statistique
Résumé
This talk will give an overview of how random graphs can be used to model complex networks as well as processes that run on them. The main motivating examples are the analysis of network centrality and community structure on directed networks, such as the web, and the evolution of opinions on a social network. The main focus of the talk will be on the various types of random graph models that are commonly used, including both static and dynamic ones. I will discuss the notion of “sparsity” and explain how it impacts both the analysis and the type of results that one can obtain. For sparse graphs I will describe the notion of “local weak convergence” and explain how it can be used to obtain tractable approximations for stochastic processes on random graphs that depend only on the network’s statistical properties.