Related papers: Limit Theorems for Longest Monotone Subsequences i…
In this paper we develop tools for studying limit theorems by means of convexity. We establish bounds for the discrepancy in total variation between probability measures $\mu$ and $\nu$ such that $\nu$ is log-concave with respect to $\mu$.…
We study the fluctuations, in the large deviations regime, of the longest increasing subsequence of a random i.i.d. sample on the unit square. In particular, our results yield the precise upper and lower exponential tails for the length of…
We study the length of cycles in the model of spatial random permutations in Euclidean space. In this model, for given length $L$, density $\rho$, dimension $d$ and jump density $\varphi$, one samples $\rho L^d$ particles in a…
In applications such as rank aggregation, mixture models for permutations are frequently used when the population exhibits heterogeneity. In this work, we study the widely used Mallows mixture model. In the high-dimensional setting, we…
We show that the convolution of a compactly supported measure on $\mathbb{R}$ with a Gaussian measure satisfies a logarithmic Sobolev inequality (LSI). We use this result to give a new proof of a classical result in random matrix theory…
The soliton resolution conjecture for the focusing nonlinear Schrodinger equation (NLS) is the vaguely worded claim that a global solution of the NLS, for generic initial data, will eventually resolve into a radiation component that…
We consider the distributions of the lengths of the longest monotone and alternating subsequences in classes of permutations of size $n$ that avoid a specific pattern or set of patterns, with respect to the uniform distribution on each such…
Let $S_n$ denote the set of permutations of $[n]$ and let $\sigma=\sigma_1\cdots\sigma_n\in S_n$. For a subsequence $\{\sigma_{i_j}\}_{j=1}^k$ of $\{\sigma_i\}_{i=1}^n$ of length $k\ge2$, construct the ``up/down'' sequence $V_1\cdots…
Extremization of the Boltzmann-Gibbs (BG) entropy under appropriate norm and width constraints yields the Gaussian distribution. Also, the basic solutions of the standard Fokker-Planck (FP) equation (related to the Langevin equation with…
Given a sequence of $n$ real numbers $\{S_i\}_{i\leq n}$, we consider the longest weakly increasing subsequence, namely $i_1<i_2<\dots <i_L$ with $S_{i_k} \leq S_{i_{k+1}}$ and $L$ maximal. When the elements $S_i$ are i.i.d. uniform random…
In this paper, we study for the first time the Diverse Longest Common Subsequences (LCSs) problem under Hamming distance. Given a set of a constant number of input strings, the problem asks to decide if there exists some subset $\mathcal X$…
Consider the Gaussian sequence model under the additional assumption that a fixed fraction of the means is known. We study the problem of variance estimation from a frequentist Bayesian perspective. The maximum likelihood estimator (MLE)…
We analyze the problem of maximum likelihood estimation for Gaussian distributions that are multivariate totally positive of order two (MTP2). By exploiting connections to phylogenetics and single-linkage clustering, we give a simple proof…
We investigate the asymptotic properties of permutations drawn from the Luce model, a natural probabilistic framework in which permutations are generated sequentially by sampling without replacement, with selection probabilities…
We study the rate of convergence of the Mallows distance between the empirical distribution of a sample and the underlying population. The surprising feature of our results is that the convergence rate is slower in the discrete case than in…
The intrinsic dimensionality of an inverse problem is affected by prior information, the accuracy and number of observations, and the smoothing properties of the forward operator. From a Bayesian perspective, changes from the prior to the…
We consider the distributions of the lengths of the longest weakly increasing and strongly decreasing subsequences in words of length N from an alphabet of k letters. We find Toeplitz determinant representations for the exponential…
We study minimization of a parametric family of relative entropies, termed relative $\alpha$-entropies (denoted $\mathscr{I}_{\alpha}(P,Q)$). These arise as redundancies under mismatched compression when cumulants of compressed lengths are…
This paper shows that the normalized maximum likelihood~(NML) code-length calculated in [1] is an upper bound on the NML code-length strictly calculated for the Gaussian Mixture Model. When we use this upper bound on the NML code-length, we…
The stochastic properties of variables whose addition leads to $q$-Gaussian distributions $G_q(x)=[1+(q-1)x^2]_+^{1/(1-q)}$ (with $q\in\mathbb{R}$ and where $[f(x)]_+=max\{f(x),0\}$) as limit law for a large number of terms are…