Effect of random edge failure on the average path length

DOI10.1088/1751-8113/44/41/415002MaRDI QIDQ3095443zbMATH OpenOpenAlexFDO

Authors Dongchao Guo, Mangui Liang, Dandan Li, Zhongyuan Jiang

Publication date 2 November 2011

Published in Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/ef923fe70cb8784f5ef36825325b1b12d2022d58

zbMATH Keywords

average path length (APL)random graphsrandom removal of edgesuncorrelated random networks

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Recommendations

• The effect of random edge removal on network degree sequence
• Metric structure of random networks
• Failure of random networks
• On the average path length of a cycle plus random edges
• The average distances in random graphs with given expected degrees

Cited in

(4)

• Network robustness and random processes
• Tuning the average path length of complex networks and its influence to the emergent dynamics of the majority-rule model
• The effect of random edge removal on network degree sequence
• Exact computations for structural characteristics of BA exponential networks

This page was built for publication: Effect of random edge failure on the average path length

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