Abstract: In this talk, we will consider random graphs with fixed degree sequences and Bernoulli percolation on top. To start with, we will survey a few known results on the component structure of these graphs. Then, we will take a closer look at the switching method, which is a key tool in our analysis, and will give the ideas behind the proofs of our main results. In the end of the talk, if time permits, we will see an example of a random graph with multi-jump behaviour for the size of its largest component at different percolation thresholds. The talk is based on a joint work with Dieter Mitsche and Guillem Perarnau.
Percolation on dense random graphs with given degrees
13.04.2023 14:00 - 16:00
Organiser:
M. Lis (TU Wien)
Location: