English
Related papers

Related papers: Spectral norm bounds for block Markov chain random…

200 papers

We equip the polytope of $n\times n$ Markov matrices with the normalized trace of the Lebesgue measure of $\mathbb{R}^{n^2}$. This probability space provides random Markov matrices, with i.i.d. rows following the Dirichlet distribution of…

Probability · Mathematics 2010-06-16 Djalil Chafai

The dynamics of a point particle in a periodic array of spherical scatterers converges, in the limit of small scatterer size, to a random flight process, whose paths are piecewise linear curves generated by a Markov process with memory two.…

Mathematical Physics · Physics 2010-08-25 Jens Marklof , Andreas Strömbergsson

Given $X$ a random vector in ${\mathbb{R}}^n$, set $X_1,...,X_N$ to be independent copies of $X$ and let $\Gamma=\frac{1}{\sqrt{N}}\sum_{i=1}^N <X_i,\cdot>e_i$ be the matrix whose rows are $\frac{X_1}{\sqrt{N}},\dots, \frac{X_N}{\sqrt{N}}$.…

Probability · Mathematics 2013-12-13 Vladimir Koltchinskii , Shahar Mendelson

Starting from any graph on $\{1, \ldots, n\}$, consider the Markov chain where at each time-step a uniformly chosen vertex is disconnected from all of its neighbors and reconnected to another uniformly chosen vertex. This Markov chain has a…

Probability · Mathematics 2021-09-09 François Bienvenu , Jean-Jil Duchamps , Félix Foutel-Rodier

Consider a Markov chain $(X_n)_{n\geqslant 0}$ with values in the state space $\mathbb X$. Let $f$ be a real function on $\mathbb X$ and set $S_0=0,$ $S_n = f(X_1)+\cdots + f(X_n),$ $n\geqslant 1$. Let $\mathbb P_x$ be the probability…

Probability · Mathematics 2016-07-28 Ion Grama , Ronan Lauvergnat , Émile Le Page

The objective of this paper is the study of the equilibrium behavior of a population on the hierarchical group $\Omega_N$ consisting of families of individuals undergoing critical branching random walk and in addition these families also…

Probability · Mathematics 2007-05-23 D. A. Dawson , L. G. Gorostiza , A. Wakolbinger

Filtration, flow in narrow channels and traffic flow are examples of processes subject to blocking when the channel conveying the particles becomes too crowded. If the blockage is temporary, which means that after a finite time the channel…

Statistical Mechanics · Physics 2018-08-01 G. Page , J. Resing , P. Viot , J. Talbot

We study the problem of clustering $T$ trajectories of length $H$, each generated by one of K unknown ergodic Markov chains over a finite state space of size $S$. We derive an instance-dependent, high-probability lower bound on the…

Machine Learning · Statistics 2026-03-18 Junghyun Lee , Yassir Jedra , Alexandre Proutière , Se-Young Yun

It is well known that the distribution of simple random walks on $\bf{Z}$ conditioned on returning to the origin after $2n$ steps does not depend on $p= P(S_1 = 1)$, the probability of moving to the right. Moreover, conditioned on…

Probability · Mathematics 2010-06-21 Nina Gantert , Jonathon Peterson

Let $G(n,\, M)$ be the uniform random graph with $n$ vertices and $M$ edges. Let $B_n$ be the maximum block-size of $G(n,\, M)$ or the maximum size of its maximal $2$-connected induced subgraphs. We determine the expectation of $B_n$ near…

Discrete Mathematics · Computer Science 2016-05-17 Vonjy Rasendrahasina , Andry Rasoanaivo , Vlady Ravelomanana

How fast a state of a system converges to a stationary state is one of the fundamental questions in science. Some Markov chains and random walks on finite groups are known to exhibit the non-asymptotic convergence to a stationary…

Quantum Physics · Physics 2024-02-01 Sangchul Oh , Sabre Kais

Consider $M_n$ the maximal position at generation $n$ of a supercritical branching random walk. A\"id\'ekon (2013) obtained and described the convergence in law, as time $n$ goes to infinity, of $M_n-m_n$, where $m_n$ is an explicit…

Probability · Mathematics 2026-01-14 Louis Chataignier , Lianghui Luo

We consider a branching random walk on $\mathbb{R}$ with a stationary and ergodic environment $\xi=(\xi_n)$ indexed by time $n\in\mathbb{N}$. Let $Z_n$ be the counting measure of particles of generation $n$. For the case where the…

Probability · Mathematics 2014-07-30 Chunmao Huang , Quansheng Liu

In this paper, we derive non-asymptotic achievability and converse bounds on the random number generation with/without side-information. Our bounds are efficiently computable in the sense that the computational complexity does not depend on…

Information Theory · Computer Science 2016-09-28 Masahito Hayashi , Shun Watanabe

We study the spectral fluctuations of the $^{208}$Pb nucleus using the complete experimental spectrum of 151 states up to excitation energies of $6.20$ MeV recently identified at the Maier-Leibnitz-Laboratorium at Garching, Germany. For…

Nuclear Theory · Physics 2017-01-25 L. Muñoz , R. A. Molina , J. M. G. Gómez , A. Heusler

We investigate concentration properties of spectral measures of Hermitian random matrices with partially dependent entries. More precisely, let $X_n$ be a Hermitian random matrix of size $n\times n$ that can be split into independent blocks…

Probability · Mathematics 2020-07-31 Bartłomiej Polaczyk

In this paper, we develop a general law of large numbers and central limit theorem for cumulative reward processes associated with finite state Markov jump processes with non-stationary transition rates. Such models commonly arise in…

Probability · Mathematics 2025-10-15 Monte Fischer , Peter W. Glynn

Let $X_1,X_2,...$ be a sequence of random variables satisfying the distributional recursion $X_1=0$ and $X_n= X_{n-I_n}+1$ for $n=2,3,...$, where $I_n$ is a random variable with values in $\{1,...,n-1\}$ which is independent of…

Probability · Mathematics 2007-11-01 Alex Iksanov , Martin Möhle

This paper considers continuous-time block-monotone Markov chains (BMMCs) and their block-augmented truncations. We first introduce the block monotonicity and block-wise dominance relation for continuous-time Markov chains, and then provide…

Probability · Mathematics 2016-11-22 Hiroyuki Masuyama

Let $\a$ be a complex random variable with mean zero and bounded variance $\sigma^{2}$. Let $N_{n}$ be a random matrix of order $n$ with entries being i.i.d. copies of $\a$. Let $\lambda_{1}, ..., \lambda_{n}$ be the eigenvalues of…

Probability · Mathematics 2008-02-29 Terence Tao , Van Vu