TheN-star network evolution model

DOI10.1017/jpr.2019.21zbMath1416.05258arXiv1905.12449OpenAlexW2966873417MaRDI QIDQ5226249

István Fazekas, Csaba Noszály, Attila Perecsényi

Publication date: 31 July 2019

Published in: Journal of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1905.12449

zbMATH Keywords

Doob-Meyer decompositionrandom graphpower lawpreferential attachmentsubmartingalescale free

Mathematics Subject Classification ID

Martingales with discrete parameter (60G42) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80)

Related Items (2)

A continuous-time network evolution model describing 3-interactions ⋮ Taylor's power law for the \(N\)-stars network evolution model

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Scale-free property for degrees and weights in an \(N\)-interactions random graph model
• Limit theorems for the weights and the degrees in an \(N\)-interactions random graph model
• Weights and degrees in a random graph model based on 3-interactions
• A population evolution model and its applications to random networks
• Popularity based random graph models leading to a scale-free degree sequence
• The degree sequence of a scale-free random graph process
• Random Graphs and Complex Networks
• A random graph model based on 3-interactions
• Generalized Preferential Attachment: Tunable Power-Law Degree Distribution and Clustering Coefficient
• Emergence of Scaling in Random Networks
• ON A CLASS OF SKEW DISTRIBUTION FUNCTIONS
• Robustness and Vulnerability of Scale-Free Random Graphs
• The Maximum Degree of the Barabási–Albert Random Tree
• A general model of web graphs
• Random Graphs

This page was built for publication: TheN-star network evolution model