Related papers: Random walks on tori and normal numbers in self si…

Fix a strictly positive measure $W$ on the $d$-dimensional torus $\bb T^d$. For an integer $N\ge 1$, denote by $W^N_x$, $x=(x_1, ..., x_d)$, $0\le x_i <N$, the $W$-measure of the cube $[x/N, (x+\mb 1)/N)$, where $\mb 1$ is the vector with…

Let $G$ be a discrete group, $\mu$ a measure on $G$ and $X$ a proper CAT(0) space. We show that if $G$ acts non-elementarily with a rank one element on $X$, then the pushforward $\{Z_n o \}_n$ to $X$ of the random walk generated by $\mu$…

For large d, we study quantum channels on C^d obtained by selecting randomly N independent Kraus operators according to a probability measure mu on the unitary group U(d). When mu is the Haar measure, we show that for N>d/epsilon^2$, such a…

We investigate trace and observability inequalities for Laplace eigenfunctions on the d-dimensional torus, with respect to arbitrary Borel measures $\mu$. Specifically, we characterize the measures $\mu$ for which the inequalities $$ \int…

Given a sequence of lattice approximations $D_N\subset\mathbb Z^2$ of a bounded continuum domain $D\subset\mathbb R^2$ with the vertices outside $D_N$ fused together into one boundary vertex $\varrho$, we consider discrete-time simple…

A generalization of the Dirac's canonical quantization theory for a system with second-class constraints is proposed as the fundamental commutation relations that are constituted by all commutators between positions, momenta and Hamiltonian…

Stationary measures of quantum walks on the one-dimensional integer lattice are well studied. However, the stationary measure for the higher dimensional case has not been clarified. In this paper, we give the stationary amplitude for…

We present a method for computing invariant tori of dimension greater than one. The method uses a single short trajectory of a dynamical system without any continuation or initial guesses. No preferred coordinate system is required, meaning…

We investigate three aspects of weak* convergence of the $n$-step distributions of random walks on finite volume homogeneous spaces $G/\Gamma$ of semisimple real Lie groups. First, we look into the obvious obstruction to the upgrade from…

We let U=SU(2) and K=SO(2) and denote N_{U}(K) the normalizer of K in U. For a an element of U\ N_{U} (K), we let \mu_{a} be the normalized singular measure supported in KaK. For p a positive integer, it was proved that \mu_{a}^{( p)}, the…

We provide proofs of the following theorems by considering the entropy of random walks: Theorem 1.(Alon, Hoory and Linial) Let G be an undirected simple graph with n vertices, girth g, minimum degree at least 2 and average degree d: Odd…

It is shown by constructing Rohlins canonical measures that for a strictly stationary, d-dimensional vector-valued process X there exists another strictly stationary d-dimensional process U with uniform one-dimensional marginals and with…

We study a variant of the down-up and up-down walks over an $n$-partite simplicial complex, which we call expanderized higher order random walks -- where the sequence of updated coordinates correspond to the sequence of vertices visited by…

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…

Dyadic lattice graphs and their duals are commonly used as discrete approximations to the hyperbolic plane. We use them to give examples of random rooted graphs that are stationary for simple random walk, but whose duals have only a…

We consider a random walk in random environment in the low disorder regime on $\mathbb Z^d$. That is, the probability that the random walk jumps from a site $x$ to a nearest neighboring site $x+e$ is given by $p(e)+\epsilon \xi(x,e)$, where…

Investigating a model of scale-invariant random spatial network suggested by Aldous, Kendall constructed a random metric $T$ on $\mathbb{R}^d$, for which the distance between points is given by the optimal connection time, when travelling…

We study random walks on Erd\"os-R\'enyi random graphs in which, every time the random walk returns to the starting point, first an edge probability is independently sampled according to a priori measure $\mu$, and then an Erd\"os-R\'enyi…

We consider random walk on a mildly random environment on finite transitive d- regular graphs of increasing girth. After scaling and centering, the analytic spectrum of the transition matrix converges in distribution to a Gaussian noise. An…

We investigate numerically and theoretically the effect of spatial disorder on two-dimensional split-step discrete-time quantum walks with two internal "coin" states. Spatial disorder can lead to Anderson localization, inhibiting the spread…