University of Birmingham > Talks@bham > Combinatorics and Probability seminar > Scaling limits of critical inhomogeneous random graphs

Scaling limits of critical inhomogeneous random graphs

Add to your list(s) Download to your calendar using vCal

  • UserMinmin Wang (University of Bath)
  • ClockTuesday 13 February 2018, 15:00-16:00
  • HouseWatson LTA.

If you have a question about this talk, please contact Allan Lo.

Branching processes are known to be useful tools in studying random graphs, for instance in understanding the phase transition phenomenon in the asymptotics sizes of their connected components. In this talk, I’d like to discuss some applications of Galton—Watson trees (genealogy of branching process) in studying the geometrical aspects of random graphs. In particular, we will look at the so-called Poisson random graph, a random graph model which generalises the Erdos-Renyi graph G(n, p) and which has been previously studied by Aldous and Limic for its close connection with the multiplicative coalescents. Relying upon an embedding of the graph into a Galton-Watson forest, we can identify the scaling limits of these graphs inside the critical window.

Based on a joint work with Nicolas Broutin and Thomas Duquesne.

This talk is part of the Combinatorics and Probability seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


Talks@bham, University of Birmingham. Contact Us | Help and Documentation | Privacy and Publicity.
talks@bham is based on from the University of Cambridge.