Local Clustering Coefficient in Generalized Preferential Attachment Models
DOI10.24166/im.04.2017zbMath1491.05170arXiv1507.07771OpenAlexW3031432909MaRDI QIDQ5896885
A. M. Krot, Liudmila Ostroumova Prokhorenkova
Publication date: 23 March 2022
Published in: Lecture Notes in Computer Science, Internet Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1507.07771
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Combinatorial probability (60C05) Internet topics (68M11)
Related Items (10)
Uses Software
Cites Work
- Unnamed Item
- Relaxing the uniformity and independence assumptions using the concept of fractal dimension
- Popularity based random graph models leading to a scale-free degree sequence
- Complex networks: structure and dynamics
- The degree sequence of a scale-free random graph process
- Generalized Preferential Attachment: Tunable Power-Law Degree Distribution and Clustering Coefficient
- Statistical mechanics of complex networks
- Emergence of Scaling in Random Networks
- The Structure and Function of Complex Networks
- Community structure in social and biological networks
- Collective dynamics of ‘small-world’ networks
This page was built for publication: Local Clustering Coefficient in Generalized Preferential Attachment Models