Related papers: Diffusivity of a walk on fractures of a hypertorus
We analyse how simple local constraints in two dimensions lead a defect to exhibit robust, non-transient, and tunable, subdiffusion. We uncover a rich dynamical phenomenology realised in ice- and dimer-type models. On the microscopic scale…
We consider one or more independent random walks on the $d\ge 3$ dimensional discrete torus. The walks start from vertices chosen independently and uniformly at random. We analyze the fluctuation behavior of the size of some random sets…
We analyze random walk through fractal environments, embedded in 3-dimensional, permeable space. Particles travel freely and are scattered off into random directions when they hit the fractal. The statistical distribution of the flight…
We consider a model of a random height function with long-range constraints on a discrete segment. This model was suggested by Benjamini, Yadin and Yehudayoff and is a generalization of simple random walk. The random function is uniformly…
In this paper, we study the dynamics of a random walker diffusing on a disordered one-dimensional lattice with random trappings. The distribution of escape probabilities is computed exactly for any strength of the disorder. These…
Diffusion limits of MCMC methods in high dimensions provide a useful theoretical tool for studying computational complexity. In particular, they lead directly to precise estimates of the number of steps required to explore the target…
We prove a non-standard functional limit theorem for a two dimensional simple random walk on some randomly oriented lattices. This random walk, already known to be transient, has different horizontal and vertical fluctuations leading to…
Graph-limit theory focuses on the convergence of sequences of graphs when the number of nodes becomes arbitrarily large. This framework defines a continuous version of graphs allowing for the study of dynamical systems on very large graphs,…
In this paper, we rigorously establish the Gumbel-distributed fluctuations of the cover time, normalized by the mean first passage time, for finite-range, symmetric, irreducible random walks on a torus of dimension three or higher. This has…
In the randomly-oriented Manhattan lattice, every line in $\mathbb{Z}^d$ is assigned a uniform random direction. We consider the directed graph whose vertex set is $\mathbb{Z}^d$ and whose edges connect nearest neighbours, but only in the…
The distribution of the hypervolume $V$ and surface $\partial V$ of convex hulls of (multiple) random walks in higher dimensions are determined numerically, especially containing probabilities far smaller than $P = 10^{-1000}$ to estimate…
Miscible tracer dispersion measurements in transparent model fractures with different types of wall roughness are reported. The nature (Fickian or not) of dispersion is determined by studying variations of the mixing front as a function of…
We introduce a multidimensional walk with memory and random tendency. The asymptotic behaviour is characterized, proving a law of large numbers and showing a phase transition from diffusive to superdiffusive regimes. In first case, we…
Mathematical models of motility are often based on random-walk descriptions of discrete individuals that can move according to certain rules. It is usually the case that large masses concentrated in small regions of space have a great…
We analyse the statistical distribution function for the height fluctuations of brittle fracture surfaces using extensive experimental data sampled on widely different materials and geometries. We compare a direct measurement of the…
In this article, we consider several models of random walks in one or several dimensions, additionally allowing, at any unit of time, a reset (or "catastrophe") of the walk with probability $q$. We establish the distribution of the final…
We study the behavior of random walk on dynamical percolation. In this model, the edges of a graph G are either open or closed and refresh their status at rate \mu\ while at the same time a random walker moves on G at rate 1 but only along…
Complex networks are characterized by latent geometries induced by their topology or by the dynamics on the top of them. In the latter case, different network-driven processes induce distinct geometric features that can be captured by…
Collective phenomena emerge from the interaction of natural or artificial units with a complex organization. The interplay between structural patterns and dynamics might induce functional clusters that, in general, are different from…
We investigate active lattice walks: biased continuous time random walks which perform orientational diffusion between lattice directions in one and two spatial dimensions. We study the occupation probability of an arbitrary site on the…