The clustering coefficient and the diameter of small-world networks
From MaRDI portal
Publication:1942663
DOI10.1007/s10114-012-0387-6zbMath1260.05151OpenAlexW2077862183MaRDI QIDQ1942663
Hui Lin Huang, Lei Gu, Xiao Dong Zhang
Publication date: 19 March 2013
Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10114-012-0387-6
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items (3)
Contagion dynamics on a compound model ⋮ Improvement of path analysis algorithm in social networks based on HBase ⋮ Norm equalities and inequalities for three circulant operator matrices
Cites Work
- Unnamed Item
- Unnamed Item
- \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
- Renormalization group analysis of the small-world network model
- Lower bounds for the eigenvalues of Laplacian matrices
- Discrete small world networks
- Small worlds
- The Diameter of a Cycle Plus a Random Matching
- The Structure and Function of Complex Networks
- Random graph models of social networks
- Consensus and synchronization problems on small-world networks
- Collective dynamics of ‘small-world’ networks
This page was built for publication: The clustering coefficient and the diameter of small-world networks
