Related papers: Synchronization of random walks with reflecting bo…
A proof is provided of a strong law of large numbers for a one-dimensional random walk in a dynamic random environment given by a supercritical contact process in equilibrium. The proof is based on a coupling argument that traces the…
We consider random walks in which the walk originates in one set of nodes and then continues until it reaches one or more nodes in a target set. The time required for the walk to reach the target set is of interest in understanding the…
We studied simple random-walk models with asymmetric time delays. Stochastic simulations were performed for hyperbolic-tangent fitness functions and to obtain analytical results we approximated them by step functions. A novel behavior has…
Numerical experiments recently discussed in the literature show that identical nonlinear chaotic systems linked by a common noise term (or signal) may synchronize after a finite time. We study the process of synchronization as function of…
In this note, we compute the probability that a two-dimensional symmetric random walk visits more vertices than expected, for deviations on scales between the mean behavior and linear growth.
We consider Random Walk in Random Scenery, denoted $X_n$, where the random walk is symmetric on $Z^d$, with $d>4$, and the random field is made up of i.i.d random variables with a stretched exponential tail decay, with exponent $\alpha$…
We investigate collective synchronization in a system of coupled oscillators on small-world networks. The order parameters which measure synchronization of phases and frequencies are introduced and analyzed by means of dynamic simulations…
We study the synchronous dynamics of the Hopfield model when a random antisymmetric part is added to the otherwise symmetric synaptic matrix. We use a generating functional technique to derive analytical expressions for the order parameters…
We consider a one dimensional random walk in random environment that is uniformly biased to one direction. In addition to the transition probability, the jump rate of the random walk is assumed to be spatially inhomogeneous and random. We…
An analytical method based on the classical ruin problem is developed to compute the mean reaction time between two walkers undergoing a generalized random walk on a 1d lattice. At each time step, either both walkers diffuse simultaneously…
We derive a perturbation expansion for general self-interacting random walks, where steps are made on the basis of the history of the path. Examples of models where this expansion applies are reinforced random walk, excited random walk, the…
Elephant random walk is a special type of random walk that incorporates the memory of the past to determine its future steps. The probability of this walk taking a particular step (+1 or -1) at a time point, conditioned on the entire…
A random walk with counterbalanced steps is a process of partial sums $\check S(n)=\check X_1+ \cdots + \check X_n$ whose steps $\check X_n$ are given recursively as follows. For each $n\geq 2$, with a fixed probability $p$, $\check X_n$ is…
This paper explores the joint behaviour of the summands of a random walk when their mean value goes to infinity as its length increases. It is proved that all the summands must share the same value, which extends previous results in the…
We perform simulations for one dimensional continuous-time random walks in two dynamic random environments with fast (independent spin-flips) and slow (simple symmetric exclusion) decay of space-time correlations, respectively. We focus on…
Gait synchronization in pedestrians is influenced by biomechanical, environmental, and cognitive factors. Studying gait in ecological settings provides insights often missed in controlled experiments. This study tackles the challenges of…
The paper deals with the asymptotic properties of a symmetric random walk in a high contrast periodic medium in $\mathbb Z^d$, $d\geq 1$. We show that under proper diffusive scaling the random walk exhibits a non-standard limit behaviour.…
We consider synchronization of chaotic systems coupled indirectly through a common environmnet where the environment has an intrinsic dynmics of its own modulated via feedback from the systems. We find that a rich vareity of synchronization…
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 establish scaling limits for the random walk whose state space is the range of a simple random walk on the four-dimensional integer lattice. These concern the asymptotic behaviour of the graph distance from the origin and the spatial…