Percolation on sparse random graphs with given degree sequence
From MaRDI portal
Abstract: We study the two most common types of percolation process on a sparse random graph with a given degree sequence. Namely, we examine first a bond percolation process where the edges of the graph are retained with probability p and afterwards we focus on site percolation where the vertices are retained with probability p. We establish critical values for p above which a giant component emerges in both cases. Moreover, we show that in fact these coincide. As a special case, our results apply to power law random graphs. We obtain rigorous proofs for formulas derived by several physicists for such graphs.
Recommendations
Cited in
(40)- On certain perturbations of the Erdös-Renyi random graph
- On percolation in random graphs with given vertex degrees
- Critical random graphs and the differential equations technique
- Algebraic bounds for heterogeneous site percolation on directed and undirected graphs
- Geometry of the minimal spanning tree of a random 3-regular graph
- Susceptible-infected epidemics on evolving graphs
- The constrained-degree percolation model
- Heavy-tailed configuration models at criticality
- Preferential attachment without vertex growth: emergence of the giant component
- Percolation on dense graph sequences
- First and second moments of the size distribution of bond percolation clusters on rings, paths and stars
- An old approach to the giant component problem
- Phase transitions on Markovian bipartite graphs-an application of the zero-range process
- On giant components and treewidth in the layers model
- Multi-type directed scale-free percolation
- Critical percolation on random regular graphs
- Percolation on sequences of graphs
- Bond percolation on a class of correlated and clustered random graphs
- Dynamics of random graphs with bounded degrees
- Percolation in a hierarchical random graph
- Effect of scale on long-range random graphs and chromosomal inversions
- Critical percolation on random regular graphs
- Percolation Analysis of Clusters in Random Graphs
- Inhomogeneous percolation models for spreading phenomena in random graphs
- Percolation on random graphs with a fixed degree sequence
- Component structure of the configuration model: barely supercritical case
- Percolation in general graphs
- Spread‐out percolation in ℝd
- Percolation threshold approximations based on the second moment of the degree distribution
- Degree-ordered-percolation on uncorrelated networks
- Percolation on Sparse Random Graphs with Given Degree Sequence
- Absence of percolation in graphs based on stationary point processes with degrees bounded by two
- Metastability of the Potts ferromagnet on random regular graphs
- Percolation of arbitrary uncorrelated nested subgraphs
- Percolation on dense random graphs with given degrees
- Barely supercritical percolation on Poissonian scale-free networks
- Components, large and small, are as they should be. II: Supercritical percolation on regular graphs of constant degree
- Large induced subgraphs of random graphs with given degree sequences
- The convergence of the exploration process for critical percolation on the k-out graph
- Triangle percolation in mean field random graphs-with PDE
This page was built for publication: Percolation on sparse random graphs with given degree sequence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5894145)
