Limit theorems for the weights and the degrees in an N-interactions random graph model
From MaRDI portal
(Redirected from Publication:317897)
Limit theorems for the weights and the degrees in an \(N\)-interactions random graph model
Limit theorems for the weights and the degrees in an \(N\)-interactions random graph model
Abstract: A random graph evolution based on the interactions of N vertices is studied. During the evolution both the preferential attachment method and the uniform choice of vertices are allowed. The weight of a vertex means the number of its interactions. The asymptotic behaviour of the weight and the degree of a fixed vertex, moreover the limit of the maximal weight and the maximal degree are described. The proofs are based on martingale methods.
Recommendations
- Weights of cliques in a random graph model based on three-interactions
- 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
- A random graph model based on 3-interactions
- Scale-free property for degrees and weights in a preferential attachment random graph model
Cites work
- scientific article; zbMATH DE number 3538599 (Why is no real title available?)
- scientific article; zbMATH DE number 1540669 (Why is no real title available?)
- A general model of web graphs
- A new class of scale free random graphs
- 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
- Degree distribution nearby the origin of a preferential attachment graph
- Emergence of Scaling in Random Networks
- Generalized preferential attachment: tunable power-law degree distribution and clustering coefficient
- Limit distribution of degrees in random family trees
- On a 2-parameter class of scale free random graphs
- On the degree evolution of a fixed vertex in some growing networks
- Probability Inequalities for Sums of Bounded Random Variables
- Random graph dynamics
- Scale-free property for degrees and weights in a preferential attachment random graph model
- Scale-free property for degrees and weights in an \(N\)-interactions random graph model
- The Maximum Degree of the Barabási–Albert Random Tree
- The degree sequence of a scale-free random graph process
- Weights and degrees in a random graph model based on 3-interactions
- Weights of cliques in a random graph model based on three-interactions
Cited in
(11)- A population evolution model and its applications to random networks
- Scale-free property for degrees and weights in an \(N\)-interactions random graph model
- The \(N\)-star network evolution model
- Weights and degrees in a random graph model based on 3-interactions
- Tight fluctuations of weight-distances in random graphs with infinite-variance degrees
- Taylor's power law for the \(N\)-stars network evolution model
- scientific article; zbMATH DE number 1222262 (Why is no real title available?)
- Weights of cliques in a random graph model based on three-interactions
- A random graph model based on 3-interactions
- A continuous-time N -interaction random graph model
- A generalization of the Barabási-Albert random tree
This page was built for publication: Limit theorems for the weights and the degrees in an \(N\)-interactions random graph model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q317897)
