Weights and degrees in a random graph model based on 3-interactions
From MaRDI portal
Publication:396992
DOI10.1007/S10474-014-0390-8zbMATH Open1324.05184arXiv1206.0633OpenAlexW2010720184MaRDI QIDQ396992FDOQ396992
Ágnes Backhausz, Tamás F. Móri
Publication date: 14 August 2014
Published in: Acta Mathematica Hungarica (Search for Journal in Brave)
Abstract: In a random graph model based on 3-interactions we give the joint asymptotic distribution of weights and degrees and prove scale-free property for the model. Moreover, we determine the asymptotics of the maximal weight and the maximal degree.
Full work available at URL: https://arxiv.org/abs/1206.0633
Recommendations
- A random graph model based on 3-interactions
- Limit theorems for the weights and the degrees in an \(N\)-interactions random graph model
- Weights of cliques in a random graph model based on three-interactions
- Scale-free property of the weights in a random graph model
- Scale-free property for degrees and weights in an \(N\)-interactions random graph model
Random graphs (graph-theoretic aspects) (05C80) Martingales with discrete parameter (60G42) Signed and weighted graphs (05C22)
Cites Work
- Emergence of Scaling in Random Networks
- Probability Inequalities for Sums of Bounded Random Variables
- Title not available (Why is that?)
- A random graph model based on 3-interactions
- Random graph dynamics
- Title not available (Why is that?)
- A general model of web graphs
- A preferential attachment model with random initial degrees
- Random Deletion in a Scale-Free Random Graph Process
- Random networks with sublinear preferential attachment: degree evolutions
- Random multitrees
- Vertices of high degree in the preferential attachment tree
- Random trees and general branching processes
- A Geometric Preferential Attachment Model of Networks
Cited In (7)
- A population evolution model and its applications to random networks
- Further properties of a random graph with duplications and deletions
- Scale-free property for degrees and weights in an \(N\)-interactions random graph model
- Taylor's power law for the \(N\)-stars network evolution model
- Limit theorems for the weights and the degrees in an \(N\)-interactions random graph model
- Weights of cliques in a random graph model based on three-interactions
- TheN-star network evolution model
This page was built for publication: Weights and degrees in 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 Q396992)
