Search
Talk

Near-critical random graphs, a probabilistic approach

  • Vlada Limic (Université Paris-Sud)
A3 01 (Sophus-Lie room)

Abstract

The Erdös-Rényi random graph was defined in a seminal 1973 paper by Erdös and Rényi, an English translation of which appeared in 1976. The model is of percolation type, and exhibits a phase transition as the number of particles (vertices, points) diverges, and the connective probability (of each pair of vertices) is about its reciprocal. Since 1970's random graphs have been widely studied, initially mostly by combinatorists. In 1997 the probabilistic approach began with a famous work by Aldous on random graphs and the standard (i.e. Aldous') multiplicative coalescent. The talk is intended to serve as an introduction to this research direction. It will try to explain the core of the 20 year old results, as well as certain recent improvements and developments. In anticipation of a mixed audience (analysits+probabilists+possibly others?) the talk will resemble more to a colloqium than to a probability working seminar.

Katja Heid

MPI for Mathematics in the Sciences Contact via Mail

Upcoming Events of This Seminar

  • Mar 12, 2024 tba with Theresa Simon
  • Mar 26, 2024 tba with Phan Thành Nam
  • Mar 26, 2024 tba with Dominik Schmid
  • May 7, 2024 tba with Manuel Gnann
  • May 14, 2024 tba with Barbara Verfürth
  • May 14, 2024 tba with Lisa Hartung
  • Jun 25, 2024 tba with Paul Dario
  • Jul 16, 2024 tba with Michael Loss