Scale-free property for degrees and weights in an N-interactions random graph model

DOI10.1007/S10958-016-2758-5MaRDI QIDQ267626zbMATH OpenOpenAlexFDO

Authors István Fazekas, Bettina Porvázsnyik

Publication date 11 April 2016

Published in Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

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

zbMATH Keywords

random graph evolution mechanism

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Strong limit theorems (60F15) Martingales with discrete parameter (60G42)

Abstract: A general random graph evolution mechanism is defined. The evolution is a combination of the preferential attachment model and the interaction of N vertices (N>=3). A vertex in the graph is characterized by its degree and its weight. The weight of a given vertex is the number of the interactions of the vertex. The asymptotic behaviour of the graph is studied. Scale-free properties both for the degrees and the weights are proved. It turns out that any exponent in (2,infty) can be achieved. The proofs are based on discrete time martingale theory.

Recommendations

• Scale-free property for degrees and weights in a preferential attachment random graph model
• Limit theorems for the weights and the degrees in an N-interactions random graph model
• A random graph model based on 3-interactions
• Scale-free property of the weights in a random graph model
• Weights of cliques in a random graph model based on three-interactions

Cites work

• A general model of web graphs
• A preferential attachment model with random initial degrees
• A random graph model based on 3-interactions
• Critical behavior in inhomogeneous random graphs
• Emergence of Scaling in Random Networks
• scientific article; zbMATH DE number 3979513 (Why is no real title available?)
• scientific article; zbMATH DE number 3504209 (Why is no real title available?)
• scientific article; zbMATH DE number 3538599 (Why is no real title available?)
• Probability Inequalities for Sums of Bounded Random Variables
• 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
• The Maximum Degree of the Barabási–Albert Random Tree
• Weights and degrees in a random graph model based on 3-interactions

Cited in

(18)

• A population evolution model and its applications to random networks
• Degree distribution of a scale-free random graph model
• Scale-free property for degrees and weights in a preferential attachment random graph model
• Taylor's power law for the \(N\)-stars network evolution model
• A random graph model based on 3-interactions
• Limit theorems for the weights and the degrees in an N-interactions random graph model
• scientific article; zbMATH DE number 5763194 (Why is no real title available?)
• Scale-free graph with preferential attachment and evolving internal vertex structure
• Weights and degrees in a random graph model based on 3-interactions
• Scale-free property of the weights in a random graph model
• Weights of cliques in a random graph model based on three-interactions
• The \(N\)-star network evolution model
• Degree correlations in scale-free random graph models
• A generalization of the Barabási-Albert random tree
• A continuous-time network evolution model describing 3-interactions
• Relations between scaling exponents in unimodular random graphs
• A continuous-time N -interaction random graph model
• A random model of publication activity

This page was built for publication: Scale-free property for degrees and weights in an \(N\)-interactions random graph model

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