Clustering coefficients of large networks
From MaRDI portal
Publication:2292961
DOI10.1016/j.ins.2016.12.027zbMath1429.05191OpenAlexW2562576330MaRDI QIDQ2292961
Yiting Yang, Yusheng Li, Yilun Shang
Publication date: 6 February 2020
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: http://nrl.northumbria.ac.uk/id/eprint/36450/1/Li%20et%20al%20-%20Clustering%20coefficients%20of%20large%20networks%20AAM.pdf
Applications of graph theory (05C90) Small world graphs, complex networks (graph-theoretic aspects) (05C82)
Related Items (2)
The hyperbolicity constant of infinite circulant graphs ⋮ Computing exact \(p\)-values for community detection
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Spectra of edge-independent random graphs
- Distinct clusterings and characteristic path lengths in dynamic small-world networks with identical limit degree distribution
- On the spectrum of projective norm-graphs
- Evolution of the social network of scientific collaborations
- Sparse quasi-random graphs
- The diameter of a scale-free random graph
- Approximating Clustering Coefficient and Transitivity
- A proof of Alon’s second eigenvalue conjecture and related problems
- Paths in graphs
- Collective dynamics of ‘small-world’ networks
- A General Framework for Weighted Gene Co-Expression Network Analysis
- Quasi-random graphs
- Networks
This page was built for publication: Clustering coefficients of large networks