Scale-free property for degrees and weights in an \(N\)-interactions random graph model
From MaRDI portal
Publication:267626
DOI10.1007/s10958-016-2758-5zbMath1360.05153arXiv1309.4258OpenAlexW1674185680MaRDI QIDQ267626
Bettina Porvázsnyik, István Fazekas
Publication date: 11 April 2016
Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1309.4258
Martingales with discrete parameter (60G42) Random graphs (graph-theoretic aspects) (05C80) Strong limit theorems (60F15)
Related Items (5)
Limit theorems for the weights and the degrees in an \(N\)-interactions random graph model ⋮ A continuous-time network evolution model describing 3-interactions ⋮ A population evolution model and its applications to random networks ⋮ TheN-star network evolution model ⋮ Taylor's power law for the \(N\)-stars network evolution model
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Weights and degrees in a random graph model based on 3-interactions
- A preferential attachment model with random initial degrees
- Scale-free property for degrees and weights in a preferential attachment random graph model
- The degree sequence of a scale-free random graph process
- Critical behavior in inhomogeneous random graphs
- A random graph model based on 3-interactions
- Emergence of Scaling in Random Networks
- The Maximum Degree of the Barabási–Albert Random Tree
- A general model of web graphs
- Probability Inequalities for Sums of Bounded Random Variables
This page was built for publication: Scale-free property for degrees and weights in an \(N\)-interactions random graph model