Scale-free behavior of networks with the copresence of preferential and uniform attachment rules
From MaRDI portal
Publication:1640900
DOI10.1016/j.physd.2018.01.005zbMath1390.90140arXiv1704.08597OpenAlexW2611952155WikidataQ56170573 ScholiaQ56170573MaRDI QIDQ1640900
Angelica Pachon, Laura Sacerdote, Shuyi Yang
Publication date: 14 June 2018
Published in: Physica D (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1704.08597
Related Items
Directed hybrid random networks mixing preferential attachment with uniform attachment mechanisms ⋮ On the continuous-time limit of the Barabási-Albert random graph ⋮ Uniform preferential selection model for generating scale-free networks ⋮ On several properties of a class of hybrid recursive trees ⋮ Generating graphs by creating associative and random links between existing nodes ⋮ On discrete-time semi-Markov processes ⋮ Unnamed Item ⋮ Studies on generalized Yule models ⋮ Surprising behavior of the average degree for a node's neighbors in growth networks ⋮ On dynamic random graphs with degree homogenization via anti-preferential attachment probabilities
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Random graphs associated to some discrete and continuous time preferential attachment models
- Generalized nonlinear Yule models
- A preferential attachment model with random initial degrees
- On a preferential attachment and generalized Pólya's urn model
- A simple branching process approach to the phase transition in \(G_{n,p}\)
- The degree sequence of a scale-free random graph process
- Generalized Preferential Attachment: Tunable Power-Law Degree Distribution and Clustering Coefficient
- Emergence of Scaling in Random Networks
- The role of detachment of in-links in scale-free networks
- A general model of web graphs
- The Phase Transition in Multitype Binomial Random Graphs
- Random trees and general branching processes
- Degree Distribution of Competition-Induced Preferential Attachment Graphs
- Networks
