Markov chain-based degree distributions of evolving networks

From MaRDI portal
Publication:1928124

DOI10.1007/S10114-012-0054-YzbMATH Open1255.05051arXiv0901.1418OpenAlexW2007827625MaRDI QIDQ1928124FDOQ1928124

Quan Rong Chen, Xiang Xing Kong, Zhenting Hou, Qing Gui Zhao, Dinghua Shi

Publication date: 2 January 2013

Published in: Acta Mathematica Sinica, English Series (Search for Journal in Brave)

Abstract: In this paper, we study a class of stochastic processes, called evolving network Markov chains, in evolving networks. Our approach is to transform the degree distribution problem of an evolving network to a corresponding problem of evolving network Markov chains. We investigate the evolving network Markov chains, thereby obtaining some exact formulas as well as a precise criterion for determining whether the steady degree distribution of the evolving network is a power-law or not. With this new method, we finally obtain a rigorous, exact and unified solution of the steady degree distribution of the evolving network.


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





Cites Work


Cited In (5)


   Recommendations





This page was built for publication: Markov chain-based degree distributions of evolving networks

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