اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدRandom Matrix Analysis of Multiplex Networks
124
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We investigate the spectra of adjacency matrices of multiplex networks under random matrix theory (RMT) framework. Through extensive numerical experiments, we demonstrate that upon multiplexing two random networks, the spectra of the combined multiplex network exhibit superposition of two Gaussian orthogonal ensemble (GOE)s for very small multiplexing strength followed by a smooth transition to the GOE statistics with an increase in the multiplexing strength. Interestingly, randomness in the connection architecture, introduced by random rewiring to 1D lattice, of at least one layer may govern nearest neighbor spacing distribution (NNSD) of the entire multiplex network, and in fact, can drive to a transition from the Poisson to the GOE statistics or vice versa. Notably, this transition transpires for a very small number of the random rewiring corresponding to the small-world transition. Ergo, only one layer being represented by the small-world network is enough to yield GOE statistics for the entire multiplex network. Spectra of adjacency matrices of underlying interaction networks have been contemplated to be related with dynamical behaviour of the corresponding complex systems, the investigations presented here have implications in achieving better structural and dynamical control to the systems represented by multiplex networks against structural perturbation in only one of the layers.
قيم البحث
اقرأ أيضاً
We analyze complex networks under random matrix theory framework. Particularly, we show that $Delta_3$ statistic, which gives information about the long range correlations among eigenvalues, provides a qualitative measure of randomness in networks. A
s networks deviate from the regular structure, $Delta_3$ follows random matrix prediction of linear behavior, in semi-logarithmic scale with the slope of $1/pi^2$, for the longer scale.
We study spectral behavior of sparsely connected random networks under the random matrix framework. Sub-networks without any connection among them form a network having perfect community structure. As connections among the sub-networks are introduced
, the spacing distribution shows a transition from the Poisson statistics to the Gaussian orthogonal ensemble statistics of random matrix theory. The eigenvalue density distribution shows a transition to the Wigners semicircular behavior for a completely deformed network. The range for which spectral rigidity, measured by the Dyson-Mehta $Delta_3$ statistics, follows the Gaussian orthogonal ensemble statistics depends upon the deformation of the network from the perfect community structure. The spacing distribution is particularly useful to track very slight deformations of the network from a perfect community structure, whereas the density distribution and the $Delta_3$ statistics remain identical to the undeformed network. On the other hand the $Delta_3$ statistics is useful for the larger deformation strengths. Finally, we analyze the spectrum of a protein-protein interaction network for Helicobacter, and compare the spectral behavior with those of the model networks.
A continuous Markovian model for truncated Levy random walks is proposed. It generalizes the approach developed previously by Lubashevsky et al. Phys. Rev. E 79, 011110 (2009); 80, 031148 (2009), Eur. Phys. J. B 78, 207 (2010) allowing for nonlinear
friction in wondering particle motion and saturation of the noise intensity depending on the particle velocity. Both the effects have own reason to be considered and individually give rise to truncated Levy random walks as shown in the paper. The nonlinear Langevin equation governing the particle motion was solved numerically using an order 1.5 strong stochastic Runge-Kutta method and the obtained numerical data were employed to calculate the geometric mean of the particle displacement during a certain time interval and to construct its distribution function. It is demonstrated that the time dependence of the geometric mean comprises three fragments following one another as the time scale increases that can be categorized as the ballistic regime, the Levy type regime (superballistic, quasiballistic, or superdiffusive one), and the standard motion of Brownian particles. For the intermediate Levy type part the distribution of the particle displacement is found to be of the generalized Cauchy form with cutoff. Besides, the properties of the random walks at hand are shown to be determined mainly by a certain ratio of the friction coefficient and the noise intensity rather then their characteristics individually.
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.
Governments and enterprises strongly rely on incentives to generate favorable outcomes from social and strategic interactions between individuals. The incentives are usually modeled by payoffs in evolutionary games, such as the prisoners dilemma or t
he harmony game, with imitation dynamics. Adjusting the incentives by changing the payoff parameters can favor cooperation, as found in the harmony game, over defection, which prevails in the prisoners dilemma. Here, we show that this is not always the case if individuals engage in strategic interactions in multiple domains. In particular, we investigate evolutionary games on multiplex networks where individuals obtain an aggregate payoff. We explicitly control the strength of degree correlations between nodes in the different layers of the multiplex. We find that if the multiplex is composed of many layers and degree correlations are strong, the topology of the system enslaves the dynamics and the final outcome, cooperation or defection, becomes independent of the payoff parameters. The fate of the system is then determined by the initial conditions.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
