Related papers: Asymptotic Normality and Concentration Inequalitie…
We prove the conjectured limiting normality for the number of crossings of a uniformly chosen set partition of [n] = {1,2,...,n}. The arguments use a novel stochastic representation and are also used to prove central limit theorems for the…
A tremendous amount of research has been done in the last two decades on $(s,t)$-core partitions when $s$ and $t$ are positive integers with no common divisor. Here we change perspective slightly and explore properties of $(s,t)$-core and…
We establish the universal edge scaling limit of random partitions with the infinite-parameter distribution called the Schur measure. We explore the asymptotic behavior of the wave function, which is a building block of the corresponding…
We investigate the long-time behavior of a $d-$dimensional supercritical branching Brownian motion with a compactly supported branching potential. It is known that, for $\mathbf{v}\in \mathbb{R}^d$, all the moments of the normalized number…
Absence of level repulsion between extended states in random non-Hermitian systems is demonstrated. As a result, the general Wigner-Dyson distributions of level spacing of diffusive metals in the usual Hermitian systems is replaced by the…
Several issues in machine learning and inverse problems require to generate discrete data, as if sampled from a model probability distribution. A common way to do so relies on the construction of a uniform probability distribution over a…
In this paper, we study the asymptotic behaviour of plane partitions distributed according to a $q^{\text{Volume}}$-weighted Muttalib--Borodin ensemble and its associated discrete point process. We establish a Large Deviation Principle for…
Anderson established a connection between core partitions and order ideals of certain posets by mapping a partition to its $\beta$-set. In this paper, we give a characterization of the poset $P_{(s,s+1,s+2)}$ whose order ideals correspond…
Motivated by small bandwidth asymptotics for kernel-based semiparametric estimators in econometrics, this paper establishes Gaussian approximation results for high-dimensional fixed-order $U$-statistics whose kernels depend on the sample…
Stochastic approximation (SA) is a method for finding the root of an operator perturbed by noise. There is a rich literature establishing the asymptotic normality of rescaled SA iterates under fairly mild conditions. However, these…
We consider random partitions of the vertex set of a given finite graph that can be sampled by means of loop-erased random walks stopped at a random exponential time of parameter $q>0$. The related random blocks tend to cluster nodes…
We prove a new class of inequalities, yielding bounds for the normal approximation in the Wasserstein and the Kolmogorov distance of functionals of a general Poisson process (Poisson random measure). Our approach is based on an iteration of…
Recently, He and Owen (2016) proposed the use of Hilbert's space filling curve (HSFC) in numerical integration as a way of reducing the dimension from $d>1$ to $d=1$. This paper studies the asymptotic normality of the HSFC-based estimate…
A partition of $n$ is called a $t$-core partition if none of its hook number is divisible by $t.$ In 2019, Hirschhorn and Sellers \cite{Hirs2019} obtained a parity result for $3$-core partition function $a_3(n)$. Recently, both authors…
In this short note, we extend the celebrated results of Tao and Vu, and Krishnapur on the universality of empirical spectral distributions to a wide class of inhomogeneous complex random matrices, by showing that a technical and…
Zador's celebrated theorem is a cornerstone of optimal quantisation, establishing both the weak limit of the empirical distribution of an $n$-point optimal quantiser in $R^d$ and the decay rate of the associated $L_s$-mean quantisation…
We study generating functions which count the sizes of $t$-cores of partitions, and, more generally, the sizes of higher rows in $t$-core towers. We then use these results to derive an asymptotic for the average size of the $t$-defect of…
This paper records some apparently new results for the partition of integer intervals [1, n] into weakly sum-free subsets. These were produced using a method closely related to that used by Schur in 1917. New lower bounds can be produced in…
We study the problem of assortative and disassortative partitions on random $d$-regular graphs. Nodes in the graph are partitioned into two non-empty groups. In the assortative partition every node requires at least $H$ of their neighbors…
We explain a "curious symmetry" for maximal $(s-1,s+1)$-core partitions first observed by T. Amdeberhan and E. Leven. Specifically, using the $s$-abacus, we show such partitions have empty $s$-core and that their $s$-quotient is comprised…