Related papers: Symmetric random walks on certain amalgamated free…
We obtain the Green's function $G$ for any flat rhombic torus $T$, always with numerical values of significant digits up to the fourth decimal place (noting that $G$ is unique for $|T|=1$ and $\int_TGdA=0$). This precision is guaranteed by…
Let $G=(V,E)$ be a $d$-regular graph on $n$ vertices and let $\mu_0$ be a probability measure on $V$. The act of moving to a randomly chosen neighbor leads to a sequence of probability measures supported on $V$ given by $\mu_{k+1} = A…
We focus on the problem of performing random walks efficiently in a distributed network. Given bandwidth constraints, the goal is to minimize the number of rounds required to obtain a random walk sample. We first present a fast sublinear…
We consider the problem of counting commuting r-tuples of elements of the symmetric group S_n, i.e. computing |Hom(Z^r,S_n)|. The cases r=1,2 are well-known; a product formula for the case r=3 was conjectured by Adams-Watters and later…
We consider a random walker in a dynamic random environment given by a system of independent simple symmetric random walks. We obtain ballisticity results under two types of perturbations: low particle density, and strong local drift on…
A rotor-router walk is a deterministic version of a random walk, in which the walker is routed to each of the neighbouring vertices in some fixed cyclic order. We consider here directed covers of graphs (called also periodic trees) and we…
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…
Since Voiculescu introduced his bi-free probability theory in 2013, the major development of the theory has been on its combinatorial side; in particular, on the combinatorics of bi-free cumulants and its application to the bi-free…
To what extent is the underlying distribution of a finitely supported unbiased random walk on $\mathbb{Z}$ determined by the sequence of times at which the walk returns to the origin? The main result of this paper is that, in various…
Random walkers characterized by random positions and random velocities lead to normal diffusion. A random walk was originally proposed by Einstein to model Brownian motion and to demonstrate the existence of atoms and molecules. Such a…
We study the probability that one beta-distributed random variable exceeds the maximum of two others, allowing all three to have general parameters. This amounts to studying Euler transforms of products of two incomplete beta functions. We…
We study the isoperimetric and spectral profiles of certain families of finitely generated groups defined via actions on labelled Schreier graphs and simple {\em gluing} of such. In one of our simplest constructions---the {\em…
We consider the asymptotic behaviour of the Chern-Simons Green's function of the $\nu=1/\tilde{\phi}$ system for an infinite area in position-time representation. We calculate explicitly the asymptotic form of the Green's function of the…
We study products of random isometries acting on Euclidean space. Building on previous work of the second author, we prove a local limit theorem for balls of shrinking radius with exponential speed under the assumption that a Markov…
The results of part I (hep-ph/9612284) are used to obtain full asymptotic expansions of Feynman diagrams renormalized within the MS-scheme in the regimes when some of the masses and external momenta are large with respect to the others. The…
We present recent results about the asymptotic behavior of ergodic products of isometries of a metric space X. If we assume that the displacement is integrable, then either there is a sublinear diffusion or there is, for almost every…
We bound the rate of convergence to uniformity for certain random walks on the complete monomial groups G \wr S_n for any group G. These results provide rates of convergence for random walks on a number of groups of interest: the…
The rotor walk is a derandomized version of the random walk on a graph. On successive visits to any given vertex, the walker is routed to each of the neighboring vertices in some fixed cyclic order, rather than to a random sequence of…
We consider a random object that is associated with both random walks and random media, specifically, the superposition of a configuration of subcritical Bernoulli percolation on an infinite connected graph and the trace of the simple…
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…