On percolation in random graphs with given vertex degrees
From MaRDI portal
Publication:1039096
DOI10.1214/EJP.v14-603zbMath1189.60179arXiv0804.1656MaRDI QIDQ1039096
Publication date: 20 November 2009
Published in: Electronic Journal of Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0804.1656
Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Combinatorial probability (60C05)
Related Items (48)
Not all interventions are equal for the height of the second peak ⋮ Epidemic spreading and equilibrium social distancing in heterogeneous networks ⋮ Deterministic bootstrap percolation on trees ⋮ Mesoscopic scales in hierarchical configuration models ⋮ Bootstrap percolation in three dimensions ⋮ Scale-free network clustering in hyperbolic and other random graphs ⋮ Metastable Behavior of Bootstrap Percolation on Galton-Watson Trees ⋮ Inhomogeneous Financial Networks and Contagious Links ⋮ Sharp thresholds for contagious sets in random graphs ⋮ Strong-majority bootstrap percolation on regular graphs with low dissemination threshold ⋮ Critical percolation on scale-free random graphs: new universality class for the configuration model ⋮ How Clustering Affects Epidemics in Random Networks ⋮ Bootstrap percolation on a graph with random and local connections ⋮ Universality for critical heavy-tailed network models: metric structure of maximal components ⋮ Galton–Watson games ⋮ Kinetically constrained models with random constraints ⋮ Contagion risks and security investment in directed networks ⋮ Locality of random digraphs on expanders ⋮ Diffusion and cascading behavior in random networks ⋮ Bootstrap percolation in random geometric graphs ⋮ A sharper threshold for bootstrap percolation in two dimensions ⋮ Zero-temperature Glauber dynamics on \({\mathbb{Z}^d}\) ⋮ The sharp threshold for bootstrap percolation in all dimensions ⋮ Tight fluctuations of weight-distances in random graphs with infinite-variance degrees ⋮ Heavy-tailed configuration models at criticality ⋮ Preferential attachment without vertex growth: emergence of the giant component ⋮ Central limit theorems for SIR epidemics and percolation on configuration model random graphs ⋮ Critical random graphs and the differential equations technique ⋮ How to determine if a random graph with a fixed degree sequence has a giant component ⋮ Bootstrap Percolation in High Dimensions ⋮ Near-critical SIR epidemic on a random graph with given degrees ⋮ A trust model for spreading gossip in social networks: a multi-type bootstrap percolation model ⋮ Weighted distances in scale-free configuration models ⋮ Bootstrap percolation on the random graph \(G_{n,p}\) ⋮ Contagions in random networks with overlapping communities ⋮ Nonuniversality of weighted random graphs with infinite variance degree ⋮ RESILIENCE TO CONTAGION IN FINANCIAL NETWORKS ⋮ Infinite and Giant Components in the Layers Percolation Model ⋮ Geometry of the minimal spanning tree of a random 3-regular graph ⋮ On giant components and treewidth in the layers model ⋮ Component structure of the configuration model: Barely supercritical case ⋮ Susceptible-infected epidemics on evolving graphs ⋮ Strict Majority Bootstrap Percolation on Augmented Tori and Random Regular Graphs: Experimental Results ⋮ Limit theorems for assortativity and clustering in null models for scale-free networks ⋮ The stable graph: the metric space scaling limit of a critical random graph with i.i.d. power-law degrees ⋮ An old approach to the giant component problem ⋮ Percolation on Random Graphs with a Fixed Degree Sequence ⋮ Critical percolation on random regular graphs
This page was built for publication: On percolation in random graphs with given vertex degrees
