Related papers: Asymptotic Normality and Concentration Inequalitie…

In this note, we prove a central limit theorem for smooth linear statistics of zeros of random polynomials which are linear combinations of orthogonal polynomials with iid standard complex Gaussian coefficients. Along the way, we obtain…

Discrepancy measures between probability distributions, often termed statistical distances, are ubiquitous in probability theory, statistics and machine learning. To combat the curse of dimensionality when estimating these distances from…

We study the convergence in distribution norms in the Central Limit Theorem for non identical distributed random variables that is $$ \varepsilon_{n}(f):={\mathbb{E}}\Big(f\Big(\frac 1{\sqrt…

We present a solution to a problem suggested by Philippe Biane: We prove that a certain Plancherel-type probability distribution on partitions converges, as partitions get large, to a new determinantal random point process on the set…

Inspired by Armin Straub's conjecture (arXiv:1601.07161) about the number and maximal size of (2n+1, 2n+3)-core partitions with distinct parts, we develop relatively efficient, symbolic-computational algorithms, based on non-linear…

We consider the asymptotics of the Plancherel measures on partitions of $n$ as $n$ goes to infinity. We prove that the local structure of a Plancherel typical partition (which we identify with a Young diagram) in the middle of the limit…

We explore the asymptotic behavior of the centroids of random polygons constructed from regular polygons with vertices on the unit circle by extending the rays so that their lengths form a random permutation of the first (n) integers.…

We determine the joint limiting distribution of adjacent spacings around a central, intermediate, or an extreme order statistic $X_{k:n}$ of a random sample of size $n$ from a continuous distribution $F$. For central and intermediate cases,…

For fixed s, the size of an (s, s+1)-core partition with distinct parts can be seen as a random variable X_s. Using computer-assisted methods, we derive formulas for the expectation, variance, and higher moments of X_s. Our results give…

We consider simultaneous $(s,s+t,s+2t,\dots,s+pt)$-core partitions in the large-$p$ limit, or (when $s<t$), partitions in which no hook may be of length $s \pmod{t}$. We study generating functions, containment properties, and congruences…

We study random skew 3D partitions weighted by $q^{\textup{vol}}$ and, specifically, the $q\to 1$ asymptotics of local correlations near various points of the limit shape. We obtain sine-kernel asymptotics for correlations in the bulk of…

For an integer $n\geq1$, consider a random partition $\Pi_{n}$ of $\{1,\ldots,n\}$ into $K_{n}$ partition sets with $K_{r,n}$ partition subsets of size $r=1,\ldots,n$, and assume $\Pi_{n}$ distributed according to the Ewens-Pitman model…

An integer partition is called graphical if it is the degree sequence of a simple graph. We prove that the probability that a uniformly chosen partition of size $n$ is graphical decreases to zero faster than $n^{-.003}$, answering a…

We consider Gaussian random monochromatic waves $u$ on the plane depending on a real parameter $s$ that is directly related to the regularity of its Fourier transform. Specifically, the Fourier transform of $u$ is $f\,d\sigma$, where…

We study a configuration model on bipartite planar maps in which, given $n$ even integers, one samples a planar map with $n$ faces uniformly at random with these face degrees. We prove that when suitably rescaled, such maps always admit…

We study the distribution of several statistics of large non-crossing partitions. First, we prove the Gaussian limit theorem for the number of blocks of a given fixed size. In contrast to the properties of usual set partitions, we show that…

We study the asymptotics of large, moderate and normal deviations for the connected components of the sparse random graph by the method of stochastic processes. We obtain the logarithmic asymptotics of large deviations of the joint…

We design and mathematically analyze sampling-based algorithms for regularized loss minimization problems that are implementable in popular computational models for large data, in which the access to the data is restricted in some way. Our…

For non-negative integers $(d_n(k))_{k \ge 1}$ such that $\sum_{k \ge 1} d_n(k) = n$, we sample a bipartite planar map with $n$ faces uniformly at random amongst those which have $d_n(k)$ faces of degree $2k$ for every $k \ge 1$ and we…

We consider covariance asymptotics for linear statistics of general stationary random measures in terms of their truncated pair correlation measure. We give exact infinite series-expansion formulas for covariance of smooth statistics of…