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

Sumsets are central objects in additive combinatorics. In 2007, Granville asked whether one can efficiently recognize whether a given set $S$ is a sumset, i.e. whether there is a set $A$ such that $A+A=S$. Granville suggested an algorithm…

In this paper, we derive the asymptotic distribution of the number of copies of a fixed graph $H$ in a random graph $G_n$ sampled from a sparse graphon model. Specifically, we provide a refined analysis that separates the contributions of…

Assembly theory (AT) quantifies selection using the assembly equation and identifies complex objects that occur in abundance based on two measurements, assembly index and copy number, where the assembly index is the minimum number of…

Genuine multipartite nonlocality (GMN), the strongest form of multipartite nonlocality that describes fully collective nonlocal correlations among all experimental parties, can be observed when different distant parties each locally measure…

We consider a scheme of equiprobable allocation of particles into cells by sets. The Edgeworth type asymptotic expansion in the local central limit theorem for a number of empty cells left after allocation of all sets of particles is…

The investigation asymptotic limits on associated data mainly focused on limit theorems of summands of associated data and on the related invariance principles. In a series of papers, we are going to set the general frame of the theory by…

We compute the leading asymptotics as $N\to\infty$ of the maximum of the field $Q_N(q)= \log\det|q- A_N|$, $q\in \mathbb{C}$, for any unitarily invariant Hermitian random matrix $A_N$ associated to a non-critical real-analytic potential.…

In this thesis, we investigate the asymptotics of random partitions chosen according to probability measures coming from the representation theory of the symmetric groups $S_n$ and of the finite Chevalley groups $GL(n,F_q)$ and…

We present the concept of the \emph{information efficiency of functions} as a technique to understand the interaction between information and computation. Based on these results we identify a new class of objects that we call…

Gibbs-type exchangeable random partitions, which is a class of multiplicative measures on the set of positive integer partitions, appear in various contexts, including Bayesian statistics, random combinatorial structures, and stochastic…

Beiglboeck, Bergelson and Fish proved that if subsets A,B of a countable discrete amenable group G have positive Banach densities a and b respectively, then the product set AB is piecewise syndetic, i.e. there exists k such that the union…

Quasi-set theory is a first order theory without identity, which allows us to cope with non-individuals in a sense. A weaker equivalence relation called ``indistinguishability'' is an extension of identity in the sense that if $x$ is…

The omega limit sets plays a fundamental role to construct global attractors for topological semi-dynamical systems with continuous time or discrete time. Therefore, it is important to know when omega limit sets become nonempty compact…

Let $F$ and $G$ be integer polynomials where $F$ has degree at least $2$. Define the sequence $(a_n)$ by $a_n=F(a_{n-1})$ for all $n\ge 1$ and $a_0=0.$ Let $\mathscr{B}_{F,\,G,\,k}$ be the set of all positive integers $n$ such that $k\mid…

We prove that for every number k each countable infinite group $G$ admits a partition $G=A\cup B$ into two sets which are $k$-meager in the sense that for every $k$-element subset $K\subset G$ the sets $KA$ and $KB$ are not thick. The proof…

Datasets from the fields of bioinformatics, chemometrics, and face recognition are typically characterized by small samples of high-dimensional data. Among the many variants of linear discriminant analysis that have been proposed in order…

Given a class $\mathcal G$ of graphs, let ${\mathcal G}_n$ denote the set of graphs in $\mathcal G$ on vertex set $[n]$. For certain classes $\mathcal G$, we are interested in the asymptotic behaviour of a random graph $R_n$ sampled…

Representation theory of finite groups portrays a marvelous crossroad of group theory, algebraic combinatorics, and probability. In particular the Plancherel measure is a probability that arises naturally from representation theory, and in…

We extend recent results on the Asymptotic Equipartition Property for the density of $n$ particles in $\beta$-ensembles, as $n$ tends to infinity. We prove the Large Deviation Principle of the log-density for a general potential and the…

Multifractal analysis of multiplicative random cascades is revisited within the framework of {\em mixed asymptotics}. In this new framework, statistics are estimated over a sample which size increases as the resolution scale (or the…