The N-star network evolution model

DOI10.1017/JPR.2019.21MaRDI QIDQ5226249zbMATH OpenOpenAlexFDO

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

Publication date 31 July 2019

Published in Journal of Applied Probability (Search for Journal in Brave)

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

zbMATH Keywords

Doob-Meyer decompositionpower lawpreferential attachmentrandom graphscale freesubmartingale

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Martingales with discrete parameter (60G42)

Abstract: A new network evolution model is introduced in this paper. The model is based on co-operations of $N$ units. The units are the nodes of the network and the co-operations are indicated by directed links. At each evolution step $N$ units co-operate which formally means that they form a directed $N$-star subgraph. At each step either a new unit joins to the network and it co-operates with $N-1$ old units or $N$ old units co-operate. During the evolution both preferential attachment and uniform choice are applied. Asymptotic power law distributions are obtained both for the in-degrees and the out-degrees.

Recommendations

• EVOLVING SCALE-FREE NETWORK MODEL
• An evolving random network and its asymptotic structure
• Asymptotic degree distribution in a homogeneous evolving network model
• An evolving network model with community structure
• A study of an evolving network model with community structure

Cites work

• A general model of web graphs
• A population evolution model and its applications to random networks
• A random graph model based on 3-interactions
• Complex graphs and networks
• Emergence of Scaling in Random Networks
• Generalized preferential attachment: tunable power-law degree distribution and clustering coefficient
• scientific article; zbMATH DE number 3150484 (Why is no real title available?)
• scientific article; zbMATH DE number 3168330 (Why is no real title available?)
• scientific article; zbMATH DE number 3979513 (Why is no real title available?)
• scientific article; zbMATH DE number 3538599 (Why is no real title available?)
• Limit theorems for the weights and the degrees in an N-interactions random graph model
• Network science. With Márton Pósfai
• ON A CLASS OF SKEW DISTRIBUTION FUNCTIONS
• Popularity based random graph models leading to a scale-free degree sequence
• Random graph dynamics
• Random Graphs
• Random graphs and complex networks. Volume 1
• Robustness and Vulnerability of Scale-Free Random Graphs
• Scale-free property for degrees and weights in an \(N\)-interactions 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

(11)

• \textsc{MassExodus}: modeling evolving networks in harsh environments
• Taylor's power law for the \(N\)-stars network evolution model
• A stochastic evolutionary growth model for social networks
• An extended scale-free network evolution model based on star-like coupling motif embedding
• Co-evolution of networks and quantum dynamics: a generalization of preferential attachment
• AGGREGATE DYNAMICS IN AN EVOLUTIONARY NETWORK MODEL
• Simulation results on a triangle-based network evolution model
• An enumeration approach to network evolution
• A continuous-time network evolution model describing 3-interactions
• A continuous-time N -interaction random graph model
• A family of network evolution models with moderate density

This page was built for publication: The \(N\)-star network evolution model

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