Related papers: An inequality for functions on the Hamming cube

Let X and Y be two simple symmetric continuous-time random walks on the vertices of the n-dimensional hypercube. We consider the class of co-adapted couplings of these processes, and describe an intuitive coupling which is shown to be the…

We derive a functional central limit theorem for the excursion of a random walk conditioned on sweeping a prescribed geometric area. We assume that the increments of the random walk are integer-valued, centered, with a third moment equal to…

Isoperimetric inequalities form a very intuitive yet powerful characterization of the connectedness of a state space, that has proven successful in obtaining convergence bounds. Since the seventies they form an essential tool in…

We consider discrete (time and space) random walks confined to the quarter plane, with jumps only in directions $(i,j)$ with $i+j \geq 0$ and small negative jumps, i.e., $i,j \geq -1$. These walks are called singular, and were recently…

We describe a very general abstract form of sieve based on a large sieve inequality which generalizes both the classical sieve inequality of Montgomery (and its higher-dimensional variants), and our recent sieve for Frobenius over function…

We consider a discrete-time random walk on the nodes of an unbounded hexagonal lattice. We determine the probability generating functions, the transition probabilities and the relevant moments. The convergence of the stochastic process to a…

We consider multidimensional discrete valued random walks with nonzero drift killed when leaving general cones of the euclidian space. We find the asymptotics for the exit time from the cone and study weak convergence of the process…

Let $G$ be a connected semisimple real Lie group with finite center, and $\mu$ a probability measure on $G$ whose support generates a Zariski-dense subgroup of $G$. We consider the right $\mu$-random walk on $G$ and show that each random…

We prove that in any finite set of $\mathbb Z^d$ with $d\ge 3$, there is a subset whose capacity and volume are both of the same order as the capacity of the initial set. As an application we obtain estimates on the probability of {\it…

We prove weighted isoperimetric inequalities for smooth, bounded, and simply connected domains. More precisely, we show that the moment of inertia of inner parallel curves for domains with fixed perimeter attains its maximum for a disk.…

We study whether the probability distribution of a discrete quantum walk can get arbitrarily close to uniform, given that the walk starts with a uniform superposition of the outgoing arcs of some vertex. We establish a characterization of…

We give an alternative, simple method to prove isoperimetric inequalities over the hypercube. In particular, we show: 1. An elementary proof of classical isoperimetric inequalities of Talagrand, as well as a stronger isoperimetric result…

We study asymptotic properties of the Green metric associated with transient random walks on countable groups. We prove that the rate of escape of the random walk computed in the Green metric equals its asymptotic entropy. The proof relies…

We consider multidimensional random walks in pyramids, which by definition are cones formed by finite intersections of half-spaces. The main object of interest is the survival probability $\mathbb{P}(\tau>n)$, $\tau$ denoting the first exit…

Dyadic shifts of point distributions in the multi-dimensional unit cube are considered as a randomization. Explicit formulas for the discrepancies of such randomized distributions are given in the paper in terms of Rademacher functions.…

We obtain an optimal deviation from the mean upper bound \begin{equation} D(x)\=\sup_{f\in \F}\mu\{f-\E_{\mu} f\geq x\},\qquad\ \text{for}\ x\in\R\label{abstr} \end{equation} where $\F$ is the class of the integrable, Lipschitz functions on…

Considering Wirtinger's inequality for piece-wise equipartite functions we find a discrete version of this classical inequality. The main tool we use is the theorem of classification of isometries. Our approach provides a new elementary…

This paper presents a geometric approach to the classical isoperimetric problem by analysing the efficiency of regular polygons in enclosing maximum area for a fixed perimeter. Using efficiency metrics, it proves that regular polygons…

Harper's Theorem states that, in a hypercube, among all sets of a given fixed size the Hamming balls have minimal closed neighbourhoods. In this paper we prove a stability-like result for Harper's Theorem: if the closed neighbourhood of a…

We investigate the first-passage properties of nearest-neighbor hopping on a finite interval with disordered hopping rates. We develop an approach that relies on the backward equation, in conjunction with probability generating functions,…