ترغب بنشر مسار تعليمي؟ اضغط هنا

How much random a random network is : a random matrix analysis

117   0   0.0 ( 0 )
 نشر من قبل Sarika Jalan
 تاريخ النشر 2008
  مجال البحث فيزياء
والبحث باللغة English




اسأل ChatGPT حول البحث

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. As 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.



قيم البحث

اقرأ أيضاً

123 - Tanu Raghav , Sarika Jalan 2021
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 multipl ex 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.
Stochastic resetting, a diffusive process whose amplitude is reset to the origin at random times, is a vividly studied strategy to optimize encounter dynamics, e.g., in chemical reactions. We here generalize the resetting step by introducing a random resetting amplitude, such that the diffusing particle may be only partially reset towards the trajectory origin, or even overshoot the origin in a resetting step. We introduce different scenarios for the random-amplitude stochastic resetting process and discuss the resulting dynamics. Direct applications are geophysical layering (stratigraphy) as well as population dynamics or financial markets, as well as generic search processes.
We analyze gene co-expression network under the random matrix theory framework. The nearest neighbor spacing distribution of the adjacency matrix of this network follows Gaussian orthogonal statistics of random matrix theory (RMT). Spectral rigidity test follows random matrix prediction for a certain range, and deviates after wards. Eigenvector analysis of the network using inverse participation ratio (IPR) suggests that the statistics of bulk of the eigenvalues of network is consistent with those of the real symmetric random matrix, whereas few eigenvalues are localized. Based on these IPR calculations, we can divide eigenvalues in three sets; (A) The non-degenerate part that follows RMT. (B) The non-degenerate part, at both ends and at intermediate eigenvalues, which deviate from RMT and expected to contain information about {it important nodes} in the network. (C) The degenerate part with $zero$ eigenvalue, which fluctuates around RMT predicted value. We identify nodes corresponding to the dominant modes of the corresponding eigenvectors and analyze their structural properties.
114 - J.M. Nava-Sedeno 2018
Many diffusion processes in nature and society were found to be anomalous, in the sense of being fundamentally different from conventional Brownian motion. An important example is the migration of biological cells, which exhibits non-trivial temporal decay of velocity autocorrelation functions. This means that the corresponding dynamics is characterized by memory effects that slowly decay in time. Motivated by this we construct non-Markovian lattice-gas cellular automata models for moving agents with memory. For this purpose the reorientation probabilities are derived from velocity autocorrelation functions that are given a priori; in that respect our approach is `data-driven. Particular examples we consider are velocity correlations that decay exponentially or as power laws, where the latter functions generate anomalous diffusion. The computational efficiency of cellular automata combined with our analytical results paves the way to explore the relevance of memory and anomalous diffusion for the dynamics of interacting cell populations, like confluent cell monolayers and cell clustering.
202 - Simona Cocco 2007
The problem of how many trajectories of a random walker in a potential are needed to reconstruct the values of this potential is studied. We show that this problem can be solved by calculating the probability of survival of an abstract random walker in a partially absorbing potential. The approach is illustrated on the discrete Sinai (random force) model with a drift. We determine the parameter (temperature, duration of each trajectory, ...) values making reconstruction as fast as possible.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا