Generating graphs by creating associative and random links between existing nodes
From MaRDI portal
Publication:1987627
DOI10.1007/s10955-020-02517-zzbMath1436.82010OpenAlexW3009283220MaRDI QIDQ1987627
Muhammad Irfan Yousuf, Suhyun Kim
Publication date: 15 April 2020
Published in: Journal of Statistical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10955-020-02517-z
Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20)
Uses Software
Cites Work
- Unnamed Item
- Random graphs associated to some discrete and continuous time preferential attachment models
- Generalized nonlinear Yule models
- On symmetry of uniform and preferential attachment graphs
- Scale-free behavior of networks with the copresence of preferential and uniform attachment rules
- Connected components in random graphs with given expected degree sequences
- On a preferential attachment and generalized Pólya's urn model
- From the Cover: The structure of scientific collaboration networks
- Generalized Preferential Attachment: Tunable Power-Law Degree Distribution and Clustering Coefficient
- Statistical mechanics of complex networks
- Empirical Analysis of an Evolving Social Network
- The role of detachment of in-links in scale-free networks
- A Dynamic Model for On-Line Social Networks
- Fast unfolding of communities in large networks
This page was built for publication: Generating graphs by creating associative and random links between existing nodes
