Asymmetry between odd and even node weight in complex networks

Liang Gao, Jinshan Zhao, Zengru Di and Dahui Wang

Physica A: Statistical Mechanics and its Applications, 2007, vol. 376, issue C, 687-691

Abstract: Phenomenon of asymmetry between odd and even node weight distribution in some complex networks, such as public transportation networks and Internet, is presented. Reasons related to this phenomenon are summarized, i.e., (1) edges are solid connections between nodes which are embedded in real geometric background, and (2) preferential mechanism during the process of network formation. Incorporating these two points, complex networks are constructed by self-avoiding random walk on 2D grid and the simulation results are consistent well with that of empirical researches.

Keywords: Asymmetry; Node weight; Complex networks; Self-avoiding random walk (search for similar items in EconPapers)
Date: 2007
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378437106010442
Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:phsmap:v:376:y:2007:i:c:p:687-691

DOI: 10.1016/j.physa.2006.10.032

Access Statistics for this article

Physica A: Statistical Mechanics and its Applications is currently edited by K. A. Dawson, J. O. Indekeu, H.E. Stanley and C. Tsallis

More articles in Physica A: Statistical Mechanics and its Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().