Título: Limit Theorems for Exponential Random Graphs
Palestrante: Alessandra Bianchi (Università di Padova)
Horário: 15h às 16h
Local: Transmissão online
Confira AQUI o link para a transmissão.
Resumo: Exponential Random Graphs are defined through probabilistic ensembles with one or more adjustable parameters. They can be seen as a generalization of the classical Erdos Renyi random graph, obtained by defining a tilted probability measure that is proportional to the densities of certain given finite subgraphs.
In this talk we will focus on the edge-triangle model, that is a two-parameter family of exponential random graphs in which dependence between edges is introduced through triangles. Borrowing tools from statistical mechanics, together with large deviations techniques, we will characterize the limiting behavior of the edge density for all parameters in the so-called replica symmetric regime, where a complete characterization of the phase diagram of the model is accessible. First, we determine the asymptotic distribution of this quantity, as the graph size tends to infinity, in the various phases. Then we study the fluctuations of the edge density around its average value off the critical curve and formulate conjectures about the behavior at criticality based on the analysis of a mean-field approximation of the model.
Joint work with Francesca Collet and Elena Magnanini (available at HERE).
Todas as palestras são realizadas em Inglês.
Informações mais completas sobre os seminários estão disponíveis AQUI.