Related papers: Hitting time theorems for random matrices
We speculate on the distribution of primes in exponentially growing, linear recurrence sequences $(u_n)_{n\geq 0}$ in the integers. By tweaking a heuristic which is successfully used to predict the number of prime values of polynomials, we…
Brualdi and Ma found a connection between involutions of length $n$ with $k$ descents and symmetric $k\times k$ matrices with non-negative integer entries summing to $n$ and having no row or column of zeros. From their main theorem they…
The Bernoulli sieve is a random allocation scheme obtained by placing independent points with the uniform [0,1] law into the intervals made up by successive positions of a multiplicative random walk with factors taking values in the…
Let $T$ be an $n\times n$ random matrix, such that each diagonal entry $T_{i,i}$ is a continuous random variable, independent from all the other entries of $T$. Then for every $n\times n$ matrix $A$ and every $t\ge0$ $$…
Let $M_n$ be a random $n\times n$ matrix with i.i.d. $\text{Bernoulli}(1/2)$ entries. We show that for fixed $k\ge 1$, \[\lim_{n\to \infty}\frac{1}{n}\log_2\mathbb{P}[\text{corank }M_n\ge k] = -k.\]
We prove that for any $\lambda > 1$, fixed in advance, the permanent of an $n \times n$ complex matrix, where the absolute value of each diagonal entry is at least $\lambda$ times bigger than the sum of the absolute values of all other…
The authors present evidence for universality in numerical computations with random data. Given a (possibly stochastic) numerical algorithm with random input data, the time (or number of iterations) to convergence (within a given tolerance)…
In this note, we compute the probability that a $k\times n$ matrix can be extended to an $n\times n$ invertible matrix over $\F_q[x]$, which turns out to be $(1-q^{k-n})(1-q^{k-1-n})...(1-q^{1-n})$. Connections with Dirichlet's density…
We consider the joint distribution of real and imaginary parts of eigenvalues of random matrices with independent entries with mean zero and unit variance. We prove the convergence of this distribution to the uniform distribution on the…
We consider a random object that is associated with both random walks and random media, specifically, the superposition of a configuration of subcritical Bernoulli percolation on an infinite connected graph and the trace of the simple…
In this work we study the set of eventually always hitting points in shrinking target systems. These are points whose long orbit segments eventually hit the corresponding shrinking targets for all future times. We focus our attention on…
We revisit the moment method to obtain a slightly strengthened version of the usual semicircular law. Our version assumes only that the upper triangular entries of Hermitian random matrices are independent, have mean zero and variances…
Inspired by a recent paper of I. Grama, E. Le Page and M. Peign\'e, we consider a sequence $(g_n)_{n \geq 1}$ of i.i.d. random $d\times d$-matrices with non-negative entries and study the fluctuations of the process $(\log \vert g_n\cdots…
We consider the symmetric exclusion process {\eta_t,t>0} on {0,1}^{Z^d}. We fix a pattern A:={\eta:\sum_{\Lambda}\eta(i)\ge k}, where \Lambda is a finite subset of Z^d and k is an integer, and we consider the problem of establishing sharp…
We develop a framework for establishing the Law of Large Numbers for the eigenvalues in the random matrix ensembles as the size of the matrix goes to infinity simultaneously with the beta (inverse temperature) parameter going to zero. Our…
A central problem in Binary Hypothesis Testing (BHT) is to determine the optimal tradeoff between the Type I error (referred to as false alarm) and Type II (referred to as miss) error. In this context, the exponential rate of convergence of…
For fixed $m>1$, we consider $m$ independent $n \times n$ non-Hermitian random matrices $X_1, ..., X_m$ with i.i.d. centered entries with a finite $(2+\eta)$-th moment, $ \eta>0.$ As $n$ tends to infinity, we show that the empirical…
What is the connection of random matrices with integrable systems? Is this connection really useful? The answer to these questions leads to a new and unifying approach to the theory of random matrices. Introducing an appropriate time…
For fixed $m > 1$, we study the product of $m$ independent $N \times N$ elliptic random matrices as $N$ tends to infinity. Our main result shows that the empirical spectral distribution of the product converges, with probability $1$, to the…
We consider a continuous-time Markov chain with a finite or countable state space. For a site y and subset H of the state space, the hitting time of y under taboo H is defined to be infinite if the process trajectory hits H before y, and…