Séminaire de Probabilités commun ICJ/UMPA

Percolation on dense random graphs with given degrees

par Lyuben Lichev

Europe/Paris
435 (UMPA)

435

UMPA

Description
In this talk, we will consider the random graph with given degree sequence and Bernoulli percolation on top. To start with, we will survey several old and new results on the component structure of this graph. Then, we will concentrate on the switching technique, which is our main tool, and will give the idea behind the proofs of our main results. If time permits, we will see an interesting example of a multi-jump behaviour for the size of the largest component at different percolation thresholds. The talk is based on a joint work with Dieter Mitsche and Guillem Perarnau.