Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userLevy random walks on multiplex networks
88
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Random walks constitute a fundamental mechanism for many dynamics taking place on complex networks. Besides, as a more realistic description of our society, multiplex networks have been receiving a growing interest, as well as the dynamical processes that occur on top of them. Here, inspired by one specific model of random walks that seems to be ubiquitous across many scientific fields, the Levy flight, we study a new navigation strategy on top of multiplex networks. Capitalizing on spectral graph and stochastic matrix theories, we derive analytical expressions for the mean first passage time and the average time to reach a node on these networks. Moreover, we also explore the efficiency of Levy random walks, which we found to be very different as compared to the single layer scenario, accounting for the structure and dynamics inherent to the multiplex network. Finally, by comparing with some other important random walk processes defined on multiplex networks, we find that in some region of the parameters, a Levy random walk is the most efficient strategy. Our results give us a deeper understanding of Levy random walks and show the importance of considering the topological structure of multiplex networks when trying to find efficient navigation strategies.
rate research
Read More
Virtually all real-world networks are dynamical entities. In social networks, the propensity of nodes to engage in social interactions (activity) and their chances to be selected by active nodes (attractiveness) are heterogeneously distributed. Here, we present a time-varying network model where each node and the dynamical formation of ties are characterised by these two features. We study how these properties affect random walk processes unfolding on the network when the time scales describing the process and the network evolution are comparable. We derive analytical solutions for the stationary state and the mean first passage time of the process and we study cases informed by empirical observations of social networks. Our work shows that previously disregarded properties of real social systems such heterogeneous distributions of activity and attractiveness as well as the correlations between them, substantially affect the dynamical process unfolding on the network.
Using data on the Berlin public transport network, the present study extends previous observations of fractality within public transport routes by showing that also the distribution of inter-station distances along routes displays non-trivial power law behaviour. This indicates that the routes may in part also be described as Levy-flights. The latter property may result from the fact that the routes are planned to adapt to fluctuating demand densities throughout the served area. We also relate this to optimization properties of Levy flights.
Various real-life networks exhibit degree correlations and heterogeneous structure, with the latter being characterized by power-law degree distribution $P(k)sim k^{-gamma}$, where the degree exponent $gamma$ describes the extent of heterogeneity. In this paper, we study analytically the average path length (APL) of and random walks (RWs) on a family of deterministic networks, recursive scale-free trees (RSFTs), with negative degree correlations and various $gamma in (2,1+frac{ln 3}{ln 2}]$, with an aim to explore the impacts of structure heterogeneity on APL and RWs. We show that the degree exponent $gamma$ has no effect on APL $d$ of RSFTs: In the full range of $gamma$, $d$ behaves as a logarithmic scaling with the number of network nodes $N$ (i.e. $d sim ln N$), which is in sharp contrast to the well-known double logarithmic scaling ($d sim ln ln N$) previously obtained for uncorrelated scale-free networks with $2 leq gamma <3$. In addition, we present that some scaling efficiency exponents of random walks are reliant on degree exponent $gamma$.
We develop a theoretical framework for the study of epidemic-like social contagion in large scale social systems. We consider the most general setting in which different communication platforms or categories form multiplex networks. Specifically, we propose a contact-based information spreading model, and show that the critical point of the multiplex system associated to the active phase is determined by the layer whose contact probability matrix has the largest eigenvalue. The framework is applied to a number of different situations, including a real multiplex system. Finally, we also show that when the system through which information is disseminating is inherently multiplex, working with the graph that results from the aggregation of the different layers is flawed.
We explore the block nature of the matrix representation of multiplex networks, introducing a new formalism to deal with its spectral properties as a function of the inter-layer coupling parameter. This approach allows us to derive interesting results based on an interpretation of the traditional eigenvalue problem. More specifically, we reduce the dimensionality of our matrices but increase the power of the characteristic polynomial, i.e, a polynomial eigenvalue problem. Such an approach may sound counterintuitive at first glance, but it allows us to relate the quadratic problem for a 2-Layer multiplex system with the spectra of the aggregated network and to derive bounds for the spectra, among many other interesting analytical insights. Furthermore, it also permits to directly obtain analytical and numerical insights on the eigenvalue behavior as a function of the coupling between layers. Our study includes the supra-adjacency, supra-Laplacian, and the probability transition matrices, which enable us to put our results under the perspective of structural phases in multiplex networks. We believe that this formalism and the results reported will make it possible to derive new results for multiplex networks in the future.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
