The Influence of the Randomness on Average Path Length

Xin Chun Wang; Yu Bo Jiang

doi:10.4028/www.scientific.net/AMR.219-220.791

Paper Titles

Networked Management of Non-Book Materials
p.774

Quasi-Newton Method for DSPSL Bandpass Filter Design
p.778

The SIR Analysis Theory Based on ABCD Matrix and Application for the Filter Design
p.782

Discussion on the Lightning Protection for Video Surveillance System
p.786

The Influence of the Randomness on Average Path Length
p.791

Distribution Strategy in Storage and Retrieval System Based on Improved Genetic Algorithm
p.795

D–S Evidence Theory and its Application in Robot Information Fusion
p.799

The Research with Advanced Oxidation Technology to Degrade Organic Matter in Micro-Polluted Water
p.804

Fault Diagnosis of Marine Diesel Engines Based on SOM Neural Network
p.809

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 219-220The Influence of the Randomness on Average Path...

The Influence of the Randomness on Average Path Length

Abstract:

The evolving rule includes random attachment and preferential attachment and so on. It forms different network formation by different attachment. In order to analyze this character, this paper put forward an evolving model. It contains two kinds of attachment: some are connected at random, and others are connected based on current structure of the network, and in the model the deleted links are considered. The degree distribution and degree exponent are obtained by mean-field approach. Then it discusses the influence of randomness on the average path length.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Advanced Materials Research (Volumes 219-220)

Pages:

791-794

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.219-220.791

Citation:

Cite this paper

Online since:

March 2011

Authors:

Xin Chun Wang, Yu Bo Jiang

Keywords:

Average Path Length, Complex Network, Degree Distribution

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Erdǒs P. and Rényi A. On the evolution of random graphs[J]. Publications of the mathematical institute of the Hungarian academy of sciences, 1960, 5: 17-61.

Google Scholar

[2] Watts D. J. and Strogatz S. H. Collective dynamics of small-world networks[J]. Nature, 1998, 393: 440-442.

DOI: 10.1038/30918

Google Scholar

[3] Barabási A. L., Albert R. and Jeong H. Mean-field theory for scale-free random networks[J]. Physica A 1999, 272: 173-187.

DOI: 10.1016/s0378-4371(99)00291-5

Google Scholar

[8] Wang X. F., Li X., Chen G. R. The Theory and Application of Complex Networks[M]. Beijing: Tsinghua University Press. 2006: 27-33.

Google Scholar

[11] Jackson M. O., Social and economic networks[M]. NewYork: Princeton university press, 2008: 124~150.

Google Scholar

[16] Dorogovtsev S. N. and Mendes J. F. F. Evolution of networks[M]. Oxford: Oxford University Press, 2003: 44-46.

Google Scholar

[17] Puniyani A. R. and Lukos R. M. Growing random networks under contraints[J]. Condensed Matter, 2001: 0107391.

Google Scholar