On connectivity and robustness of random graphs with inhomogeneity

DOI10.1017/jpr.2022.32OpenAlexW4294591209MaRDI QIDQ5881000

Yilun Shang

Publication date: 9 March 2023

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/jpr.2022.32

zbMATH Keywords

robustnessconnectivityrandom graphthreshold

Mathematics Subject Classification ID

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

Related Items (4)

Matrix-scaled resilient consensus of discrete-time and continuous-time networks ⋮ Rainbow connectivity and rainbow index of inhomogeneous random graphs ⋮ Long paths in heterogeneous random subgraphs of graphs with large minimum degree ⋮ Estrada index of dynamic random graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the spectra of general random graphs
• Resilient consensus of switched multi-agent systems
• Determining \(r\)- and \((r,s)\)-robustness of digraphs using mixed integer linear programming
• Resilient synchronization of distributed multi-agent systems under attacks
• Introduction to Random Graphs
• On the strength of connectedness of a random graph
• Connectivity of finite anisotropic random graphs and directed graphs
• Every monotone graph property has a sharp threshold
• The phase transition in inhomogeneous random graphs
• A Notion of Robustness in Complex Networks
• Random Graphs

This page was built for publication: On connectivity and robustness of random graphs with inhomogeneity