A Markov Chain-Based Numerical Method for Calculating Network Degree Distributions
Dinghua Shi, Qinghua Chen, Liming Liu
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(t2), 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.
Create a lesson
Related papers
On the Geometric Structure of Hyperbolic Clifford Bundles and Associated Spin Groups
Eduardo Notte-Cuello
Koopman-von Neumann formalism meets contact Hamiltonian systems
Federico Zadra
Lossless propagation bounds for long-range fermionic interactions
Stefan Teufel
Supersymmetric Neuromorphic FitzHugh--Nagumo model
D. Maroulakos, A. Wal, S. K. Mishra et al.
Separatrix splitting in a multiferroic neuromorphic oscillator: toward Arnold diffusion
D. Maroulakos, Z. Toklikishvili, A. Wal et al.
Anderson localisation in infinite and finite resonator crystals with long-range interactions
Habib Ammari, Xin Fu, Wenjia Jing et al.