Network formed by traces of random walks
We propose a model of time evolving networks in which a kind of transport between vertices generates new edges in the graph. We call the model “Network formed by traces of random walks”, because the transports are represented abstractly by random walks. Our numerical calculations yield several important properties observed commonly in complex networks, although the graph at initial time is only a one-dimensional lattice. For example, the distribution of vertex degree exhibits various behaviors such as exponential, power law like, and bi-modal distribution according to change of probability of extinction of edges. Another property such as strong clustering structure and small mean vertex–vertex distance can also be found. The transports represented by random walks in a framework of strong links between regular lattice is a new mechanisms which yields biased acquisition of links for vertices.
Year of publication: |
2007
|
---|---|
Authors: | Ikeda, N. |
Published in: |
Physica A: Statistical Mechanics and its Applications. - Elsevier, ISSN 0378-4371. - Vol. 379.2007, 2, p. 701-713
|
Publisher: |
Elsevier |
Subject: | Network formulation | Random walks | Degree distribution | Cluster |
Saved in:
Online Resource
Saved in favorites
Similar items by subject
-
Connectivity and Concentration in Airline Networks: A Complexity Analysis of Lufthansa's Network
Reggiani, Aura, (2011)
-
On the distribution of links in financial networks: Structural heterogeneity and functional form
Lux, Thomas, (2017)
-
Risk Aversion and Social Networks
Kovářík, Jaromír, (2014)
- More ...