arXiv subjects
Publications and source records attributed to Boris Granovsky.
It is derived the explicit asymptotic expression in $n$ for the coefficient $c_n$ of the generating function for multiplicative structures with sub exponential rate of growth of $c_n,$ as $n\to\infty$.
In this paper we prove the necessity of the main sufficient condition of Meinardus for sub exponential rate of growth of the number of structures, having multiplicative generating functions of a general form and establish a new necessary and suffcient condition for normal local limit theorem for aforementioned structures. The latter result allows to encompass in our study structures with weights having gaps in their supports.
We prove that time dynamics of a stochastic process of pure coagulation is given by a time dependent Gibbs distribution if and only if rates of single coagulations have the form $ψ(i,j)=if(j)+jf(i)$, where $f$ is an arbitrary nonnegative function on the set of integers $\ge 1$. We also obtained a recurrence relation for weights of these Gibbs distributions, that allowed explicit solutions in three particular cases of the function $f$. For the three corresponding models, we study the probability of coagulation into one giant cluster, at time $t>0.$
Meinardus proved a general theorem about the asymptotics of the number of weighted partitions, when the Dirichlet generating function for weights has a single pole on the positive real axis. Continuing \cite{GSE}, we derive asymptotics for the numbers of three basic types of decomposable combinatorial structures (or, equivalently, ideal gas models in statistical mechanics) of size $n$, when their Dirichlet generating functions have multiple simple poles on the positive real axis. Examples to which our theorem applies include ones related to vector partitions and quantum field theory. Our asymptotic formula for the number of weighted partitions disproves the belief accepted in the physics literature that the main term in the asymptotics is determined by the rightmost pole.
We find limit shapes for a family of multiplicative measures on the set of partitions, induced by exponential generating functions with expansive parameters, $a_k\sim Ck^{p-1}, k\to\infty, p>0$,where $C$ is a positive constant. The measures considered are associated with reversible coagulation-fragmentation processes and certain combinatorial structures, known as assemblies. We prove the functional central limit theorem for the fluctuations of a scaled random partition from its limit shape. We demonstrate that when the component size passes beyond the threshold value, the independence of numbers of components transforms into their conditional independence. Among other things, the paper also discusses, in a general setting, the interplay between limit shapes, threshold and gelation.
We establish the central limit theorem for the number of groups at the equilibrium of a coagulation-fragmentation process given by a parameter function with polynomial rate of growth. The result obtained is compared with the one for random combinatorial structures obeying the logarithmic condition.
We develop a unified approach to the problem of clustering in the three different fields of applications, as indicated in the title the paper. The approach is based on Khintchine's probabilistic method that grew out of the Darwin-Fawler method in statistical physics. Our main result is the derivation of asymptotic formulae for probabilities of clusters (= groups) of certain sizes as the number of particles goes to infinity. Based on these formulae we prove the zero-one law for the distribution of the largest cluster and establish the threshold function in the phase transition from 0 to 1 in the above law.
We construct a probability model seemingly unrelated to the considered stochastic process of coagulation and fragmentation. By proving for this model the local limit theorem, we establish the asymptotic formula for the partition function of the equilibrium measure for a wide class of parameter functions of the process. This formula proves the conjecture stated in [dgg] for the above class of processes. The method used goes back to A.Khintchine.