Percolation on dense random graphs with given degrees

DOI10.1016/J.JCTB.2024.03.002MaRDI QIDQ6500105zbMATH OpenFDO

Authors Lyuben Lichev, D. Mitsche, Guillem Perarnau

Publication date 10 May 2024

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.JCTB.2024.03.002

zbMATH Keywords

degree sequencegiant componentpercolationswitching methodthreshold

Mathematics Subject Classification ID

Density (toughness, etc.) (05C42) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Interacting random processes; statistical mechanics type models; percolation theory (60K35)

Recommendations

• Percolation on random graphs with a fixed degree sequence
• Percolation on sparse random graphs with given degree sequence
• Percolation on dense graph sequences
• On percolation in random graphs with given vertex degrees

Cites work

• A critical point for random graphs with a given degree sequence
• A new approach to the giant component problem
• An old approach to the giant component problem
• Critical percolation on random regular graphs
• Critical percolation on random regular graphs
• Critical percolation on scale-free random graphs: new universality class for the configuration model
• Edge percolation on a random regular graph of low degree
• Graph colouring and the probabilistic method
• How to determine if a random graph with a fixed degree sequence has a giant component
• scientific article; zbMATH DE number 3773632 (Why is no real title available?)
• scientific article; zbMATH DE number 1342092 (Why is no real title available?)
• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• scientific article; zbMATH DE number 3198427 (Why is no real title available?)
• Introduction to Random Graphs
• On percolation in random graphs with given vertex degrees
• Percolation on random graphs with a fixed degree sequence
• Percolation on Sparse Random Graphs with Given Degree Sequence
• Random graphs and complex networks. Volume 1
• T. E. Harris and branching processes
• The component sizes of a critical random graph with given degree sequence
• The giant component threshold for random regular graphs with edge faults H. Prodinger
• The phase transition in the configuration model
• The scaling window for a random graph with a given degree sequence
• The Size of the Giant Component of a Random Graph with a Given Degree Sequence

Cited in

(2)

• Components, large and small, are as they should be. II: Supercritical percolation on regular graphs of constant degree
• Components, large and small, are as they should be I: supercritical percolation on regular graphs of growing degree

This page was built for publication: Percolation on dense random graphs with given degrees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6500105)