Related papers: Some numerical and algorithmical probelms in the a…

The angular bispectrum of spherical random fields has recently gained an enormous importance, especially in connection with statistical inference on cosmological data. In this paper, we provide expressions for its moments of arbitrary order…

For any n>3, we give a family of finite dimensional irreducible representations of the braid group B_n. Moreover, we give a subfamily parametrized by 0<m<n of dimension the combinatoric number (n,m). The representation obtained in the case…

We provide a complete asymptotic distribution theory for clustered data with a large number of independent groups, generalizing the classic laws of large numbers, uniform laws, central limit theory, and clustered covariance matrix…

The aim of the present paper is to obtain a classification of all the irreducible modular representations of the symmetric group on $n$ letters of dimension at most $n^3$, including dimension formulae. This is achieved by improving an idea,…

We determine precisely when the branching coefficients arising from the restriction of irreducible representations of the symmetric group $S_n$ to the dihedral subgroup $D_n$ are nonzero, and we establish uniform linear lower bounds outside…

$O(N)$ invariants are the observables of real tensor models. We use regular colored graphs to represent these invariants, the valence of the vertices of the graphs relates to the tensor rank. We enumerate $O(N)$ invariants as $d$-regular…

Given a random word of size $n$ whose letters are drawn independently from an ordered alphabet of size $m$, the fluctuations of the shape of the random RSK Young tableaux are investigated, when $n$ and $m$ converge together to infinity. If…

Phylogenetic models have polynomial parametrization maps. For symmetric group-based models, Matsen studied the polynomial inequalities that characterize the joint probabilities in the image of these parametrizations. We employ this…

Asymptotic statistical theory for estimating functions is reviewed in a generality suitable for stochastic processes. Conditions concerning existence of a consistent estimator, uniqueness, rate of convergence, and the asymptotic…

Stochastic gradient algorithms are more and more studied since they can deal efficiently and online with large samples in high dimensional spaces. In this paper, we first establish a Central Limit Theorem for these estimates as well as for…

Motivated by real-world machine learning applications, we analyze approximations to the non-asymptotic fundamental limits of statistical classification. In the binary version of this problem, given two training sequences generated according…

Hypergraphs are structures that can be decomposed or described; in other words they are recursively countable. Here, we get exact and asymptotic enumeration results on hypergraphs by means of exponential generating functions. The number of…

We study enumeration functions for unimodal sequences of positive integers, where the size of a sequence is the sum of its terms. We survey known results for a number of natural variants of unimodal sequences, including Auluck's generalized…

Let $G$ be a compact Lie group, $N\geq 1$ and $L>0$. The random geometric graph on $G$ is the random graph $\Gamma(N,L)$ whose vertices are $N$ random points $g_1,\ldots,g_N$ chosen under the Haar measure of $G$, and whose edges are the…

A statistic can be a function of multiple samples. There is little existing work on asymptotic theory for such statistics when group membership is random. We propose a flexible framework that can handle both deterministic and random…

After a quick review of the representation theory of the symmetric group, we give an exposition of the tools brought about by the so-called half-infinite wedge representation of the infinite symmetric group. We show how these can be applied…

We compute the whole asymptotic expansion of the probability that a large uniform labeled graph is connected, and of the probability that a large uniform labeled tournament is irreducible. In both cases, we provide a combinatorial…

In a recent work on the bipartite Erd\H{o}s-R\'{e}nyi graph, Do et al. (2023) established upper bounds on the number of connected labeled bipartite graphs with a fixed surplus. We use some recent encodings of bipartite random graphs in…

The purpose of this paper is to investigate the global categorical symmetries that arise when gauging finite higher groups in three or more dimensions. The motivation is to provide a common perspective on constructions of non-invertible…

In this work we are considering the behavior of the limit shape of Young diagrams associated to random permutations on the set $\{1,\dots,n\}$ under a particular class of multiplicative measures. Our method is based on generating functions…