Related papers: Asymptotic Results of a Multiple-entry Reinforceme…
The intrinsic volumes induced by a stationary Poisson k-flat process inside a compact and convex sampling window are considered. Using techniques from stochastic analysis, more precisely calculus with multiple stochastic integrals and a…
This paper develops a deeper understanding of the structure and combinatorial significance of the partition function for Hermitian random matrices. The coefficients of the large N expansion of the logarithm of this partition function,also…
We introduce the notion of asymptotic partition regularity for Diophantine equations. We show how this notion is at the core of almost all known negative results in the Ramsey theory of equations, and we use it to produce new ones, as in…
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…
We give an asymptotic estimate for the number of partitions of a set of $n$ elements, whose block sizes avoid a given set $\mathcal{S}$ of natural numbers. As an application, we derive an estimate for the number of partitions of a set with…
The past two decades have seen a revolution in statistical physics, generalizing it to apply to systems of arbitrary size, evolving while arbitrarily far from equilibrium. Many of these new results are based on analyzing the dynamics of the…
We show that several general classes of stochastic processes satisfy a functional co-monotony principle, including processes with independent increments, Brownian diffusions, Liouville processes. As a first application, we recover some…
The treatment of the number-theoretical problem of integer partitions within the approach of statistical mechanics is discussed. Historical overview is given and known asymptotic results for linear and plane partitions are reproduced. From…
Consider a finite undirected graph and place an urn with balls of two colours at each vertex. At every discrete time step, for each urn, a fixed number of balls are drawn from that same urn with probability $p$, and from a randomly chosen…
In a previous paper: A. Paszkiewicz, T. Sobieszek, Additive Entropies of Partitions, we have given a description of additive partition entropies that is real functions $I$ on the set of finite partitions that are additive on stochastically…
Randomization tests are based on a re-randomization of existing data to gain data-dependent critical values that lead to exact hypothesis tests under special circumstances. However, it is not always possible to re-randomize data in…
Graded posets frequently arise throughout combinatorics, where it is natural to try to count the number of elements of a fixed rank. These counting problems are often $\#\textbf{P}$-complete, so we consider approximation algorithms for…
We study combinatorial and asymptotic properties of the rank of strongly unimodal sequences. We find a generating function for the rank enumeration function, and give a new combinatorial interpretation of the ospt-function introduced by…
In this paper we introduce a general stochastic representation for an important class of processes with resetting. It allows to describe any stochastic process intermittently terminated and restarted from a predefined random or non-random…
It is shown the almost sure convergence and asymptotical normality of a generalization of Kesten's stochastic approximation algorithm for multidimensional case. In this generalization, the step increases or decreases if the scalar product…
Continuous determinantal point processes (DPPs) are a class of repulsive point processes on $\mathbb{R}^d$ with many statistical applications. Although an explicit expression of their density is known, it is too complicated to be used…
We discuss a complementary asymptotic analysis of the so called minimal random walk. More precisely, we present a version of the almost sure central limit theorem as well as a generalization of the recently proposed quadratic strong laws.…
Bringmann, Mahlburg, and Rhoades have found asymptotic expressions for all moments of the partition statistics rank and crank. In this work we extend their methods to higher ranks. The $T$-rank, introduced by Garvan, for odd integers T=3 is…
We consider a model of random tree growth, where at each time unit a new vertex is added and attached to an already existing vertex chosen at random. The probability with which a vertex with degree $k$ is chosen is proportional to $w(k)$,…
In time series analysis, statistics based on collections of estimators computed from sub-samples play a crucial role in an increasing variety of important applications. Proving results about the joint asymptotic distribution of such…