相关论文: Random Matrices, the Ulam Problem, Directed Polyme…

We compute exactly the asymptotic distribution of scaled height in a (1+1)--dimensional anisotropic ballistic deposition model by mapping it to the Ulam problem of finding the longest nondecreasing subsequence in a random sequence of…

During last two decades it has been discovered that the statistical properties of a number of microscopically rather different random systems at the macroscopic level are described by {\it the same} universal probability distribution…

For one-dimensional growth processes we consider the distribution of the height above a given point of the substrate and study its scale invariance in the limit of large times. We argue that for self-similar growth from a single seed the…

This paper is concerned with certain connections between the ensemble of n x n unitary matrices -- specifically the characteristic function of the random variable tr(U) -- and combinatorics -- specifically Ulam's problem concerning the…

We consider a variant of the continuous and discrete Ulam-Hammersley problems: we study the maximal length of an increasing path through a Poisson point process (or a Bernoulli point process) with the restriction that there must be minimal…

We study a family of distributions that arise in critical unitary random matrix ensembles. They are expressed as Fredholm determinants and describe the limiting distribution of the largest eigenvalue when the dimension of the random…

We are interested in the statistics of the length of the longest increasing subsequence of 2-rowed lexicographically sorted arrays chosen according to distinct families of distributions D = (D_n)_n, and when n goes to infinity. This…

In random matrix theory (RMT), the Tracy-Widom (TW) distribution describes the behavior of the largest eigenvalue. We consider here two models in which TW undergoes transformations. In the first one disorder is introduced in the Gaussian…

We review some applications of central limit theorems and extreme values statistics in the context of disordered systems. We discuss several problems, in particular concerning Random Matrix Theory and the generalisation of the Tracy-Widom…

Selecting N random points in a unit square corresponds to selecting a random permutation. By putting 5 types of symmetry restrictions on the points, we obtain subsets of permutations : involutions, signed permutations and signed…

Finding analytically the statistics of the longest common subsequence (LCS) of a pair of random sequences drawn from c alphabets is a challenging problem in computational evolutionary biology. We present exact asymptotic results for the…

We consider increasingly complex models of matrix denoising and dictionary learning in the Bayes-optimal setting, in the challenging regime where the matrices to infer have a rank growing linearly with the system size. This is in contrast…

A pangenome captures the genetic diversity across multiple individuals simultaneously, providing a more comprehensive reference for genome analysis than a single linear genome, which may introduce allele bias. A widely adopted pangenome…

We address the following question: When a randomly chosen regular bipartite multi--graph is drawn in the plane in the ``standard way'', what is the distribution of its maximum size planar matching (set of non--crossing disjoint edges) and…

The Longest Common Subsequence (LCS) Problem asks for the longest sequence of (non-contiguous) matches between two given strings of characters. Using extensive Monte Carlo simulations, we find a finite size scaling law of the form E(L)/N =C…

The authors consider the length, $l_N$, of the length of the longest increasing subsequence of a random permutation of $N$ numbers. The main result in this paper is a proof that the distribution function for $l_N$, suitably centered and…

Let $(X_i)_{i \geq 1}$ and $(Y_i)_{i\geq1}$ be two independent sequences of independent identically distributed random variables taking their values in a common finite alphabet and having the same law. Let $LC_n$ be the length of the…

This in an introduction to random matrix theory, giving an impression of some of the most important aspects of this modern subject. In particular, it covers the basic combinatorial and analytic theory around Wigner's semicircle law,…

Consider the random matrix obtained from the adjacency matrix of a random d-regular graph by multiplying every entry by a random sign. The largest eigenvalue converges, after proper scaling, to the Tracy--Widom distribution.

Hammersley's Last-Passage Percolation (LPP), also known as Ulam's problem, is a well-studied model that can be described as follows: consider $m$ points chosen uniformly and independently in $[0,1]^2$, then what is the maximal number…