English
Related papers

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

200 papers

We study a discrete-time random walk on the non-negative integers, such that when 0 is reached a jump occurs to an arbitrary location, with given probabilities. We obtain an asymptotic formula for the expected position at large times, in…

Probability · Mathematics 2011-09-01 Guy Katriel

We study continuous time random walks on $\mathbb{Z}^d$ (with $d \geq 2$) among random conductances $\{ \omega(\{x,y\}) : x,y \in \mathbb{Z}^d\}$ that permit jumps of arbitrary length. The law of the random variables $\omega(\{x,y\})$,…

Probability · Mathematics 2023-11-21 Sebastian Andres , Martin Slowik

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…

Probability · Mathematics 2012-10-05 Christophe Gallesco , Serguei Popov

Let $N$ and $M$ be positive integers satisfying $1\le M\le N$, and let $0<p_0<p_1<1$. Define a process $\{X_n\}_{n=0}^\infty$ on $\mathbb{Z}$ as follows. At each step, the process jumps either one step to the right or one step to the left,…

Probability · Mathematics 2014-02-11 Ross G. Pinsky

A particle moves randomly over the integer points of the real line. Jumps of the particle outside the membrane (a fixed "locally perturbating set") are i.i.d., have zero mean and finite variance, whereas jumps of the particle from the…

Probability · Mathematics 2015-04-28 Alexander Iksanov , Andrey Pilipenko

Hypergraph has been selected as a powerful candidate for characterizing higher-order networks and has received increasing attention in recent years. In this article, we study random walks with resetting on hypergraph by utilizing spectral…

Social and Information Networks · Computer Science 2025-05-08 Fei Ma , Xincheng Hu , Haobin Shi , Wei Pan , Ping Wang

We investigate the long-term behavior of a random walker evolving on top of the simple symmetric exclusion process (SSEP) at equilibrium, in dimension one. At each jump, the random walker is subject to a drift that depends on whether it is…

Probability · Mathematics 2020-10-28 Marcelo R. Hilário , Daniel Kious , Augusto Teixeira

In this paper we analyze the behavior of quantum random walks. In particular we present several new results for the absorption probabilities in systems with both one and two absorbing walls for the one-dimensional case. We compute these…

Quantum Physics · Physics 2007-05-23 Eric Bach , Susan Coppersmith , Marcel Paz Goldschen , Robert Joynt , John Watrous

In this paper, we study the mixing time of the simple exclusion process with $k$ particles in the line segment $[1, N]$ with conductances $c^{(N)}(x, x+1)_{1\le x<N}$ where $c^{(N)}(x, x+1)>0$ is the rate of swapping the contents of the two…

Probability · Mathematics 2024-09-26 Shangjie Yang

We study random walks on $\mathbb Z^d$ among random conductances $\{C_{xy}\colon x,y\in\mathbb Z^d\}$ that permit jumps of arbitrary length. Apart from joint ergodicity with respect to spatial shifts, we assume only that the…

Probability · Mathematics 2014-12-12 Marek Biskup , Takashi Kumagai

We obtain various new limit theorems for random walks on SL_2(C) under low moment conditions. For non-elementary measures with a finite second moment, we prove a Local Limit Theorem for the norm cocycle, yielding the optimal version of a…

Probability · Mathematics 2023-02-07 Tien-Cuong Dinh , Lucas Kaufmann , Hao Wu

We study a continuous time random walk X in an environment of dynamic random conductances. We assume that the conductances are stationary ergodic, uniformly bounded and bounded away from zero and polynomially mixing in space and time. We…

Probability · Mathematics 2014-03-31 Sebastian Andres

It is well known that the spectral gap of the down-up walk over an $n$-partite simplicial complex (also known as Glauber dynamics) cannot be better than $O(1/n)$ due to natural obstructions such as coboundaries. We study an alternative…

Discrete Mathematics · Computer Science 2026-05-13 Vedat Levi Alev , Ori Parzanchevski

Scaling laws for neural networks, in which the loss decays as a power-law in the number of parameters, data, and compute, depend fundamentally on the spectral structure of the data covariance, with power-law eigenvalue decay appearing…

Machine Learning · Statistics 2026-03-17 Elliot Paquette , Ke Liang Xiao , Yizhe Zhu

We study homogenization properties of the discrete Laplace operator with random conductances on a large domain in $\mathbb{Z}^d$. More precisely, we prove almost-sure homogenization of the discrete Poisson equation and of the top of the…

Probability · Mathematics 2018-06-05 Franziska Flegel , Martin Heida , Martin Slowik

We establish spectral theorems for random walks on mapping class groups of connected, closed, oriented, hyperbolic surfaces, and on $\text{Out}(F_N)$. In both cases, we relate the asymptotics of the stretching factor of the…

Group Theory · Mathematics 2020-07-20 François Dahmani , Camille Horbez

Let {X_n,n\geq0} be a Markov chain on a general state space X with transition probability P and stationary probability \pi. Suppose an additive component S_n takes values in the real line R and is adjoined to the chain such that…

Probability · Mathematics 2016-09-07 Cheng-Der Fuh

It is proved that the Green's function of the simple random walk on a surface group of large genus decays exponentially at the spectral radius. It is also shown that Ancona's inequalities extend to the spectral radius R, and therefore that…

Probability · Mathematics 2011-08-03 Steven P. Lalley

We study the random walk problem on a class of deterministic Scale-Free networks displaying a degree sequence for hubs scaling as a power law with an exponent $\gamma=\log 3/\log2$. We find exact results concerning different first-passage…

Statistical Mechanics · Physics 2013-05-29 Elena Agliari , Raffaella Burioni

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…

Probability · Mathematics 2013-04-10 Christophe Gallesco , Serguei Popov