中文
相关论文

相关论文: A multivariate extension of the Erd\"os-Taylor the…

200 篇论文

Let $(\Omega,\mathcal{F}, \mathbb{P})$ be a probability space and $E$ be a finite set. Assume that $X=(X_n)$ is an irreducible and aperiodic Markov chain, defined on $(\Omega,\mathcal{F}, \mathbb{P})$, with values in $E$ and with transition…

概率论 · 数学 2017-12-05 Yinna Ye

We consider the $N$-particle noncolliding Bernoulli random walk --- a discrete time Markov process in $\mathbb{Z}^{N}$ obtained from a collection of $N$ independent simple random walks with steps $\in\{0,1\}$ by conditioning that they never…

概率论 · 数学 2018-06-05 Vadim Gorin , Leonid Petrov

We study continuous-time (variable speed) random walks in random environments on $\mathbb{Z}^d$, $d\ge2$, where, at time $t$, the walk at $x$ jumps across edge $(x,y)$ at time-dependent rate $a_t(x,y)$. The rates, which we assume stationary…

概率论 · 数学 2020-01-06 Marek Biskup , Pierre-François Rodriguez

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…

数据结构与算法 · 计算机科学 2024-06-04 Vedat Levi Alev , Shravas Rao

We prove expectation and concentration results for the following random variables on an Erd\H{o}s-R\'enyi random graph $\mathcal{G}\left(n,p\right)$ in the sparsely connected regime $\log n + \log\log \log n \leq np < n^{1/10}$: effective…

组合数学 · 数学 2020-12-22 John Sylvester

The famous \emph{circular law} asserts that if $M_n$ is an $n \times n$ matrix with iid complex entries of mean zero and unit variance, then the empirical spectral distribution (ESD) of the normalized matrix $\frac{1}{\sqrt{n}} M_n$…

概率论 · 数学 2009-01-01 Terence Tao , Van Vu

We consider large deviations of the cover time of the discrete torus $(\mathbb{Z}/N\mathbb{Z})^d$, $d \geq 3$ by simple random walk. We prove a lower bound on the probability that the cover time is smaller than $\gamma\in (0,1)$ times its…

概率论 · 数学 2025-07-18 Xinyi Li , Jialu Shi , Qiheng Xu

Let $\tau = (\tau_i : i \in {\Bbb Z})$ denote i.i.d.~positive random variables with common distribution $F$ and (conditional on $\tau$) let $X = (X_t : t\geq0, X_0=0)$, be a continuous-time simple symmetric random walk on ${\Bbb Z}$ with…

概率论 · 数学 2007-05-23 L. R. G. Fontes , M. Isopi , C. M. Newman

Let $X$ be a random walk on the torus of side length $N$ in dimension $d\geq 3$ with uniform starting point, and $t_{\text{cov}}$ be the expected value of its cover time, which is the first time that $X$ has visited every vertex of the…

概率论 · 数学 2023-09-07 Alexis Prévost , Pierre-François Rodriguez , Perla Sousi

We study cumulants of numbers of $q$-step walks on Erd\"os-R\'enyi-type random graphs of long-range percolation radius model in the limit when the number of vertices $N$, concentration $c$, and the interaction radius $R$ tend to infinity.…

概率论 · 数学 2025-09-18 O. Khorunzhiy

We define two families of Poissonian soups of bidirectional trajectories on $\mathbb{Z}^2$, which can be seen to adequately describe the local picture of the trace left by a random walk on the two-dimensional torus $(\mathbb{Z}/N…

概率论 · 数学 2017-05-05 Pierre-François Rodriguez

A random flight on a plane with non-isotropic displacements at the moments of direction changes is considered. In the case of exponentially distributed flight lengths a Gaussian limit theorem is proved for the position of a particle in the…

概率论 · 数学 2017-04-10 Mark Kelbert , Enzo Orsingher

We consider a random walk on a homogeneous space $G/\Lambda$ where $G$ is $\mathrm{SO}(2,1)$ or $\mathrm{SO}(3,1)$ and $\Lambda$ is a lattice. The walk is driven by a probability measure $\mu$ on $G$ whose support generates a Zariski-dense…

动力系统 · 数学 2026-05-27 Timothée Bénard , Weikun He

We study a continuous-time random walk on $\mathbb{Z}^d$ in an environment of random conductances taking values in $(0,\infty)$. For a static environment, we extend the quenched local limit theorem to the case of a general speed measure,…

概率论 · 数学 2021-02-05 Sebastian Andres , Peter A. Taylor

We provide a deterministic $\tilde{O}(\log N)$-space algorithm for estimating random walk probabilities on undirected graphs, and more generally Eulerian directed graphs, to within inverse polynomial additive error…

计算复杂性 · 计算机科学 2022-03-14 AmirMahdi Ahmadinejad , Jonathan Kelner , Jack Murtagh , John Peebles , Aaron Sidford , Salil Vadhan

Given a natural number $n$, let $\omega\left(n\right)$ denote the number of distinct prime factors of $n$, let $Z$ denote a standard normal variable, and let $P_{n}$ denote the uniform distribution on $\left\{ 1,\ldots,n\right\} $. The…

数论 · 数学 2024-05-14 Matthew Levy , Joseph Squillace

We investigate the time averaged squared displacement (TASD) of continuous time random walks with respect to the number of steps $N$, which the random walker performed during the data acquisition time $T$. We prove that the TASD, and as…

统计力学 · 物理学 2017-02-15 Felix Thiel , Igor M. Sokolov

On a locally compact group $E$ with countable base, we consider a random walk $X$ that has a unique (up to a positive factor) $r$-invariant measure for some $r>0$. Under some weak conditions on the measure, there is a unique continuous…

概率论 · 数学 2015-11-10 M. G. Shur

We analyse the eigenvalues of Erd\"os--R\'enyi random bipartite graphs. In particular, we consider $p$ satisfying $n_{1}p=\Omega(\sqrt{n_{1}p}\log^{3}(n_{1})),$ $n_{2}p=\Omega(\sqrt{n_{2}p}\log^{3}(n_{2})),$ and let $G\sim…

组合数学 · 数学 2021-03-16 Calum J. Ashcroft

Consider a walk in the plane made of $n$ unit steps, with directions chosen independently and uniformly at random at each step. Rayleigh's theorem asserts that the probability for such a walk to end at a distance less than 1 from its…

组合数学 · 数学 2012-06-13 Olivier Bernardi