Weights of cliques in a random graph model based on three-interactions

DOI10.1007/s10986-015-9274-zzbMath1320.05111arXiv1412.6746OpenAlexW1483128429MaRDI QIDQ493620

István Fazekas, Csaba Noszály, Attila Perecsényi

Publication date: 3 September 2015

Published in: Lithuanian Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1412.6746

zbMATH Keywords

Doob-Meyer decompositionrandom graphpower lawpreferential attachmentsubmartingalescale free

Mathematics Subject Classification ID

Martingales with discrete parameter (60G42) Random graphs (graph-theoretic aspects) (05C80) Signed and weighted graphs (05C22)

Related Items (2)

Limit theorems for the weights and the degrees in an \(N\)-interactions random graph model ⋮ A population evolution model and its applications to random networks

Cites Work

• Weights and degrees in a random graph model based on 3-interactions
• A population evolution model and its applications to random networks
• Scale-free property for degrees and weights in a preferential attachment random graph model
• The degree sequence of a scale-free random graph process
• A random graph model based on 3-interactions
• Emergence of Scaling in Random Networks
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Weights of cliques in a random graph model based on three-interactions