Degree-distribution stability of growing networks

Zhenting Hou; Xiangxing Kong; Dinghua Shi; Guanrong Chen; Qinggui Zhao

doi:10.1007/978-3-642-02469-6_59

Degree-distribution stability of growing networks

Zhenting Hou^*
, Xiangxing Kong
, Dinghua Shi
, Guanrong Chen
, Qinggui Zhao

^*Corresponding author for this work

City University of Hong Kong

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

7 Citations (Scopus)

Abstract

In this paper, we abstract a kind of stochastic processes from evolving processes of growing networks, this process is called growing network Markov chains. Thus the existence and the formulas of degree distribution are transformed to the corresponding problems of growing network Markov chains. First we investigate the growing network Markov chains, and obtain the condition in which the steady degree distribution exists and get its exact formulas. Then we apply it to various growing networks. With this method, we get a rigorous, exact and unified solution of the steady degree distribution for growing networks. © 2009 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering.

Original language	English
Title of host publication	Complex Sciences
Subtitle of host publication	First International Conference, Complex 2009, Revised Papers
Pages	1827-1837
Volume	5 LNICST
DOIs	https://doi.org/10.1007/978-3-642-02469-6_59
Publication status	Published - 2009
Event	1st International Conference on Complex Sciences: Theory and Applications, Complex 2009 - Shanghai, China Duration: 23 Feb 2009 → 25 Feb 2009

Publication series

Name	Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering
Volume	5 LNICST
ISSN (Print)	1867-8211

Conference

Conference	1st International Conference on Complex Sciences: Theory and Applications, Complex 2009
Place	China
City	Shanghai
Period	23/02/09 → 25/02/09

Research Keywords

BA model
Degree distribution
Growing network Markov chains
Scale-free

Access Output

10.1007/978-3-642-02469-6_59

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

Hou, Z., Kong, X., Shi, D., Chen, G., & Zhao, Q. (2009). Degree-distribution stability of growing networks. In Complex Sciences: First International Conference, Complex 2009, Revised Papers (Vol. 5 LNICST, pp. 1827-1837). (Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering; Vol. 5 LNICST). https://doi.org/10.1007/978-3-642-02469-6_59

@inproceedings{1f48007cf7b3493ca86cd7d932b35d5d,

title = "Degree-distribution stability of growing networks",

abstract = "In this paper, we abstract a kind of stochastic processes from evolving processes of growing networks, this process is called growing network Markov chains. Thus the existence and the formulas of degree distribution are transformed to the corresponding problems of growing network Markov chains. First we investigate the growing network Markov chains, and obtain the condition in which the steady degree distribution exists and get its exact formulas. Then we apply it to various growing networks. With this method, we get a rigorous, exact and unified solution of the steady degree distribution for growing networks. {\textcopyright} 2009 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering.",

keywords = "BA model, Degree distribution, Growing network Markov chains, Scale-free",

author = "Zhenting Hou and Xiangxing Kong and Dinghua Shi and Guanrong Chen and Qinggui Zhao",

year = "2009",

doi = "10.1007/978-3-642-02469-6\_59",

language = "English",

isbn = "3642024688",

volume = "5 LNICST",

series = "Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering",

pages = "1827--1837",

booktitle = "Complex Sciences",

note = "1st International Conference on Complex Sciences: Theory and Applications, Complex 2009 ; Conference date: 23-02-2009 Through 25-02-2009",

}

Hou, Z, Kong, X, Shi, D, Chen, G & Zhao, Q 2009, Degree-distribution stability of growing networks. in Complex Sciences: First International Conference, Complex 2009, Revised Papers. vol. 5 LNICST, Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, vol. 5 LNICST, pp. 1827-1837, 1st International Conference on Complex Sciences: Theory and Applications, Complex 2009, Shanghai, China, 23/02/09. https://doi.org/10.1007/978-3-642-02469-6_59

Degree-distribution stability of growing networks. / Hou, Zhenting; Kong, Xiangxing; Shi, Dinghua et al.
Complex Sciences: First International Conference, Complex 2009, Revised Papers. Vol. 5 LNICST 2009. p. 1827-1837 (Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering; Vol. 5 LNICST).

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

TY - GEN

T1 - Degree-distribution stability of growing networks

AU - Hou, Zhenting

AU - Kong, Xiangxing

AU - Shi, Dinghua

AU - Chen, Guanrong

AU - Zhao, Qinggui

PY - 2009

Y1 - 2009

N2 - In this paper, we abstract a kind of stochastic processes from evolving processes of growing networks, this process is called growing network Markov chains. Thus the existence and the formulas of degree distribution are transformed to the corresponding problems of growing network Markov chains. First we investigate the growing network Markov chains, and obtain the condition in which the steady degree distribution exists and get its exact formulas. Then we apply it to various growing networks. With this method, we get a rigorous, exact and unified solution of the steady degree distribution for growing networks. © 2009 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering.

AB - In this paper, we abstract a kind of stochastic processes from evolving processes of growing networks, this process is called growing network Markov chains. Thus the existence and the formulas of degree distribution are transformed to the corresponding problems of growing network Markov chains. First we investigate the growing network Markov chains, and obtain the condition in which the steady degree distribution exists and get its exact formulas. Then we apply it to various growing networks. With this method, we get a rigorous, exact and unified solution of the steady degree distribution for growing networks. © 2009 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering.

KW - BA model

KW - Degree distribution

KW - Growing network Markov chains

KW - Scale-free

UR - https://www.scopus.com/pages/publications/84863161114

UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-84863161114&origin=recordpage

U2 - 10.1007/978-3-642-02469-6_59

DO - 10.1007/978-3-642-02469-6_59

M3 - RGC 32 - Refereed conference paper (with host publication)

SN - 3642024688

SN - 9783642024689

VL - 5 LNICST

T3 - Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering

SP - 1827

EP - 1837

BT - Complex Sciences

T2 - 1st International Conference on Complex Sciences: Theory and Applications, Complex 2009

Y2 - 23 February 2009 through 25 February 2009

ER -

Degree-distribution stability of growing networks

Abstract

Publication series

Conference

Research Keywords

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this