A random graph model based on 3-interactions
From MaRDI portal
Publication:2898764
Abstract: We consider a random graph model evolving in discrete time-steps that is based on 3-interactions among vertices. Triangles, edges and vertices have different weights; objects with larger weight are more likely to participate in future interactions. We prove the scale free property of the model by exploring the asymptotic behaviour of the weight distribution. We also find the asympotics of the weight of a fixed vertex.
Recommendations
- Weights and degrees in a random graph model based on 3-interactions
- 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
- Limit theorems for the weights and the degrees in an N-interactions random graph model
- Scale-free property of the weights in a random graph model
Cited in
(11)- The \(N\)-star network evolution model
- A population evolution model and its applications to random networks
- Weights of cliques in a random graph model based on three-interactions
- A random model of publication activity
- A continuous-time N -interaction random graph model
- Scale-free property of the weights in a random graph model
- A continuous-time network evolution model describing 3-interactions
- Limit theorems for the weights and the degrees in an \(N\)-interactions random graph model
- A random graph model driven by time-dependent branching dynamics
- 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
This page was built for publication: A random graph model based on 3-interactions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2898764)
