Related papers: Asymptotics of certain coagulation-fragmentation p…
We study probability measures induced by set functions with constraints. Such measures arise in a variety of real-world settings, where prior knowledge, resource limitations, or other pragmatic considerations impose constraints. We consider…
Given a c\`adl\`ag process $X$ on a filtered measurable space, we construct a version of its semimartingale characteristics which is measurable with respect to the underlying probability law. More precisely, let $\mathfrak{P}_{sem}$ be the…
This paper proposes a new type of recurrence where we divide the Markov chains into intervals that start when the chain enters into a subset A, then sample another subset B far away from A and end when the chain again return to A. The…
In this article we extend the coupling method from classical probability theory to quantum Markov chains on atomic von Neumann algebras. In particular, we establish a coupling inequality, which allow us to estimate convergence rates by…
We use a Poisson point process approach to prove distributional convergence to a stable law for non square-integrable observables $\phi: [0,1]\to R$, mostly of the form $\phi (x) = d(x,x_0)^{-\frac{1}{\alpha}}$,$0<\alpha\le 2$, on…
Aggregation patterns are often visually detected in sets of location data. These clusters may be the result of interesting dynamics or the effect of pure randomness. We build an asymptotically Gaussian test for the hypothesis of randomness…
We introduce a nonparametric model for inferring time-evolving, unobserved probability distributions from discrete-time data consisting of unlabelled partitions. The latent process is a two-parameter Poisson-Dirichlet diffusion, and…
In this paper, we develop simple, yet efficient, procedures for sampling approximations of the two-Parameter Poisson-Dirichlet Process and the normalized inverse-Gaussian process. We compare the efficiency of the new approximations to the…
Slice sampling is an efficient Markov Chain Monte Carlo algorithm to sample from an unnormalized density with acceptance ratio always $1$. However, when the variable to sample is unbounded, its "stepping-out" heuristic works only locally,…
We study some special classes of piecewise continuous maps on a finite smooth partition of a compact manifold and look for invariant measures for such maps. We show that in the simplest one-dimensional case (so-called interval translation…
About two dozens of exactly solvable Markov chains on one-dimensional finite and semi-infinite integer lattices are constructed in terms of convolutions of orthogonality measures of the Krawtchouk, Hahn, Meixner, Charlier, $q$-Hahn,…
In this work, we develop a comparison procedure for the Modified log-Sobolev Inequality (MLSI) constants of two reversible Markov chains on a finite state space. Efficient comparison of the MLSI Dirichlet forms is a well known obstacle in…
We develop a new tool, the time inhomogeneous Poisson equation in the whole space and with a terminal condition at infinity, to study the asymptotic behavior of the non-autonomous multi-scale stochastic system with irregular coefficients,…
This paper deals with three major types of convergence of probability measures on metric spaces: weak convergence, setwise converges, and convergence in the total variation. First, it describes and compares necessary and sufficient…
We study a 2-parametric family of probability measures on an infinite-dimensional simplex (the Thoma simplex). These measures originate in harmonic analysis on the infinite symmetric group (S.Kerov, G.Olshanski and A.Vershik, Comptes Rendus…
In this article, we close a gap in the literature by proving existence of invariant measures for reflected SPDEs with only one reflecting barrier. This is done by arguing that the sequence (u(t, .)) is tight in the space of probability…
For a class of piecewise deterministic Markov processes, the supports of the invariant measures are characterized. This is based on the analysis of controllability properties of an associated deterministic control system. Its invariant…
The present paper originated from our previous study of the problem of harmonic analysis on the infinite symmetric group. This problem leads to a family {P_z} of probability measures, the z-measures, which depend on the complex parameter z.…
Mostof the existing literature on supervised machine learning problems focuses on the case when the training data set is drawn from an i.i.d. sample. However, many practical problems are characterized by temporal dependence and strong…
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…