Connectivity of Poissonian inhomogeneous random multigraphs

DOI10.5614/EJGTA.2023.11.1.8zbMath1514.05085arXiv2003.00493MaRDI QIDQ6164653

Lorenzo Federico

Publication date: 4 July 2023

Published in: Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)

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

zbMATH Keywords

connectivity thresholdinhomogeneous random graphsgraphons

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Connectivity (05C40)

Cites Work

• Unnamed Item
• Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing
• Evolution of the \(n\)-cube
• Percolation on dense graph sequences
• Diameter, connectivity, and phase transition of the uniform random intersection graph
• Phase transitions in a complex network
• Connectivity of inhomogeneous random graphs
• Random Subgraphs in Sparse Graphs
• Random intersection graphs whenm=?(n): An equivalence theorem relating the evolution of theG(n,m,p) andG(n,p) models
• Speed and concentration of the covering time for structured coupon collectors
• The phase transition in inhomogeneous random graphs
• Critical Window for Connectivity in the Configuration Model
• On a conditionally Poissonian graph process

This page was built for publication: Connectivity of Poissonian inhomogeneous random multigraphs