相关论文: Rare events statistics of random walks on networks…
We study using large deviation theory the fluctuations of time-integrated functionals or observables of the unbiased random walk evolving on Erd\"os-R\'enyi random graphs, and construct a modified, biased random walk that explains how these…
Extreme events have low occurrence probabilities and display pronounced deviation from their average behaviour, such as earthquakes or power blackouts. Such extreme events occurring on the nodes of a complex network have been extensively…
We study rare events in networks with both internal and external noise, and develop a general formalism for analyzing rare events that combines pair-quenched techniques and large-deviation theory. The probability distribution, shape, and…
We study the extreme events taking place on complex networks. The transport on networks is modelled using random walks and we compute the probability for the occurance and recurrence of extreme events on the network. We show that the nodes…
A random walk is a basic stochastic process on graphs and a key primitive in the design of distributed algorithms. One of the most important features of random walks is that, under mild conditions, they converge to a stationary distribution…
Random walk on discrete lattice models is important to understand various types of transport processes. The extreme events, defined as exceedences of the flux of walkers above a prescribed threshold, have been studied recently in the…
Extreme events are emergent phenomena in multi-particle transport processes on complex networks. In practice, such events could range from power blackouts to call drops in cellular networks to traffic congestion on roads. All the earlier…
We study random walk on complex networks with transition probabilities which depend on the current and previously visited nodes. By using an absorbing Markov chain we derive an exact expression for the mean first passage time between pairs…
We consider random walks evolving on two models of connected and undirected graphs and study the exact large deviations of a local dynamical observable. We prove, in the thermodynamic limit, that this observable undergoes a first-order…
Anomalous random walks having long-range jumps are a critical branch of dynamical processes on networks, which can model a number of search and transport processes. However, traditional measurements based on mean first passage time are not…
Dynamic systems characterized by diversified evolutions are not only more flexible, but also more resilient to attacks, failures and changing conditions. This article addresses the quantification of the diversity of non-linear transient…
Much work in the study of large deviations for random graph models is focused on the dense regime where the theory of graphons has emerged as a principal tool. These tools do not give a good approach to large deviation problems for random…
A $\delta$ once-reinforced random walk ($\delta$-ORRW) on connected graph is a self-interacting random walk which moves to its neighbors at each step according to the weights of the edges at that time, where the weights are $1$ on edges…
Random walks are ubiquitous in the sciences, and they are interesting from both theoretical and practical perspectives. They are one of the most fundamental types of stochastic processes; can be used to model numerous phenomena, including…
We introduce weighted Markovian graphs, a random walk model that decouples the transition dynamics of a Markov chain from (random) edge weights representing the cost of traversing each edge. This decoupling allows us to study the…
This study in centered on models accounting for stochastic deformations of sample paths of random walks, embedded either in $\mathbb{Z}^2$ or in $\mathbb{Z}^3$. These models are immersed in multi-type particle systems with exclusion.…
Due to wide applications in diverse fields, random walks subject to stochastic resetting have attracted considerable attention in the last decade. In this paper, we study discrete-time random walks on complex network with multiple resetting…
Random walks are used for modeling various dynamics in, for example, physical, biological, and social contexts. Furthermore, their characteristics provide us with useful information on the phase transition and critical phenomena of even…
In the present work, we study random walks on complex networks subject to stochastic resetting when the resetting probability is node-dependent. Using a renewal approach, we derive the exact expressions of the stationary occupation…
We study random walks on Erd\"os-R\'enyi random graphs in which, every time the random walk returns to the starting point, first an edge probability is independently sampled according to a priori measure $\mu$, and then an Erd\"os-R\'enyi…