Related papers: Generating discrete-time constrained random walks …
In this paper, we provide a methodology for computing the probability distribution of sojourn times for a wide class of Markov chains. Our methodology consists in writing out linear systems and matrix equations for generating functions…
We analyze a specific class of random systems that are driven by a symmetric L\'{e}vy stable noise. In view of the L\'{e}vy noise sensitivity to the confining "potential landscape" where jumps take place (in other words, to environmental…
The diffusion of a walk in the presence of traps is investigated. Different diffusion regimes are obtained considering the magnitude of the fluctuations in waiting times and jump distances. A constant velocity during the jump motion is…
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…
We consider a minimal model of persistent random searcher with short range memory. We calculate exactly for such searcher the mean first-passage time to a target in a bounded domain and find that it admits a non trivial minimum as function…
Continuous time random walks have random waiting times between particle jumps. We define the correlated continuous time random walks (CTRWs) that converge to fractional Pearson diffusions (fPDs). The jumps in these CTRWs are obtained from…
The statistics of first-passage times of random walks to target sites has proved to play a key role in determining the kinetics of space exploration in various contexts. In parallel, the number of distinct sites visited by a random walker…
Temporal point processes offer a powerful framework for sampling from discrete distributions, yet they remain underutilized in existing literature. We show how to construct, for any target multivariate count distribution with…
L\'evy flights and L\'evy walks serve as two paradigms of random walks resembling common features but also bearing fundamental differences. One of the main dissimilarities are discontinuity versus continuity of their trajectories and…
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we focus on the problem of sampling random walks efficiently in a…
In order to approximate the exit time of a one-dimensional diffusion process, we propose an algorithm based on a random walk. Such an algorithm was already introduced in both the Brownian context and in the Ornstein-Uhlenbeck context. Here…
We study the escape probability problem in random walks over graphs. Given vertices, $s,t,$ and $p$, the problem asks for the probability that a random walk starting at $s$ will hit $t$ before hitting $p$. Such probabilities can be…
We present a procedure that determines the law of a random walk in an iid random environment as a function of a single "typical" trajectory. We indicate when the trajectory characterizes the law of the environment, and we say how this law…
We prove an explicit formula of hitting times in terms of enumerations of spanning trees for random walks on general connected graphs. We apply the formula to improve Lawler's bound of hitting times for general graphs, prove a sharp bound…
In this paper we analyse random walk on a fractal structure, specifi- cally fractal curves, using the recently develped calculus for fractal curves. We consider only unbiased random walk on the fractal stucture and find out the…
We consider conservative cross-diffusion systems for two species where individual motion rates depend linearly on the local density of the other species. We develop duality estimates and obtain stability and approximation results. We first…
The random walk process in a nonhomogeneous medium, characterised by a L\'evy stable distribution of jump length, is discussed. The width depends on a position: either before the jump or after that. In the latter case, the density slope is…
We propose a novel stochastic method to generate Brownian paths conditioned to start at an initial point and end at a given final point during a fixed time $t_{f}$ under a given potential $U(x)$. These paths are sampled with a probability…
We consider a transitive action of a finitely generated group $G$ and the Schreier graph $\Gamma$ defined by this action for some fixed generating set. For a probability measure $\mu$ on $G$ with a finite first moment we show that if the…
We consider a variant of random walks on finite groups. At each step, we choose an element from a set of generators ("directions") uniformly, and an integer from a power law ("speed") distribution associated with the chosen direction. We…