Related papers: The random walk on the random connection model

We study memory based random walk models to understand diffusive motion in crowded heterogeneous environment. The models considered are non-Markovian as the current move of the random walk models is determined by randomly selecting a move…

Random walk is a fundamental concept with applications ranging from quantum physics to econometrics. Remarkably, one specific model of random walks appears to be ubiquitous across many fields as a tool to analyze transport phenomena in…

We study random walks in a random environment on a regular, rooted, coloured tree. The asymptotic behaviour of the walks is classified for ergodicity/transience in terms of the geometric properties of the matrix describing the random…

Random walks with memory typically involve rules where a preference for either revisiting or avoiding those sites visited in the past are introduced somehow. Such effects have a direct consequence on the statistics of first-passage and…

Exploiting the coherent medium approximation, random walk among sites distributed randomly in space is investigated when the jump rate depends on the distance between two adjacent sites. In one dimension, it is shown that when the jump rate…

Random walks have been intensively studied on regular and complex networks, which are used to represent pairwise interactions. Nonetheless, recent works have demonstrated that many real-world processes are better captured by higher-order…

Consider a stochastic process that behaves as a $d$-dimensional simple and symmetric random walk, except that, with a certain fixed probability, at each step, it chooses instead to jump to a given site with probability proportional to the…

We present our recent work on stochastic particle systems on complex networks. As a noninteracting system we first consider the diffusive motion of a random walker on heterogeneous complex networks. We find that the random walker is…

We introduce a discrete-time random walk model on a one-dimensional lattice with a nonconstant sojourn time and prove that the discrete density converges to a solution of a continuum diffusion equation. Our random walk model is not…

Famously, a $d$-dimensional, spatially homogeneous random walk whose increments are non-degenerate, have finite second moments, and have zero mean is recurrent if $d \in \{1,2\}$ but transient if $d \geq 3$. Once spatial homogeneity is…

In this paper we explore the features of a graph generated by random walkers with nodes that have evolutionary attractiveness and Boltzmann-like transition probabilities that depend both on the euclidean distance between the nodes and on…

We study the properties of discrete-time random walks on networks formed by randomly interconnected cliques, namely, random networks of cliques. Our purpose is to derive the parameters that define the network structure -- specifically, the…

Randomly breaking connections in a graph alters its transport properties, a model used to describe percolation. In the case of quantum walks, dynamic percolation graphs represent a special type of imperfections, where the connections appear…

Let $(G,\mu)$ be a uniformly elliptic random conductance graph on $\mathbb{Z}^d$ with a Poisson point process of particles at time $t=0$ that perform independent simple random walks. We show that inside a cube $Q_K$ of side length $K$, if…

Motivated by a problem arising from pharmaceutical science [B. Baeumer et al., Discr. Contin. Dyn. Sys. B 12], we study random walks on the contact graph of a bidisperse random sphere packing. For a random walk on the unweighted graph that…

We consider a continuous-time random walk which is defined as an interpolation of a random walk on a point process on the real line. The distances between neighboring points of the point process are i.i.d. random variables in the normal…

On a transient weighted graph, there are two models of random walk which continue after reaching infinity: random interlacements, and random walk reflected off of infinity, recently introduced in arXiv:2506.18827 [math.PR]. We prove these…

One class of random walks with infinite memory, so called elephant random walks, are simple models describing anomalous diffusion. We present a surprising connection between these models and bond percolation on random recursive trees. We…

Deterministic walks over a random set of points in one and two dimensions (d=1,2) are considered. Points (``cities'') are randomly scattered in R^d following a uniform distribution. A walker (a ``tourist''), at each time step, goes to the…

We study an inverse problem on a finite connected graph G = (X, E), on whose vertices a conductivity {\gamma} is defined. Our data consists in a sequence of partial observations of a fractional random walk on G. The observations are partial…