Related papers: On the spectrum of lamplighter groups and percolat…
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 pursue applications for symplectic Plancherel growth based on a repulsion phenomenon arising in its diffusion limit and on intermediate representation theory underlying its correlation structure. Under diffusive scaling, the dynamics…
An infinite graph G has the property that a random walk in random environment on G defined by i.i.d. resistances with any common distribution is almost surely transient, if and only if for some p<1, simple random walk is transient on a…
In this paper we study spectral properties of adjacency and Laplace operators on percolation subgraphs of Cayley graphs of amenable, finitely generated groups. In particular we describe the asymptotic behaviour of the integrated density of…
Techniques of `dynamic renormalization', developed earlier for undirected percolation and the contact model, are adapted to the setting of directed percolation, thereby obtaining solutions of several problems for directed percolation on…
Let $(G_n)_{n \geq 1} = ((V_n,E_n))_{n \geq 1}$ be a sequence of finite, connected, vertex-transitive graphs with volume tending to infinity. We say that a sequence of parameters $(p_n)_{n \geq 1}$ in $[0,1]$ is supercritical with respect…
We investigate the eigenvalue statistics of random Bernoulli matrices, where the matrix elements are chosen independently from a binary set with equal probability. This is achieved by initiating a discrete random walk process over the space…
The power spectrum is a Fourier series statistic associated with the covariances of the displacement from average positions of the members of an eigen-sequence. When this eigen-sequence has rotational invariance, as for the eigen-angles of…
We study the decay of convolution powers of a large family $\mu_{S,a}$ of measures on finitely generated nilpotent groups. Here, $S=(s_1,...,s_k)$ is a generating $k$-tuple of group elements and $a= (\alpha_1,...,\alpha_k)$ is a $k$-tuple…
We present exact calculations of the average number of connected clusters per site, $<k>$, as a function of bond occupation probability $p$, for the bond percolation problem on infinite-length strips of finite width $L_y$, of the square,…
Consider Bernoulli bond percolation on a graph nicely embedded in hyperbolic space $\mathbb H^d$ in such a way that it admits a transitive action by isometries of $\mathbb H^d$. Let $p_0$ be the supremum of such percolation parameters that…
We consider the problem of clustering grouped data with possibly non-exchangeable groups whose dependencies can be characterized by a known directed acyclic graph. To allow the sharing of clusters among the non-exchangeable groups, we…
Suppose that G and H are finite, connected graphs, G regular, X is a lazy random walk on G and Z is a reversible ergodic Markov chain on H. The generalized lamplighter chain X* associated with X and Z is the random walk on the wreath…
Via a Dirichlet form extension theorem and making full use of two-sided heat kernel estimates, we establish quenched invariance principles for random walks in random environments with a boundary. In particular, we prove that the random walk…
We show that the transience or recurrence of a random walk in certain random environments on an arbitrary infinite locally finite tree is determined by the branching number of the tree, which is a measure of the average number of branches…
Percolation clusters are random fractals whose geometrical and transport properties can be characterized with the help of probability distribution functions. Using renormalized field theory, we determine the asymptotic form of various of…
We show that the measure on markings of $\mathbf {Z}_n^d$, $d\geq3$, with elements of ${0,1}$ given by i.i.d. fair coin flips on the range $\mathcal {R}$ of a random walk $X$ run until time $T$ and 0 otherwise becomes indistinguishable from…
Graph complements G(n) of cyclic graphs are circulant, vertex-transitive, claw-free, strongly regular, Hamiltonian graphs with a Z(n) symmetry, Shannon capacity 2 and known Wiener and Harary index. There is an explicit spectral zeta…
We obtain the harmonic measure of diffusion-limited aggregate (DLA) clusters using a biased random-walk sampling technique which allows us to measure probabilities of random walkers hitting sections of clusters with unprecedented accuracy;…
We prove the continuity of asymptotic entropy as a function of the step distribution for non-degenerate probability measures with finite entropy on wreath products $ A \wr B = \bigoplus_B A \rtimes B $, where $A$ is any countable group and…