Limiting regimes in random graphs

Abstract:

This talk will start with a review of basic material on probability bounds, stochastic convergence, and the Central Limit Theorem. We will then apply these concepts to the topic of subgraph counting in random graphs, which is essential for understanding the structure and dynamics of social, biological, and quantum networks. In particular, we will consider the limiting distribution of subgraph counts in the Erdos-Renyi model, the subgraph containment problem, and the detection of clusters and communities in random graphs.

Biography: 

Nicolas Privault is a professor in the School of Physical and Mathematical Sciences at NTU. His research interests are in stochastic analysis and its applications.

Materials:

The materials for this seminar series are available in the folder:  PH4511 Materials