Related papers: Increasing subsequences and the hard-to-soft edge …
Inter-relations between random matrix ensembles with different symmetry types provide inter-relations between generating functions for the gap probabilites at the spectrum edge. Combining these in the scaled limit with the exact evaluation…
The Hammersley process relates to the statistical properties of the maximum length of all up/right paths connecting random points of a given density in the unit square from (0,0) to (1,1). This process can also be interpreted in terms of…
Our interest is in the scaled joint distribution associated with $k$-increasing subsequences for random involutions with a prescribed number of fixed points. We proceed by specifying in terms of correlation functions the same distribution…
We study the distribution of the length of longest increasing subsequences in random permutations of $n$ integers as $n$ grows large and establish an asymptotic expansion in powers of $n^{-1/3}$. Whilst the limit law was already shown by…
Considered are the large $N$, or large intensity, forms of the distribution of the length of the longest increasing subsequences for various models. Earlier work has established that after centring and scaling, the limit laws for these…
Let $X$ be the number of $k$-term arithmetic progressions contained in the $p$-biased random subset of the first $N$ positive integers. We give asymptotically sharp estimates on the logarithmic upper-tail probability $\log \Pr(X \ge E[X] +…
Connections between longest increasing subsequences in random permutations and eigenvalues of random matrices with complex entries have been intensely studied. This note applies properties of random elements of the finite general linear…
For the orthogonal-unitary and symplectic-unitary transitions in random matrix theory, the general parameter dependent distribution between two sets of eigenvalues with two different parameter values can be expressed as a quaternion…
We study the distribution of the length of longest monotone subsequences in random (fixed-point free) involutions of $n$ integers as $n$ grows large, establishing asymptotic expansions in powers of $n^{-1/6}$ in the general case and in…
We consider the random connection model in which an edge between two Poisson points at distance $r$ is present with probability $g(r)$. We conduct an extreme value analysis on this model, namely by investigating the longest edge with at…
The gap probability generating function has as its coefficients the probability of an interval containing exactly $k$ eigenvalues. For scaled random matrices with orthogonal symmetry, and the interval at the hard or soft spectrum edge, the…
The object of study is a soft random geometric graph with vertices given by a Poisson point process on a line and edges between vertices present with probability that has a polynomial decay in the distance between them. Various aspects of…
We conclude our work [arXiv:2403.07628, arXiv:2503.12644] on asymptotic expansions at the soft edge for the classical $n$-dimensional Gaussian and Laguerre ensembles, now studying the gap-probability generating functions. We show that the…
The first paper in this series introduced a new approach to strong convergence of random matrices that is based primarily on soft arguments. This method was applied to achieve a refined qualitative and quantitative understanding of strong…
The local eigenvalue statistics of large random matrices near a hard edge transitioning into a soft edge are described by the Bessel process associated with a large parameter $\alpha$. For this point process, we obtain 1) exponential moment…
One method to generate random permutations involves using Gaussian elimination with partial pivoting (GEPP) on a random matrix $A$ and storing the permutation matrix factor $P$ from the resulting GEPP factorization $PA=LU$. We are…
We consider random graphs with uniformly bounded edges on a Poisson point process conditioned to contain the origin. In particular we focus on the random connection model, the Boolean model and Miller-Abrahams random resistor network with…
The theory of P\'olya ensembles of positive definite random matrices provides structural formulas for the corresponding biorthogonal pair, and correlation kernel, which are well suited to computing the hard edge large $N$ asymptotics. Such…
We establish the sharpness of the percolation phase transition for a class of infinite-range weighted random connection models. The vertex set is given by a marked Poisson point process on $\mathbb{R}^d$ with intensity $\lambda>0$, where…
We study probabilistic and combinatorial aspects of natural volume-and-trace weighted plane partitions and their continuous analogues. We prove asymptotic limit laws for the largest parts of these ensembles in terms of new and known hard-…