Related papers: Moment Generating Stirling Numbers and Application…
In this paper we provide a unified combinatorial approach to establish a connection between Stirling permutations, cycle structures of permutations and perfect matchings. The main tool of our investigations is MY-sequences. In particular,…
A new family of fractional counting processes based on a three-parameter generalized Mittag-Leffler function was introduced and studied. As applications we develop a fractional generalized compound process, introduce and develop fractional…
We introduce the $B$-Stirling numbers of the first and second kind, which are the coefficients of the potential polynomials when we express them in terms of the monomials and the falling factorials, respectively. These numbers include, as…
A random recursive cell splitting scheme of the $2$-dimensional unit sphere is considered, which is the spherical analogue of the STIT tessellation process from Euclidean stochastic geometry. First-order moments are computed for a large…
We compute the stationary distribution of a continuous-time Markov chain which is constructed by gluing together two finite, irreducible Markov chains by identifying a pair of states of one chain with a pair of states of the other and…
The paper deals with a certain class of random evolutions. We develop a construction that yields an invariant measure for a continuous-time Markov process with random transitions. The approach is based on a particular way of constructing…
We study three classes of combinatorial sums involving central binomial coefficients and harmonic numbers, odd harmonic numbers, and even indexed harmonic numbers, respectively. In each case we use summation by parts to derive recursive…
We study Stirling permutations defined by Gessel and Stanley. We prove that their generating function according to the number of descents has real roots only. We use that fact to prove that the distribution of these descents, and other,…
The impact of the third (skewness) and fourth (kurtosis) reduced centered moments on the statistical modeling of E1 lines in complex atomic spectra is investigated through the use of Gram-Charlier, Normal Inverse Gaussian and Generalized…
The distribution of the spectral numbers of an isolated hypersurface singularity is studied in terms of the Bernoulli moments. These are certain rational linear combinations of the higher moments of the spectral numbers. They are related to…
We use generalized beta integrals to construct examples of Markov processes with linear regressions, and quadratic second conditional moments.
Score-based generative models (SGMs) are generative models that are in the spotlight these days. Time-series frequently occurs in our daily life, e.g., stock data, climate data, and so on. Especially, time-series forecasting and…
In this paper we consider the problem of computing the stationary distribution of nearly completely decomposable Markov processes, a well-established area in the classical theory of Markov processes with broad applications in the design,…
In a random model of minimum cost bipartite matching based on exponentially distributed edge costs, we show that the distribution of the cost of the optimal solution can be computed efficiently. The distribution is represented by its moment…
Let $W$ be a random positive definite symmetric matrix distributed according to a real Wishart distribution and let $W^{-1}=(W^{ij})_{i,j}$ be its inverse matrix. We compute general moments $\mathbb{E} [W^{k_1 k_2} W^{k_3 k_4} ...…
The optimizations of the track fittings require complex simulations of silicon strip detectors to be compliant with the fundamental properties of the hit heteroscedasticity. Many different generations of random numbers must be available…
We consider the fluctuations of a time-integrated particle current around an atypical value in a generic stochastic Markov process involving classical particles with two-site interaction and hardcore repulsion on a finite one-dimensional…
We consider a general class of branching processes in discrete time, where particles have types belonging to a Polish space and reproduce independently according to their type. If the process is critical and the mean distribution of types…
Markov chains have long been used for generating random variates from spatial point processes. Broadly speaking, these chains fall into two categories: Metropolis-Hastings type chains running in discrete time and spatial birth-death chains…
We consider the combinatorial problem where $p$ players aim to a complete set of $N$ different types of items (species) which are uniformly distributed. Let the random variables $T_{N(i)},\,\,i=1,2,\cdots,p$ denoting the number of trials…