Chaos An Interdisciplinary Journal of Nonlinear Science · 2013 · 39 citations · 37 references
EngineeringComputer ScienceComputer NetworksProbability TheoryStochastic ProcessesNetwork TheoryRandom WalksShortest Path AlgorithmsStochastic NetworksLarge-scale Network DynamicsRandom Walks On GraphsRandom Walks On NetworksWeighted Networks
In this paper, we introduce new models of non-homogenous weighted Koch networks on real traffic systems depending on the three scaling factors r1,r2,r3∈(0,1). Inspired by the definition of the average weighted shortest path (AWSP), we define the average weighted receiving time (AWRT). Assuming that the walker, at each step, starting from its current node, moves uniformly to any of its neighbors, we show that in large network, the AWRT grows as power-law function of the network order with the exponent, represented by θ(r1,r2,r3)=log4(1+r1+r2+r3). Moreover, the AWSP, in the infinite network order limit, only depends on the sum of scaling factors r1,r2,r3.
37
Collective dynamics of ‘small-world’ networks
Duncan J. Watts, Steven H. Strogatz · Nature · 1998 · 43.2K citations
Emergence of Scaling in Random Networks
Albert-Ĺaszló Barabási, Réka Albert · Science · 1999 · 36.4K citations · Full text
Statistical mechanics of complex networks
Réka Albert, Albert-Ĺaszló Barabási · Reviews of Modern Physics · 2002 · 20.6K citations · Full text
Complex networks: Structure and dynamics
Stefano Boccaletti, Vito Latora, Yamir Moreno et al. · Physics Reports · 2006 · 11K citations
S. N. Dorogovt︠s︡ev, J. F. F. Mendes · Advances In Physics · 2002 · 3.2K citations · Full text