English
Related papers

Related papers: Asymptotic enumeration and logical limit laws for …

200 papers

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…

Machine Learning · Statistics 2020-04-20 Lama B. Niyazi , Abla Kammoun , Hayssam Dahrouj , Mohamed-Slim Alouini , Tareq Y. Al-Naffouri

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…

Probability · Mathematics 2009-05-27 Saidbek S. Mirakhmedov , Sherzod M. Mirakhmedov

Mappings of a finite set into itself with restriction on the cycle lengths are considered (the so-called A-mappings). Asymptotics is given for the number of these mappings with a power-law reduction of the remainder.

Combinatorics · Mathematics 2023-11-28 A. L. Yakymiv

We develop a new method for studying the asymptotics of symmetric polynomials of representation-theoretic origin as the number of variables tends to infinity. Several applications of our method are presented: We prove a number of theorems…

Representation Theory · Mathematics 2015-12-22 Vadim Gorin , Greta Panova

A finite set is "hidden" if its elements are not directly enumerable or if its size cannot be ascertained via a deterministic query. In public health, epidemiology, demography, ecology and intelligence analysis, researchers have developed a…

Statistics Theory · Mathematics 2019-10-17 Si Cheng , Daniel J. Eck , Forrest W. Crawford

We obtain an asymptotic formula with a power-saving error term for counting the integer points $(a,b,c,d)$ in an expanding box $[-X,X]^4$ that satisfy the determinant equation $x_1x_2-x_3x_4=r$ for $r \neq 0$ with two of entries to be…

Number Theory · Mathematics 2024-12-23 Rachita Guria

S.Janson [Poset limits and exchangeable random posets, Combinatorica 31 (2011), 529--563] defined limits of finite posets in parallel to the emerging theory of limits of dense graphs. We prove that each poset limit can be represented as a…

Combinatorics · Mathematics 2013-11-05 Jan Hladky , Andras Mathe , Viresh Patel , Oleg Pikhurko

We study asymptotic behaviour of stochastic approximation procedures with three main characteristics: truncations with random moving bounds, a matrix valued random step-size sequence, and a dynamically changing random regression function.…

Statistics Theory · Mathematics 2016-11-22 Teo Sharia , Lei Zhong

We study asymptotics of representations of the unitary groups U(n) in the limit as n tends to infinity and we show that in many aspects they behave like large random matrices. In particular, we prove that the highest weight of a random…

Representation Theory · Mathematics 2013-07-16 Benoit Collîns , Piotr Śniady

A deterministic sequence of real numbers in the unit interval is called \emph{equidistributed} if its empirical distribution converges to the uniform distribution. Furthermore, the limit distribution of the pair correlation statistics of a…

Number Theory · Mathematics 2016-12-19 Christoph Aistleitner , Thomas Lachmann , Florian Pausinger

The coefficient sequences of multivariate rational functions appear in many areas of combinatorics. Their diagonal coefficient sequences enjoy nice arithmetic and asymptotic properties, and the field of analytic combinatorics in several…

Symbolic Computation · Computer Science 2020-11-19 Stephen Melczer , Bruno Salvy

We extend a general result showing that the asymptotic behavior of high moments, factorial or standard, of random variables, determines the asymptotically normality, from the one dimensional to the multidimensional setting. This approach…

Probability · Mathematics 2023-12-08 Pawel HItczenko , Nick Wormald

We analyze the asymptotic behavior of sequences of random variables defined by an initial condition, a stationary and ergodic sequence of random matrices, and an induction formula involving multiplication is the so-called max-plus algebra.…

Probability · Mathematics 2008-03-12 Glenn Merlet

Linear models with a growing number of parameters have been widely used in modern statistics. One important problem about this kind of model is the variable selection issue. Bayesian approaches, which provide a stochastic search of…

Statistics Theory · Mathematics 2012-02-03 Zuofeng Shang , Murray K. Clayton

Asymptotic expansions are given for large values of $n$ of the generalized Bessel polynomials $Y_n^\mu(z)$. The analysis is based on integrals that follow from the generating functions of the polynomials. A new simple expansion is given…

Classical Analysis and ODEs · Mathematics 2011-01-26 José Luis López , Nico M. Temme

We consider self-loops and multiple edges in the configuration model as the size of the graph tends to infinity. The interest in these random variables is due to the fact that the configuration model, conditioned on being simple, is a…

Probability · Mathematics 2017-02-06 Omer Angel , Remco van der Hofstad , Cecilia Holmgren

In this work we show that the prime distribution is deterministic. Indeed the set of prime numbers P can be expressed in terms of two subsets of N using three specific selection rules, acting on two sets of prime candidates. The prime…

General Mathematics · Mathematics 2007-09-12 Gerardo Iovane

Asymptotic expansions are derived for associated Legendre functions of degree $\nu$ and order $\mu$, where one or the other of the parameters is large. The expansions are uniformly valid for unbounded real and complex values of the argument…

Classical Analysis and ODEs · Mathematics 2025-07-04 T. M. Dunster

A set $S\subset\{1,2,...,n\}$ is called a Sidon set if all the sums $a+b~~(a,b\in S)$ are different. Let $S_n$ be the largest cardinality of the Sidon sets in $\{1,2,...,n\}$. In a former article, the author proved the following asymptotic…

Number Theory · Mathematics 2022-05-04 Yuchen Ding

We show that the biggest possible average set size in the complement $2^{\{1,2,\ldots, n\}} \setminus A$ of a union-closed family $A \subset 2^{\{1,2, \ldots, n\}}$ is $\tfrac{n+1}{2}$. With the same proof we get a sharp upper bound for the…

Combinatorics · Mathematics 2020-05-04 Luca Studer