The Small Community Phenomenon in Networks: Models, Algorithms and Applications
From MaRDI portal
Publication:2898016
DOI10.1007/978-3-642-29952-0_10zbMath1354.68210OpenAlexW124672703MaRDI QIDQ2898016
Publication date: 16 July 2012
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-29952-0_10
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Graph clustering
- On certain connectivity properties of the internet topology
- The small-community phenomenon in networks
- Community Structures in Classical Network Models
- Emergence of Scaling in Random Networks
- Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters
- The small-world phenomenon
- Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems
- On clusterings
- A Geometric Preferential Attachment Model of Networks II
- Communities in Networks
- Contagion
- Finding sparse cuts locally using evolving sets
- Collective dynamics of ‘small-world’ networks
- Social networks spread rumors in sublogarithmic time
- A Geometric Preferential Attachment Model of Networks II
This page was built for publication: The Small Community Phenomenon in Networks: Models, Algorithms and Applications