Related papers: The spectral gap and principle eigenfunction of th…

We show that the spectral gap of a random walk on the domain of normal attraction of an $\alpha$-stable law is of order $\mathcal O(n^{\alpha})$ when restricted to boxes of size $n$. The proof is based on a comparison principle that may be…

The Kac model describes the local evolution of a gas of $N$ particles with three dimensional velocities by a random walk in which the steps correspond to binary collisions that conserve momentum as well as energy. The state space of this…

We study a one-dimensional random walk among random conductances, with unbounded jumps. Assuming the ergodicity of the collection of conductances and a few other technical conditions (uniform ellipticity and polynomial bounds on the tails…

We give a new and elementary computation of the spectral gap of the Kac walk on the N-sphere. The result is obtained as a by-product of a more general observation which allows to reduce the analysis of the spectral gap of an N-component…

It is a classic result in spectral theory that the limit distribution of the spectral measure of random graphs G(n, p) converges to the semicircle law in case np tends to infinity with n. The spectral measure for random graphs G(n, c/n)…

We derive an approximate but explicit formula for the Mean First Passage Time of a random walker between a source and a target node of a directed and weighted network. The formula does not require any matrix inversion, and it takes as only…

We study high order random walks in high dimensional expanders; namely, in complexes which are local spectral expanders. Recent works have studied the spectrum of high order walks and deduced fast mixing. However, the spectral gap of high…

The second largest eigenvalue of a transition matrix $P$ has connections with many properties of the underlying Markov chain, and especially its convergence rate towards the stationary distribution. In this paper, we give an asymptotic…

We consider a random walk on a random graph $(V,E)$, where $V$ is the set of open sites under i.i.d. Bernoulli site percolation on the multi-dimensional integer set $\mathbf{Z}^d$, and the transition probabilities of the walk are generated…

Let $G$ be a graph on $n$ vertices, with complement $\overline{G}$. The spectral gap of the transition probability matrix of a random walk on $G$ is used to estimate how fast the random walk becomes stationary. We prove that the larger…

A survey is presented of known results concerning simple random walk on the class of distance-regular graphs. One of the highlights is that electric resistance and hitting times between points can be explicitly calculated and given strong…

Let A be an n x n symmetric random matrix whose upper-triangular entries are independent and follow possibly non-identical subgaussian distributions. This paper investigates the spectral properties of A, including its eigenvalues and…

In [3] the radius of convergence of the generating function of the collision local time of two independent copies of an irreducible, symmetric and transient random walk on Zd, d \geq 1, was studied. Two versions were considered: z1, the…

We consider an analogue of the Kac random walk on the special orthogonal group $SO(N)$, in which at each step a random rotation is performed in a randomly chosen 2-plane of $\bR^N$. We obtain sharp asymptotics for the rate of convergence in…

We study the first-passage properties of a random walk in the unit interval in which the length of a single step is uniformly distributed over the finite range [-a,a]. For a of the order of one, the exit probabilities to each edge of the…

We study analytically the order statistics of a time series generated by the successive positions of a symmetric random walk of n steps with step lengths of finite variance \sigma^2. We show that the statistics of the gap d_{k,n}=M_{k,n}…

The spectral gap of local random quantum circuits is a fundamental property that determines how close the moments of the circuit's unitaries match those of a Haar random distribution. When studying spectral gaps, it is common to bound these…

In recent work on equiangular lines, Jiang, Tidor, Yuan, Zhang, and Zhao showed that a connected bounded degree graph has sublinear second eigenvalue multiplicity. More generally they show that there cannot be too many eigenvalues near the…

In this paper we study a random walk in a one-dimensional dynamic random environment consisting of a collection of independent particles performing simple symmetric random walks in a Poisson equilibrium with density $\rho \in (0,\infty)$.…

We consider random resistor networks with nodes given by a point process on $\mathbb{R}^d$ and with random conductances. The length range of the electrical filaments can be unbounded. We assume that the randomness is stationary and ergodic…