相关论文: Late points for random walks in two dimensions

It is well known that adding "long edges (shortcuts)" to a regularly constructed graph will make the resulted model a small world. Recently, \cite{W} indicated that, among all long edges, those edges with length proportional to the diameter…

We determine the joint distribution of the lengths of, and angles between, the N shortest lattice vectors in a random n-dimensional lattice as n tends to infinity. Moreover we interpret the result in terms of eigenvalues and eigenfunctions…

Random walks on discrete lattices are fundamental models that form the basis for our understanding of transport and diffusion processes. For a single random walker on complex networks, many properties such as the mean first passage time and…

We examine isotropic and anisotropic random walks which begin on the surface of linear ($N$), square ($N \times N$), or cubic ($N \times N \times N$) lattices and end upon encountering the surface again. The mean length of walks is equal to…

We consider the cover time for a simple random walk on the two-dimensional discrete torus of side length $n$. Dembo, Peres, Rosen, and Zeitouni [Ann. Math. 160:433-464, 2004] identified the leading term in the asymptotics for the cover time…

Random walks of n steps taken into independent uniformly random directions in a d-dimensional Euclidean space (d larger than 1), are named Dirichlet when their step lengths are distributed according to a Dirichlet law. The latter continuous…

We investigate a problem suggested by Dembo, Peres, Rosen, and Zeitouni, which states that the growth exponent of favorite points associated with a simple random walk in ${\mathbb Z}^2$ coincides, on average and almost surely, with those of…

We present a Monte Carlo study of the fractal geometry of clusters formed by discrete-time simple random walks (sRW) of $L^2$ steps on a periodic square $L\times L$ lattice. We verify with high precision that the asymptotic behavior of the…

We consider two random walks evolving synchronously on a random out-regular graph of $n$ vertices with bounded out-degree $r\ge 2$, also known as a random Deterministic Finite Automaton (DFA). We show that, with high probability with…

We show that the critical density of the Activated Random Walk model on $\mathbb{Z}^d$ is strictly less than one when the sleep rate $\lambda$ is small enough, and tends to $0$ when $\lambda\to 0$, in any dimension $d\geqslant 1$. As far as…

Let $X$ be a simple random walk on $\mathbb{Z}_n^d$ with $d\geq 3$ and let $t_{\rm{cov}}$ be the expected cover time. We consider the set of points $\mathcal{U}_\alpha$ of $\mathbb{Z}_n^d$ that have not been visited by the walk by time…

We study the convex hull of the first $n$ steps of a planar random walk, and present large-$n$ asymptotic results on its perimeter length $L_n$, diameter $D_n$, and shape. In the case where the walk has a non-zero mean drift, we show that…

We study sets of nontypical points under the map $f_\beta \mapsto \beta x $ mod 1, for non-integer $\beta$ and extend our results from [F\"arm, Persson, Schmeling, 2010] in several directions. In particular we prove that sets of points…

Consider algorithms with unbounded computation time that probe the entries of the adjacency matrix of an $n$ vertex graph, and need to output a clique. We show that if the input graph is drawn at random from $G_{n,\frac{1}{2}}$ (and hence…

We show a $2^{n/2+o(n)}$-time algorithm that finds a (non-zero) vector in a lattice $\mathcal{L} \subset \mathbb{R}^n$ with norm at most $\tilde{O}(\sqrt{n})\cdot \min\{\lambda_1(\mathcal{L}), \det(\mathcal{L})^{1/n}\}$, where…

We consider a random walk on the fully-connected lattice with $N$ sites and study the time evolution of the number of distinct sites $s$ visited by the walker on a subset with $n$ sites. A record value $v$ is obtained for $s$ at a record…

In this paper, we investigate random walks in a family of small-world trees having an exponential degree distribution. First, we address a trapping problem, that is, a particular case of random walks with an immobile trap located at the…

We consider a prototypical two-parameter family of invertible maps of $\mathbb{Z}^2$, representing rotations with decreasing rotation number. These maps describe the dynamics inside the island chains of a piecewise affine discrete twist map…

We determine the structure of the set of intermediate $\beta$-shifts of finite type. Specifically, we show that this set is dense in the parameter space $\Delta = \{ (\beta, \alpha) \in \mathbb{R}^{2} \colon \beta \in (1, 2) \; \text{and}…

Let a simple random walk run inside a torus of dimension three or higher for a number of steps which is a constant proportion of the volume. We examine geometric properties of the range, the random subgraph induced by the set of vertices…