The small-community phenomenon in networks
From MaRDI portal
Publication:2888854
DOI10.1017/S0960129511000570zbMath1243.68227arXiv1107.5786MaRDI QIDQ2888854
Publication date: 4 June 2012
Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1107.5786
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10)
Related Items (4)
The Small Community Phenomenon in Networks: Models, Algorithms and Applications ⋮ Justifying the small-world phenomenon via random recursive trees ⋮ Algorithmic aspects of homophyly of networks ⋮ A Theory of Network Security: Principles of Natural Selection and Combinatorics
Cites Work
- Community Structures in Classical Network Models
- Degree sequences of geometric preferential attachment graphs
- On clusterings
- A Geometric Preferential Attachment Model of Networks II
- Note on the heights of random recursive trees and random m‐ary search trees
- Random Geometric Graphs
- The strong convergence of maximal degrees in uniform random recursive trees and dags
- The effect of power-law degrees on the navigability of small worlds
- A Geometric Preferential Attachment Model of Networks
This page was built for publication: The small-community phenomenon in networks