Percolation on Random Graphs with a Fixed Degree Sequence

DOI10.1137/20M1347607zbMath1480.05116arXiv1611.08496MaRDI QIDQ5020830

Nikolaos Fountoulakis, Felix Joos, Guillem Perarnau

Publication date: 7 January 2022

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1611.08496

zbMATH Keywords

bond percolationpower lawgiant componentrandom graphs with given degrees

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Cites Work

• Unnamed Item
• Unnamed Item
• A randomized embedding algorithm for trees
• How to determine if a random graph with a fixed degree sequence has a giant component
• Bootstrap percolation and the geometry of complex networks
• Edge percolation on a random regular graph of low degree
• On percolation in random graphs with given vertex degrees
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• The asymptotic number of labeled graphs with given degree sequences
• An old approach to the giant component problem
• Complex networks: structure and dynamics
• The Phase Transition in the Configuration Model
• The scaling window for a random graph with a given degree sequence
• Critical percolation on random regular graphs
• Statistical mechanics of complex networks
• A random graph model for massive graphs
• A new approach to the giant component problem
• Enumeration of Labelled Graphs I: 3-Connected Graphs
• The Size of the Giant Component of a Random Graph with a Given Degree Sequence
• The Structure and Function of Complex Networks
• Robustness and Vulnerability of Scale-Free Random Graphs
• Nonuniversality of weighted random graphs with infinite variance degree
• A critical point for random graphs with a given degree sequence
• The Critical Phase for Random Graphs with a Given Degree Sequence
• Percolation on Sparse Random Graphs with Given Degree Sequence
• The giant component threshold for random regular graphs with edge faults H. Prodinger
• Graph colouring and the probabilistic method

This page was built for publication: Percolation on Random Graphs with a Fixed Degree Sequence