Related papers: Hipster random walks, random series-parallel graph…
In this paper, we study the stochastic homogenization for a class of symmetric random walks in random conductance model, whose one-step transition probability from $x$ to $y$ is proportional to $|x-y|^{-d-2}$. As the associated jumping…
We propose random walks on suitably defined graphs as a framework for finescale modeling of particle motion in an obstructed environment where the particle may have interactions with the obstructions and the mean path length of the particle…
We study the first passage time properties of an integrated Brownian curve both in homogeneous and disordered environments. In a disordered medium we relate the scaling properties of this center of mass persistence of a random walker to the…
We study the evolution of a random walker on a conservative dynamic random environment composed of independent particles performing simple symmetric random walks, generalizing results of [16] to higher dimensions and more general transition…
Discrete time random walks, in which a step of random sign but constant length $\delta x$ is performed after each time interval $\delta t$, are widely used models for stochastic processes. In the case of a correlated random walk, the next…
In this thesis, we study three physically relevant models of strongly correlated random variables: trapped fermions, random matrices and random walks. In the first part, we show several exact mappings between the ground state of a trapped…
We attempt to extract a homological structure of two kinds of graphs by the Grover walk. The first one consists of a cycle and two semi-infinite lines and the second one is assembled by a periodic embedding of the cycles in $\mathbb{Z}$. We…
Nodes can be ranked according to their relative importance within the network. Ranking algorithms based on random walks are particularly useful because they connect topological and diffusive properties of the network. Previous methods based…
Consider continuous-time random walks on Cayley graphs where the rate assigned to each edge depends only on the corresponding generator. We show that the limiting speed is monotone increasing in the rates for infinite Cayley graphs that…
Let $G$ be a connected simple real Lie group, $\Lambda_{0}\subseteq G$ a lattice and $\Lambda \unlhd \Lambda_{0}$ a normal subgroup such that $\Lambda_{0}/\Lambda\simeq \mathbb{Z}^d$. We study the drift of a random walk on the…
We consider the long-range random conductance model on $\mathbb{Z}^d$ at the critical exponent: the jump rate between sites $x$ and $y$ decays as $\mathbf{a}(x,y) |x-y|^{-(d+2)}$, where $\mathbf{a}(x,y)$ are i.i.d. uniformly elliptic…
Random walks on the circle group $\mathbb{R}/\mathbb{Z}$ whose elementary steps are lattice variables with span $\alpha \not\in \mathbb{Q}$ or $p/q \in \mathbb{Q}$ taken mod $\mathbb{Z}$ exhibit delicate behavior. In the rational case we…
We consider a model of random walk in ${\mathbb Z}^2$ with (fixed or random) orientation of the horizontal lines (layers) and with non constant iid probability to stay on these lines. We prove the transience of the walk for any fixed…
In [3] the radius of convergence of the generating function of the collision local time of two independent copies of an irreducible, symmetric and transient random walk on Zd, d \geq 1, was studied. Two versions were considered: z1, the…
We study the long-time behavior of the probability density associated with the decoupled continuous-time random walk which is characterized by a superheavy-tailed distribution of waiting times. It is shown that if the random walk is…
This paper is concerned with the limit theory of the extreme order statistics derived from random walks. We establish the joint convergence of the order statistics near the minimum of a random walk in terms of the Feller chains. Detailed…
In this article we establish two fundamental results for the sublevel set persistent homology for stationary processes indexed by the positive integers. The first is a strong law of large numbers for the persistence diagram (treated as a…
Analyzing the mixing time of random walks is a well-studied problem with applications in random sampling and more recently in graph partitioning. In this work, we present new analysis of random walks and evolving sets using more…
The spectral density of random graphs with topological constraints is analysed using the replica method. We consider graph ensembles featuring generalised degree-degree correlations, as well as those with a community structure. In each case…
We consider two interacting random walks on $\mathbb{Z}$ such that the transition probability of one walk in one direction decreases exponentially with the number of transitions of the other walk in that direction. The joint process may…