Related papers: Characterization of exchangeable measure-valued P\…
The Random Permutation Set (RPS) is a new type of set proposed recently, which can be regarded as the generalization of evidence theory. To measure the uncertainty of RPS, the entropy of RPS and its corresponding maximum entropy have been…
The random self-reinforcement mechanism, characterized by the principle of ``the rich get richer'', has demonstrated significant utility across various domains. One prominent model embodying this mechanism is the random reinforcement urn…
We consider weighted negatively reinforced urn schemes with finitely many colours. An urn scheme is called negatively reinforced, if the selection probability for a colour is proportional to the weight $w$ of the colour proportion, where…
P\'{o}lya urn is a stochastic process in which balls are randomly drawn from an urn of red and blue balls, and balls of the same color as the drawn balls are added. The probability of a ball of a certain color being drawn is equal to the…
We propose a method of detecting a phase transition in a generalized P\'olya urn in an information cascade experiment. The method is based on the asymptotic behavior of the correlation $C(t)$ between the first subject's choice and the…
Finite mixture models are statistical models which appear in many problems in statistics and machine learning. In such models it is assumed that data are drawn from random probability measures, called mixture components, which are…
We show that for a large class of marked point processes there exists a random measure m with the predictable representation property such that iterated integrals with respect to m span the space of square integrable random variables.
Random permutation set (RPS), as a recently proposed theory, enables powerful information representation by traversing all possible permutations. However, the repetition of items is not allowed in RPS while it is quite common in real life.…
Let $(\mathbf{W,W'})$ be an exchangeable pair of vectors in $\mathbb{R}^k$. Suppose this pair satisfies \beas E(\mathbf{W}'|\mathbf{W})=(I_k-\Lambda)\mathbf{W}+\mathbf{R(W)}. \enas If $||\mathbf{W-W'}||_2\le K$ and $\mathbf{R(W)}=0$, then…
Determinantal point processes (DPPs) have become a significant tool for recommendation systems, feature selection, or summary extraction, harnessing the intrinsic ability of these probabilistic models to facilitate sample diversity. The…
The Dirichlet process mixture model and more general mixtures based on discrete random probability measures have been shown to be flexible and accurate models for density estimation and clustering. The goal of this paper is to illustrate…
We study a P\'olya-type urn model defined as follows. Start at time 0 with a single ball of some colour. Then, at each time n>0, choose a ball from the urn uniformly at random. With probability 1/2<p<1, return the ball to the urn along with…
We introduce a general two colour interacting urn model on a finite directed graph, where each urn at a node, reinforces all the urns in its out-neighbours according to a fixed, non-negative and balanced reinforcement matrix. We show that…
Many popular Bayesian nonparametric priors can be characterized in terms of exchangeable species sampling sequences. However, in some applications, exchangeability may not be appropriate. We introduce a {novel and probabilistically coherent…
An evolving Riemannian manifold $(M,g_t)_{t\in I}$ consists of a smooth $d$-dimensional manifold $M$, equipped with a geometric flow $g_t$ of complete Riemannian metrics, parametrized by $I=(-\infty,T)$. Given an additional $C^{1,1}$ family…
We consider systems of interacting Generalized Friedman's Urns (GFUs) having irreducible mean replacement matrices. The interaction is modeled through the probability to sample the colors from each urn, that is defined as convex combination…
Partially exchangeable sequences representable as mixtures of Markov chains are completely specified by de Finetti's mixing measure. The paper characterizes, in terms of a subclass of hidden Markov models, the partially exchangeable…
In this work we generalize Polya urn schemes with possibly infinitely many colors and extend the earlier models described in [4, 5, 7]. We provide a novel and unique approach of representing the observed sequence of colors in terms a…
Predictive constructions are a powerful way of characterizing the probability law of stochastic processes with certain forms of invariance, such as exchangeability or Markov exchangeability. When de Finetti-like representation theorems are…
In this article, we introduce classes of functions whose increment is controlled by the measure of a ball containing the corresponding points and a nonnegative function p(.) that is summable with respect to measure. These classes of…