Related papers: A New Approach to Code Smoothing Bounds

We present a probabilistic theory of random walks in turbid media with non-scattering regions. It is shown that important characteristics such as diffusion constants, average step lengths, crossing statistics and void spacings can be…

We consider random walks on the set of all words over a finite alphabet such that in each step only the last two letters of the current word may be modified and only one letter may be adjoined or deleted. We assume that the transition…

The separability of clusters is one of the most desired properties in clustering. There is a wide range of settings in which different clusterings of the same data set appear. We are interested in applications where there is a need for an…

We consider the biased random walk on a tree constructed from the set of finite self-avoiding walks on a lattice, and use it to construct probability measures on infinite self-avoiding walks. The limit measure (if it exists) obtained when…

We derive a local limit theorem for normal, moderate, and large deviations for symmetric simple random walk on the square lattice in dimensions one and two that is an improvement of existing results for points that are particularly distant…

The purpose of this note is to establish convergence of random walks on the moduli space of Abelian differentials on compact Riemann surfaces in two different modes: convergence of the $n$-step distributions from almost every starting point…

For a discrete time quantum walk (QW) on the $N$-cycle, allowing for decoherence on the coin, we derive a number of new results, including an explicit formula for the position probability distribution. For a QW of this type, we show that…

We give bounds in total variation distance for random walks associated to pure central states on free orthogonal quantum groups. As a consequence, we prove that the analogue of the uniform plane Kac walk on this quantum group has a cut-off…

Probabilistic smoothing is a standard tool for global optimization, but existing methods rely on Gaussian kernels and specific transforms, often resulting in strong hyperparameter sensitivity and limited robustness. We propose a general…

This paper presents an achievability bound that evaluates the exact probability of error of an ensemble of random codes that are decoded by a minimum distance decoder. Compared to the state-of-the-art which demands exponential computation…

In this paper, we study properties of random walks on finite groups and later use them to obtain the limiting braid length expectation and component number of braid closure in a model of random braids, which is constructed by lifting…

We study a family of correlated one-dimensional random walks with a finite memory range M.These walks are extensions of the Taylor's walk as investigated by Goldstein, which has a memory range equal to one. At each step, with a probability…

Discrete-time quantum walks are considered a counterpart of random walks and the study for them has been getting attention since around 2000. In this paper, we focus on a quantum walk which generates a probability distribution splitting to…

In this paper we present a new and flexible method to show that, in one dimension, various self-repellent random walks converge to self-repellent Brownian motion in the limit of weak interaction after appropriate space-time scaling. Our…

For certain materials science scenarios arising in rubber technology, one-dimensional moving boundary problems (MBPs) with kinetic boundary conditions are capable of unveiling the large-time behavior of the diffusants penetration front,…

We prove that Abelian sandpiles with random initial states converge almost surely to unique scaling limits. The proof follows the Armstrong-Smart program for stochastic homogenization of uniformly elliptic equations. Using simple random…

We prove existence of asymptotic entropy of random walks on regular languages over a finite alphabet and we give formulas for it. Furthermore, we show that the entropy varies real-analytically in terms of probability measures of constant…

It has been recently suggested that a totally asymmetric exclusion process with two species on an open chain could exhibit spontaneous symmetry breaking in some range of the parameters defining its dynamics. The symmetry breaking is…

The paper analyzes a specific class of random walks on quotients of $X:=\text{SL}(k,{\Bbb R})/ \Gamma$ for a lattice $\Gamma$. Consider a one parameter diagonal subgroup, $\{g_t\}$, with an associated abelian expanding horosphere, $U\cong…

Quantum walks on graphs are ubiquitous in quantum computing finding a myriad of applications. Likewise, random walks on graphs are a fundamental building block for a large number of algorithms with diverse applications. While the…