相关论文: Random Matrices, the Ulam Problem, Directed Polyme…
We have obtained the universal conductance distribution of two-dimensional disordered systems in the strongly localized limit. This distribution is directly related to the Tracy-Widom distribution, which has recently appeared in many…
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…
We compute the limiting distributions of the lengths of the longest monotone subsequences of random (signed) involutions with or without conditions on the number of fixed points (and negated points) as the sizes of the involutions tend to…
In these lecture we explain why limiting distribution function, like the Tracy-Widom distribution, or limit processes, like the Airy_2 process, arise both in random matrices and interacting particle systems. The link is through a common…
We study numerically the distributions of the length $L$ of the longest increasing subsequence (LIS) for the two cases of random permutations and of one-dimensional random walks. Using sophisticated large-deviation algorithms, we are able…
The minimum linear arrangement problem on a network consists of finding the minimum sum of edge lengths that can be achieved when the vertices are arranged linearly. Although there are algorithms to solve this problem on trees in polynomial…
Let $A$ and $B$ be independent, central Wishart matrices in $p$ variables with common covariance and having $m$ and $n$ degrees of freedom, respectively. The distribution of the largest eigenvalue of $(A+B)^{-1}B$ has numerous applications…
Universality of eigenvalue spacings is one of the basic characteristics of random matrices. We give the precise meaning of universality and discuss the standard universality classes (sine, Airy, Bessel) and their appearance in unitary,…
We study the longest increasing subsequence problem for random permutations avoiding the pattern $312$ and another pattern $\tau$ under the uniform probability distribution. We determine the exact and asymptotic formulas for the average…
A central question in random matrix theory is universality. When an emergent phenomena is observed from a large collection of chosen random variables it is natural to ask if this behavior is specific to the chosen random variable or if the…
Given $\pi \in S_n$, let $Z_{n,k}(\pi)=\sum_{1\leq i_1<\dots<i_k\leq n} \mathbf{1}(\{ \pi_{i_1}<\dots<\pi_{i_k}\}$ denote the number of increasing subsequences of length $k$. Consider the "generalized Ulam problem," studying the…
We define a class of random matrix ensembles that pertain to random looped polymers. Such random looped polymers are a possible model for bio-polymers such as chromatin in the cell nucleus. It is shown that the distribution of the largest…
In the last decade there has been increasing interest in the fields of random matrices, interacting particle systems, stochastic growth models, and the connections between these areas. For instance, several objects appearing in the limit of…
The link between a particular class of growth processes and random matrices was established in the now famous 1999 article of Baik, Deift, and Johansson on the length of the longest increasing subsequence of a random permutation. During the…
Linear regression is a classical paradigm in statistics. A new look at it is provided via the lens of universal learning. In applying universal learning to linear regression the hypotheses class represents the label $y\in {\cal R}$ as a…
This book is about solving matrix nearness problems that are related to eigenvalues or singular values or pseudospectra. These problems arise in great diversity in various fields, be they related to dynamics, as in questions of robust…
These lecture notes on 2D growth processes are divided in two parts. The first part is a non-technical introduction to stochastic Loewner evolutions (SLEs). Their relationship with 2D critical interfaces is illustrated using numerical…
In this paper, we study a high-dimensional random matrix model from nonparametric statistics called the Kendall rank correlation matrix, which is a natural multivariate extension of the Kendall rank correlation coefficient. We establish the…
We present algorithms for length-constrained maximum sum segment and maximum density segment problems, in particular, and the problem of finding length-constrained heaviest segments, in general, for a sequence of real numbers. Given a…
We study the statistics of the largest eigenvalue lambda_max of N x N random matrices with unit variance, but power-law distributed entries, P(M_{ij})~ |M_{ij}|^{-1-mu}. When mu > 4, lambda_max converges to 2 with Tracy-Widom fluctuations…