Related papers: Frog model wakeup time on the complete graph
Random walks constitute a fundamental mechanism for a large set of dynamics taking place on networks. In this article, we study random walks on weighted networks with an arbitrary degree distribution, where the weight of an edge between two…
We provide sufficient conditions for the validity of a dichotomy, i.e. zero-one law, between recurrence and transience of general frog models. In particular, the results cover frog models with i.i.d. numbers of frogs per site where the frog…
We consider continuous-time random walk models described by arbitrary sojourn time probability density functions. We find a general expression for the distribution of time-averaged observables for such systems, generalizing some recent…
We study the frog model on $\mathbb{Z}$ with particle-wise random geometric lifetimes: each particle has a survival parameter $\pi\in(0,1)$ sampled i.i.d., whose density near $1$ satisfies $f_\pi(u)\sim (1-u)^{\beta-1}L\big((1-u)^{-1}\big)$…
Extensive empirical investigation has shown that a plethora of real networks synchronously exhibit scale-free and modular structure, and it is thus of great importance to uncover the effects of these two striking properties on various…
Freezing of Gait (FOG) is one of the most debilitating symptoms of Parkinson's Disease and is associated with falls and loss of independence. The patho-physiological mechanisms underpinning FOG are currently poorly understood. In this paper…
We pose a new and intriguing question motivated by distributed computing regarding random walks on graphs: How long does it take for several independent random walks, starting from the same vertex, to cover an entire graph? We study the…
We explore a simplified class of models we call swarms, which are inspired by the collective behavior of social insects. We perform a mean-field stability analysis and perform numerical simulations of the model. Several interesting types of…
We investigate the distribution of occupation times for a particle undergoing a random walk among random energy traps and in the presence of a deterministic potential field $U^{{\rm det}}(x)$. When the distribution of energy traps is…
Feynman's model of a quantum computer provides an example of a continuous-time quantum walk. Its clocking mechanism is an excitation of a basically linear chain of spins with occasional controlled jumps which allow for motion on a planar…
A physical model called dressed photons, a composite system of photons and excitation of electrons in the nano-particles, is effectively used in the realm of near-field optics. Many interesting behaviors of dressed photons are known,…
"Small worlds" are large systems in which any given node has only a few connections to other points, but possessing the property that all pairs of points are connected by a short path, typically logarithmic in the number of nodes. The use…
Interaction mechanism in the acoustic communication of actual animals is investigated by combining mathematical modeling and empirical data. Here we use a deterministic mathematical model (a phase oscillator model) to describe the…
We consider single-hop radio networks with multiple channels as a model of wireless networks. There are $n$ stations connected to $b$ radio channels that do not provide collision detection. A station uses all the channels concurrently and…
For random walks on networks (graphs), it is a theoretical challenge to explicitly determine the mean first-passage time (MFPT) between two nodes averaged over all pairs. In this paper, we study the MFPT of random walks in the famous…
Autonomous aerial and aquatic robots that attain mobility by perturbing their medium, such as multicopters and torpedoes, produce wake effects that act as disturbances for adjacent robots. Wake effects are hard to model and predict due to…
The random walk process underlies the description of a large number of real world phenomena. Here we provide the study of random walk processes in time varying networks in the regime of time-scale mixing; i.e. when the network connectivity…
Bootstrap percolation on the random graph $G_{n,p}$ is a process of spread of "activation" on a given realization of the graph with a given number of initially active nodes. At each step those vertices which have not been active but have at…
Random walks are basic diffusion processes on networks and have applications in, for example, searching, navigation, ranking, and community detection. Recent recognition of the importance of temporal aspects on networks spurred studies of…
Flying animals, such as bats, fly through their fluidic environment as they create air jets and form wake structures downstream of their flight path. Bats, in particular, dynamically morph their highly flexible and dexterous armwing to…