Weights and degrees in a random graph model based on 3-interactions

DOI10.1007/S10474-014-0390-8MaRDI QIDQ396992zbMATH OpenOpenAlexFDO

Authors Ágnes Backhausz, Tamás F. Móri

Publication date 14 August 2014

Published in Acta Mathematica Hungarica (Search for Journal in Brave)

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

zbMATH Keywords

martingalerandom graphpreferential attachment3-interactionsscale free

Mathematics Subject Classification ID

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

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.

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

Cites work

• scientific article; zbMATH DE number 3504209 (Why is no real title available?)
• scientific article; zbMATH DE number 3538599 (Why is no real title available?)
• A Geometric Preferential Attachment Model of Networks
• A general model of web graphs
• A preferential attachment model with random initial degrees
• A random graph model based on 3-interactions
• Emergence of Scaling in Random Networks
• Probability Inequalities for Sums of Bounded Random Variables
• Random Deletion in a Scale-Free Random Graph Process
• Random graph dynamics
• Random multitrees
• Random networks with sublinear preferential attachment: degree evolutions
• Random trees and general branching processes
• Vertices of high degree in the preferential attachment tree

Cited in

(9)

• 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
• The \(N\)-star network evolution 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
• A random graph model based on 3-interactions
• Scale-free property of the weights in a random graph 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)