A Markov Chain-Based Numerical Method for Calculating Network Degree Distributions

arXivmath-ph/0409080MaRDI QIDQ6469252FDOQ6469252

Authors: Dinghua Shi, Qinghua Chen, Liming Liu 

Publication date: 29 September 2004

Abstract: This paper establishes a relation between scale-free networks and Markov chains, and proposes a computation framework for degree distributions of scale-free networks. We first find that, under the BA model, the degree evolution of individual nodes in a scale-free network follows some non-homogeneous Markov chains. Exploring the special structure of these Markov chains, we are able to develop an efficient algorithm to compute the degree distribution numerically. The complexity of our algorithm is O(t^2), where $t$ is the number of time steps for adding new nodes. We use three examples to demonstrate the computation procedure and compare the results with those from the existing methods.

Mathematics Subject Classification ID

Probability theory and stochastic processes (60-XX) Partial differential equations (35-XX)

This page was built for publication: A Markov Chain-Based Numerical Method for Calculating Network Degree Distributions

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