University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Matchings and rank for random diluted graphs

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Matchings and rank for random diluted graphs

Download to your calendar using vCal

If you have a question about this talk, please contact Mustapha Amrani .

Stochastic Processes in Communication Sciences

We study matchings on a sequence of random graphs that converge locally to trees. Inspired by techniques from random matrix theory, we rigorously prove the validity of the cavity method for the computation of the entropy. At a positive temperature, the cavity equations are interpreted as equations for the local marginals of the Boltzmann Gibbs distribution in the space of matchings on a (possibly) infinite tree. These equations also appear in the computation of the asymptotic rank of the adjacency matrices of the random graphs. We also define a determinantal process on the tree which is the limit at positive temperature of the matchings on the sequence of graphs. (joint work with Charles Bordenave and Justin Salez)

This talk is part of the Isaac Newton Institute Seminar Series series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Lucy Cavendish Talks Burna Boy Biography Live on Zoom, pre-registration essential here: bit.ly/3ncLK75

Other talks

Thelocactus Title to be confirmed Title to be confirmed Title to be confirmed Title to be confirmed Using numerical simulations for solving spectral geometry problems
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity