Limit theorems for the weights and the degrees in an \(N\)-interactions random graph model
From MaRDI portal
Publication:317897
DOI10.1515/math-2016-0039zbMath1346.05269arXiv1405.1267OpenAlexW2469310956MaRDI QIDQ317897
István Fazekas, Bettina Porvázsnyik
Publication date: 4 October 2016
Published in: Open Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1405.1267
Related Items
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
- Scale-free property for degrees and weights in an \(N\)-interactions random graph model
- Weights and degrees in a random graph model based on 3-interactions
- An estimate for the number of edges between vertices of gives degrees in random graphs in the Bollobás-Riordan model
- Weights of cliques in a random graph model based on three-interactions
- On the degree evolution of a fixed vertex in some growing networks
- Limit distribution of degrees in random family trees
- On a 2-parameter class of scale free random graphs
- Scale-free property for degrees and weights in a preferential attachment random graph model
- Degree distribution nearby the origin of a preferential attachment graph
- A new class of scale free random graphs
- The degree sequence of a scale-free random graph process
- 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
- 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: Limit theorems for the weights and the degrees in an \(N\)-interactions random graph model
