A preferential attachment model with Poisson growth for scale-free networks

DOI10.1007/S10463-008-0181-5MaRDI QIDQ734404zbMATHOpenAlexFDO

Authors Paul Sheridan, Yuichi Yagahara, Hidetoshi Shimodaira

Publication date 13 October 2009

Published in Annals of the Institute of Statistical Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

power lawBayesian inferencecomplex networksnetwork modelsscale-free networks

Mathematics Subject Classification ID

Exact distribution theory in statistics (62E15) Applications of graph theory (05C90) Combinatorial probability (60C05)

Abstract: We propose a scale-free network model with a tunable power-law exponent. The Poisson growth model, as we call it, is an offshoot of the celebrated model of Barab'{a}si and Albert where a network is generated iteratively from a small seed network; at each step a node is added together with a number of incident edges preferentially attached to nodes already in the network. A key feature of our model is that the number of edges added at each step is a random variable with Poisson distribution, and, unlike the Barab'{a}si-Albert model where this quantity is fixed, it can generate any network. Our model is motivated by an application in Bayesian inference implemented as Markov chain Monte Carlo to estimate a network; for this purpose, we also give a formula for the probability of a network under our model.

Recommendations

• Poisson edge growth and preferential attachment networks
• A note on mean-field theory for scale-free random networks
• Double preferential scale-free network models
• Growth and preferential attachment in scale-free networks
• One scale-free network model based on two different preferential attachment probabilities

Cites work

• scientific article; zbMATH DE number 3150484 (Why is no real title available?)
• A MODEL OF LARGE-SCALE PROTEOME EVOLUTION
• Collective dynamics of `small-world' networks
• Complex networks: structure and dynamics
• Emergence of Scaling in Random Networks
• Exploring complex networks
• Rate equation appraoch for growing networks
• The degree sequence of a scale-free random graph process

Cited in

(13)

• Poisson edge growth and preferential attachment networks
• Uniform preferential selection model for generating scale-free networks
• A preferential attachment model with random initial degrees
• Distributed network generation based on preferential attachment in ABS
• A difference equation approach to statistical mechanics of complex networks
• Adaptive importance sampling for network growth models
• Estimating formation mechanisms and degree distributions in mixed attachment networks
• An extended scale-free network evolution model based on global coupling motif embedding
• Scale-free networks via attaching to random neighbors
• Growth and preferential attachment in scale-free networks
• A note on mean-field theory for scale-free random networks
• A Poisson growing competition network and the fitness model
• One scale-free network model based on two different preferential attachment probabilities

This page was built for publication: A preferential attachment model with Poisson growth for scale-free networks

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