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

DOI10.1007/S10986-015-9274-ZMaRDI QIDQ493620zbMATH OpenOpenAlexFDO

Authors 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

power lawrandom graphDoob-Meyer decompositionpreferential attachmentsubmartingalescale free

Mathematics Subject Classification ID

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

Abstract: A random graph evolution rule is considered. The graph evolution is based on interactions of three vertices. The weight of a clique is the number of its interactions. The asymptotic behaviour of the weights is described. It is known that the weight distribution of the vertices is asymptotically a power law. Here it is proved that the weight distributions both of the edges and the triangles are also asymptotically power laws. The proofs are based on discrete time martingale methods. Some numerical results are also presented.

Recommendations

• Limit theorems for the weights and the degrees in an N-interactions random graph model
• A random graph model based on 3-interactions
• Weights and degrees in a random graph model based on 3-interactions
• Scale-free property for degrees and weights in an \(N\)-interactions random graph model
• A population evolution model and its applications to random networks

Cites work

• scientific article; zbMATH DE number 3979513 (Why is no real title available?)
• scientific article; zbMATH DE number 3538599 (Why is no real title available?)
• A population evolution model and its applications to random networks
• A random graph model based on 3-interactions
• Emergence of Scaling in Random Networks
• Random graph dynamics
• Scale-free property for degrees and weights in a preferential attachment random graph model
• The degree sequence of a scale-free random graph process
• Weights and degrees in a random graph model based on 3-interactions

Cited in

(9)

• 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 distribution of minimum-weight cliques and other subgraphs in graphs with random edge weights
• Weights and degrees in a random graph model based on 3-interactions
• Limit theorems for the weights and the degrees in an N-interactions random graph model
• A random graph model based on 3-interactions
• A continuous-time N -interaction random graph model
• Asymptotics for cliques in scale-free random graphs
• Scale-free property of the weights in a random graph model

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q493620)