Related papers: Log-concavity in planar random walks

We propose an experimental realization of discrete quantum random walks using neutral atoms trapped in optical lattices. The random walk is taking place in position space and experimental implementation with present day technology --even…

Random walk on the set of irreducible representations of a finite group is investigated. For the symmetric and general linear groups, a sharp convergence rate bound is obtained and a cutoff phenomenon is proved. As related results, an…

We study the asymptotic behavior of zero-drift random walks confined to multidimensional convex cones, when the endpoint is close to the boundary. We derive a local limit theorem in the fluctuation regime.

In this paper we develop tools for studying limit theorems by means of convexity. We establish bounds for the discrepancy in total variation between probability measures $\mu$ and $\nu$ such that $\nu$ is log-concave with respect to $\mu$.…

We study a one-dimensional random walk among random conductances, with unbounded jumps. Assuming the ergodicity of the collection of conductances and a few other technical conditions (uniform ellipticity and polynomial bounds on the tails…

We prove sharp anti-concentration results for log-concave random variables on the real line in both the discrete and continuous setting. Our approach is elementary and uses majorization techniques to recover and extend some recent and not…

We prove new results on lazy random walks on finite graphs. To start, we obtain new estimates on return probabilities $P^t(x,x)$ and the maximum expected hitting time $t_{\rm hit}$, both in terms of the relaxation time. We also prove a…

A global picture of a random particle movement is given by the convex hull of the visited points. We obtained numerically the probability distributions of the volume and surface of the convex hulls of a selection of three types of…

We study the asymptotic behavior of a nonlattice random walk in a general cone of $R^d$ . Following the approach initiated by D. Denisov and V. Wachtel in [8], we use a strong approximation of random walks by the Brownian motion and prove…

We study an homogeneous irreducible markovian random walk in a square lattice of arbitrary dimension, with an antisymmetric perturbation acting only in one point. We compute exactly spatial correction to the diffusive behaviour in the…

We study the range of a planar random walk on a randomly oriented lattice, already known to be transient. We prove that the expectation of the range grows linearly, in both the quenched (for a.e. orientation) and annealed ("averaged")…

We propose a computationally efficient random walk on a convex body which rapidly mixes and closely tracks a time-varying log-concave distribution. We develop general theoretical guarantees on the required number of steps; this number can…

We study the asymptotic behavior of the simple random walk on oriented versions of $\mathbb{Z}^2$. The considered lattices are not directed on the vertical axis but unidirectional on the horizontal one, with random orientations whose…

We prove that the local time process of a planar simple random walk, when time is scaled logarithmically, converges to a non-degenerate pure jump process. The convergence takes place in the Skorokhod space with respect to the $M1$ topology…

Consider a sequence of independent random isometries of Euclidean space with a previously fixed probability law. Apply these isometries successively to the origin and consider the sequence of random points that we obtain this way. We prove…

In this note, we give an original convergence result for products of independent random elements of motion group. Then we consider dynamic random walks which are inhomogeneous Markov chains whose transition probability of each step is, in…

We consider a centered random walk with finite variance and investigate the asymptotic behaviour of the probability that the area under this walk remains positive up to a large time $n$. Assuming that the moment of order $2+\delta$ is…

In this paper we prove the Zariski-Lipman conjecture for log canonical spaces.

We prove that in a large collection of naturally defined sets of permutations of fixed length, the numbers of permutations at Ulam distance k from the identity form a log-concave sequence in k.

For a random walk in an elliptic i.i.d. random environment in dimension greater than or equal to 4, satisfying the a ballisticity condition slightly weaker than condition (T'), We consider the probability of linear slowdown. We show an…