Model of complex networks based on citation dynamics
Not on the map. Why?
Abstract (arXiv)
Complex networks of real-world systems are believed to be controlled by common phenomena, producing structures far from regular or random. These include scale-free degree distributions, small-world structure and assortative mixing by degree, which are also the properties captured by different random graph models proposed in the literature. However, many (non-social) real-world networks are in fact disassortative by degree. Thus, we here propose a simple evolving model that generates networks with most common properties of real-world networks including degree disassortativity. Furthermore, the model has a natural interpretation for citation networks with different practical applications.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). First posted on arXiv 23 Mar 2013.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 1; 2023: 0; 2024: 1; 2025: 0; 2026: 1.
5 papers.
- 2021A Broader Picture of Random-walk Based Graph Embeddingcited by 15
- 2021A Robust and Generalized Framework for Adversarial Graph Embeddingcited by 8
- 2024DUPLEX: Dual GAT for Complex Embedding of Directed Graphscited by 7
- 2022Sparse Vicious Attacks on Graph Neural Networkscited by 5
- 2026Leveraging Non-linear Dimension Reduction and Random Walk Co-occurrence for Node Embeddingcited by 0
- 2026Leveraging Non-linear Dimension Reduction and Random Walk Co-occurrence for Node Embedding27 Feb 2026
- 2024DUPLEX: Dual GAT for Complex Embedding of Directed Graphs8 Jun 2024
- 2022Sparse Vicious Attacks on Graph Neural Networks20 Sep 2022
- 2021A Broader Picture of Random-walk Based Graph Embedding24 Oct 2021
- 2021A Robust and Generalized Framework for Adversarial Graph Embedding22 May 2021