17 November 2004 in Physical Review E
Analytic solution for the average path length in a large class of uncorrelated random networks with hidden variables is found. We apply the approach to classical random graphs of Erdös and Rényi (ER), evolving networks introduced by Barabási and Albert as well as random networks with asymptotic scale-free connectivity distributions characterized by an arbitrary scaling exponent . Our result for shows that structural properties of asymptotic scale-free networks including numerous examples of real-world systems are even more intriguing than ultra-small world behavior noticed in pure scale-free structures and for large system sizes there is a saturation effect for the average path length.
13 July 2009 in Physical Review E
We study the biased random-walk process in random uncorrelated networks with arbitrary degree distributions. In our model, the bias is defined by the preferential transition probability, which, in recent years, has been commonly used to study the efficiency of different routing protocols in communication networks. We derive exact expressions for the stationary occupation probability and for the mean transit time between two nodes. The effect of the cyclic search on transit times is also explored. Results presented in this paper provide the basis for a theoretical treatment of transport-related problems in complex networks, including quantitative estimation of the critical value of the packet generation rate.
17 May 2012 in Physical Review E
Analyzing real data on international trade covering the time interval 1950–2000, we show that in each year over the analyzed period the network is a typical representative of the ensemble of maximally random weighted networks, whose directed connections (bilateral trade volumes) are only characterized by the product of the trading countries' GDPs. It means that time evolution of this network may be considered as a continuous sequence of equilibrium states, i.e., a quasistatic process. This, in turn, allows one to apply the linear response theory to make (and also verify) simple predictions about the network. In particular, we show that bilateral trade fulfills a fluctuation-response theorem, which states that the average relative change in imports (exports) between two countries is a sum of the relative changes in their GDPs. Yearly changes in trade volumes prove that the theorem is valid. DOI: http://dx.doi.org/10.1103/PhysRevE.85.056113 ©2012 American Physical Society
1 April 1999 in Physics Letters A
17 June 2010 in Physical Review E
Taylor's fluctuation scaling (FS) has been observed in many natural and man-made systems revealing an amazing universality of the law. Here, we give a reliable explanation for the origins and abundance of Taylor's FS in different complex systems. The universality of our approach is validated against real world data ranging from bird and insect populations through human chromosomes and traffic intensity in transportation networks to stock market dynamics. Using fundamental principles of statistical physics (both equilibrium and nonequilibrium) we prove that Taylor's law results from the well-defined number of states of a system characterized by the same value of a macroscopic parameter (i.e., the number of birds observed in a given area, traffic intensity measured as a number of cars passing trough a given observation point or daily activity in the stock market measured in millions of dollars).
23 October 2003 in Physical Review E
We applied a mean-field approach to study clustering coefficients in Barabási-Albert (BA) networks. We found that the local clustering in BA networks depends on the node degree. Analytic results have been compared to extensive numerical simulations finding a very good agreement for nodes with low degrees. Clustering coefficient of a whole network calculated from our approach perfectly fits numerical data.