Related papers: Asymptotic Results of a Multiple-entry Reinforceme…
In this paper, we derive non-asymptotic achievability and converse bounds on the random number generation with/without side-information. Our bounds are efficiently computable in the sense that the computational complexity does not depend on…
We consider continuous-time Markov chains on integers which allow transitions to adjacent states only, with alternating rates. We give explicit formulas for probability generating functions, and also for means, variances and state…
We study the asymptotics of large, moderate and normal deviations for the connected components of the sparse random graph by the method of stochastic processes. We obtain the logarithmic asymptotics of large deviations of the joint…
The number partitioning problem can be interpreted physically in terms of a thermally isolated non-interacting Bose gas trapped in a one-dimensional harmonic oscillator potential. We exploit this analogy to characterize, by means of a…
A theorem of Meinardus provides asymptotics of the number of weighted partitions under certain assumptions on associated ordinary and Dirichlet generating functions. The ordinary generating functions are closely related to Euler's…
We establish asymptotic expansions for factorial moments of following distributions: number of cycles in a random permutation, number of inversions in a random permutation, and number of comparisons used by the randomized quick sort…
We consider the number of partitions of $n$ whose Young diagrams fit inside an $m \times \ell$ rectangle; equivalently, we study the coefficients of the $q$-binomial coefficient $\binom{m+\ell}{m}_q$. We obtain sharp asymptotics throughout…
Probabilistic graphical models are a key tool in machine learning applications. Computing the partition function, i.e., normalizing constant, is a fundamental task of statistical inference but it is generally computationally intractable,…
In this paper we study the asymptotic behaviour of weighted random sums when the sum process converges stably in law to a Brownian motion and the weight process has continuous trajectories, more regular than that of a Brownian motion. We…
Two new test statistics are introduced to test the null hypotheses that the sampling distribution has an increasing hazard rate on a specified interval [0,a]. These statistics are empirical L_1-type distances between the isotonic estimates,…
Point processes are finding growing applications in numerous fields, such as neuroscience, high frequency finance and social media. So classic problems of classification and clustering are of increasing interest. However, analytic study of…
In this paper, we consider the asymptotic properties of hook numbers of partitions in restricted classes. More specifically, we compare the frequency with which partitions into odd parts and partitions into distinct parts have hook numbers…
A Peskun ordering between two samplers, implying a dominance of one over the other, is known among the Markov chain Monte Carlo community for being a remarkably strong result. It is however also known for being a result that is notably…
Consider a balls-in-bins process in which each new ball goes into a given bin with probability proportional to f(n), where n is the number of balls currently in the bin and f is a fixed positive function. It is known that these so-called…
The sequence of so-called signature moments describes the laws of many stochastic processes in analogy with how the sequence of moments describes the laws of vector-valued random variables. However, even for vector-valued random variables,…
We consider a generalization of the so-called elephant random walk by introducing multiple elephants moving along the integer line, $\mathbb{Z}$. When taking a new step, each elephant considers not only its own previous steps but also the…
In this paper, we study the asymptotic behavior of supremum distribution of some classes of iterated stochastic processes $\{X(Y(t)) : t \in [0, \infty)\}$, where $\{X(t) : t \in \mathbb{R} \}$ is a centered Gaussian process and $\{Y(t): t…
Let A be a set of positive integers with gcd(A) = 1, and let p_A(n) be the partition function of A. Let c = \pi \sqrt(2/3). Let \alpha > 0. It is proved that log p_A(n) ~ c\sqrt(\alpha n) if and only if the set A has asymptotic density…
Computational complexity is examined using the principle of increasing entropy. To consider computation as a physical process from an initial instance to the final acceptance is motivated because many natural processes have been recognized…
We consider random integer partitions $\lambda$ that follow the Poissonized Plancherel measure of parameter $t^2$. Using Riemann$-$Hilbert techniques, we establish the asymptotics of the multiplicative averages $$Q(t,s)=\mathbb{E} \left[…