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

Time-homogeneous Markov chains are often used as disease progression models in studies of cost-effectiveness and optimal decision-making. Maximum likelihood estimation of these models can be challenging when data are collected at a time…

A possibly time-dependent transition intensity matrix or generator $(Q(t))$ characterizes the law of a Markov jump process (MP). For a time homogeneous MP, the transition probability matrix (TPM) can be expressed as a matrix exponential of…

Let $M_n$ be the number of steps of the loop-erasure of a simple random walk on $\mathbb{Z}^2$ from the origin to the circle of radius $n$. We relate the moments of $M_n$ to $Es(n)$, the probability that a random walk and an independent…

The Gap-Hamming-Distance problem arose in the context of proving space lower bounds for a number of key problems in the data stream model. In this problem, Alice and Bob have to decide whether the Hamming distance between their $n$-bit…

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…

Let $M_n$ be an $n$ by $n$ random matrix where each entry is +1 or -1 independently with probability 1/2. Our main result implies that the probability that $M_n$ is singular is at most $(1/\sqrt{2} + o(1))^n$, improving on the previous best…

We study the asymptotic hitting time $\tau^{(n)}$ of a family of Markov processes $X^{(n)}$ to a target set $G^{(n)}$ when the process starts from a trap defined by very general properties. We give an explicit description of the law of…

We report further findings on the size distribution of the largest neutral segments in a sequence of N randomly charged monomers [D. Ertas and Y. Kantor, Phys. Rev. E53, 846 (1996); cond-mat/9507005]. Upon mapping to one--dimensional random…

Let $M$ be an $n\times n$ random matrix with entries in $\{0, 1\}$, where each row is independently and uniformly sampled from the set of all vectors in $\{0, 1\}^n$ containing exactly $d$ ones, with $d=pn$ for some fixed constant $p\in…

We present a new statistical test to detect that a presented state of a reversible Markov chain was not chosen from a stationary distribution. In particular, given a value function for the states of the Markov chain, we would like to…

We study the lower tail behavior of the least singular value of an $n\times n$ random matrix $M_n := M+N_n$, where $M$ is a fixed complex matrix with operator norm at most $\exp(n^{c})$ and $N_n$ is a random matrix, each of whose entries is…

A new model that maps a quantum random walk described by a Hadamard operator to a particular case of a random walk is presented. The model is represented by a Markov chain with a stochastic matrix, i.e., all the transition rates are…

Let $(Z_n)_{n\geq 0}$ be a critical branching process in a random environment defined by a Markov chain $(X_n)_{n\geq 0}$ with values in a finite state space $\mathbb X$. Let $ S_n = \sum_{k=1}^n \ln f_{X_k}'(1)$ be the Markov walk…

We propose to study unitary matrix ensembles defined in terms of unitary stochastic transition matrices associated with Markov processes on graphs. We argue that the spectral statistics of such an ensemble (after ensemble averaging) depends…

We study the normalized trace $g_n(z)=n^{-1} \mbox{tr} \, (H-zI)^{-1}$ of the resolvent of $n\times n$ real symmetric matrices $H=\big[(1+\delta_{jk})W_{jk}/\sqrt n\big]_{j,k=1}^n$ assuming that their entries are independent but not…

Pick $N$ random points $U_1,\cdots,U_{N}$ independently and uniformly in a triangle ABC with area 1, and take the convex hull of the set $\{A,B,U_1,\cdots,U_{N}\}$. The boundary of this convex hull is a convex chain $V_0=B,V_1,\cdots,$…

The Latent Block Model (LBM) is a model-based method to cluster simultaneously the $d$ columns and $n$ rows of a data matrix. Parameter estimation in LBM is a difficult and multifaceted problem. Although various estimation strategies have…

Let $(\tau_x)_{x \in \Z^d}$ be i.i.d. random variables with heavy (polynomial) tails. Given $a \in [0,1]$, we consider the Markov process defined by the jump rates $\omega_{x \to y} = {\tau_x}^{-(1-a)} {\tau_y}^a$ between two neighbours $x$…

Suppose the edges of the complete graph on $n$ vertices are assigned a uniformly chosen random ordering. Let $X$ denote the corresponding number of Hamiltonian paths that are increasing in this ordering. It was shown in a recent paper by…

We study the joint occurrence of large values of a Markov random field or undirected graphical model associated to a block graph. On such graphs, containing trees as special cases, we aim to generalize recent results for extremes of Markov…