相关论文: Asymptotic Enumeration and Limit Laws for Multiset…

We study minimum energy configurations of $N$ particles in $\R^3$ of charge -1 (`electrons') in the potential of $M$ particles of charges $Z_\alpha>0$ (`atomic nuclei'). In a suitable large-N limit, we determine the asymptotic electron…

In contrast to conventional (single-label) classification, the setting of multilabel classification (MLC) allows an instance to belong to several classes simultaneously. Thus, instead of selecting a single class label, predictions take the…

The objective of the paper is to study accuracy of multi-class classification in high-dimensional setting, where the number of classes is also large ("large $L$, large $p$, small $n$" model). While this problem arises in many practical…

For a class of random partitions of an infinite set a de Finetti-type representation is derived, and in one special case a central limit theorem for the number of blocks is shown.

For positive integers $n$ and $m$, consider a multiset of non-empty subsets of $[m]$ such that there is a \textit{unique} partition of these subsets into $n$ partitions of $[m]$. We study the maximum possible size $g(n,m)$ of such a…

Generalised linear models for multi-class classification problems are one of the fundamental building blocks of modern machine learning tasks. In this manuscript, we characterise the learning of a mixture of $K$ Gaussians with generic means…

We show that limsup sets generated by a sequence of open sets in compact Ahlfors $s$-regular space $(X,\mathscr{B},\mu,\rho)$ belong to the classes of sets with large intersections with index $\lambda$, denoted by…

We consider arbitrary graphs $G$ with $n$ vertices and minimum degree at least $\delta n$ where $\delta>0$ is constant. If the conductance of $G$ is sufficiently large then we obtain an asymptotic expression for the cover time $C_G$ of $G$…

In the random geometric graph $G(n,r_n)$, $n$ vertices are placed randomly in Euclidean $d$-space and edges are added between any pair of vertices distant at most $r_n$ from each other. We establish strong laws of large numbers (LLNs) for a…

A set ${\cal A} \subseteq \Set{1,...,N}$ is of type $B_2$ if all sums $a+b$, with $a\ge b$, $a,b\in {\cal A}$, are distinct. It is well known that the largest such set is of size asymptotic to $N^{1/2}$. For a $B_2$ set ${\cal A}$ of this…

Consider a sample of size $N$ from a population governed by a hierarchical species sampling model. We study the large $N$ asymptotic behavior of the number ${\bf K}_N$ of clusters and the number ${\bf M}_{r,N}$ of clusters with frequency…

The problem to express a natural number N as a product of natural numbers without regard to order corresponds to a thermally isolated non-interacting Bose gas in a one-dimensional potential with logarithmic energy eigenvalues. This…

Our work studies the enumeration and random generation of unlabeled combinatorial classes of unrooted graphs. While the technique of vertex pointing provides a straightforward procedure for analyzing a labeled class of unrooted graphs by…

We examine the following version of a classic combinatorial search problem introduced by R\'enyi: Given a finite set $X$ of $n$ elements we want to identify an unknown subset $Y \subset X$ of exactly $d$ elements by testing, by as few as…

We study the largest component of a random (multi)graph on n vertices with a given degree sequence. We let n tend to infinity. Then, under some regularity conditions on the degree sequences, we give conditions on the asymptotic shape of the…

In Bayesian nonparametric inference, random discrete probability measures are commonly used as priors within hierarchical mixture models for density estimation and for inference on the clustering of the data. Recently, it has been shown…

We present a combinatorial approach to the infinitesimal distribution of the Gaussian orthogonal ensemble (GOE). In particular we show how the infinitesimal moments are described by non-crossing partitions, but not of type B. We demonstrate…

We consider a linear mixed-effects model with a clustered structure, where the parameters are estimated using maximum likelihood (ML) based on possibly unbalanced data. Inference with this model is typically done based on asymptotic theory,…

A composition of a nonnegative integer (n) is a sequence of positive integers whose sum is (n). A composition is palindromic if it is unchanged when its terms are read in reverse order. We provide a generating function for the number of…

The notion of containment and avoidance provides a natural partial ordering on set partitions. Work of Sagan and of Goyt has led to enumerative results in avoidance classes of set partitions, which were refined by Dahlberg et al. through…