The small world phenomenon in hybrid power law graphs

zbMATH Open1080.05085MaRDI QIDQ3370774FDOQ3370774

Authors: Linyuan Lu, Fan Chung 

Publication date: 8 February 2006

Recommendations

• Algorithms and Models for the Web-Graph
• Modeling the Small-World Phenomenon with Local Network Flow
• The small-world phenomenon: an algorithmic perspective
• The small-community phenomenon in networks
• The average distances in random graphs with given expected degrees

zbMATH Keywords

random graphsdecomposition algorithmdegree distributionlocal graphglobal graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Social networks; opinion dynamics (91D30) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35)

Cited In (8)

• Algorithms and Models for the Web-Graph
• Recovering the long-range links in augmented graphs
• Modeling and Designing Real–World Networks
• On reversible cascades in scale-free and Erdős-Rényi random graphs
• Drawing power law graphs using a local/global decomposition
• The small-community phenomenon in networks
• Structural sparsity of complex networks: bounded expansion in random models and real-world graphs
• Modeling the Small-World Phenomenon with Local Network Flow

This page was built for publication: The small world phenomenon in hybrid power law graphs

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