English
Related papers

Related papers: Characterization of exchangeable measure-valued P\…

200 papers

Adaptive randomly reinforced urn (ARRU) is a two-color urn model where the updating process is defined by a sequence of non-negative random vectors $\{(D_{1,n}, D_{2,n});n\geq1\}$ and randomly evolving thresholds which utilize accruing…

Probability · Mathematics 2019-09-27 Giacomo Aletti , Andrea Ghiglietti , Anand Vidyashankar

The models surveyed include generalized P\'{o}lya urns, reinforced random walks, interacting urn models, and continuous reinforced processes. Emphasis is on methods and results, with sketches provided of some proofs. Applications are…

Probability · Mathematics 2007-05-23 Robin Pemantle

Sum-Product Networks (SPNs) are expressive probabilistic models that provide exact, tractable inference. They achieve this efficiency by making use of local independence. On the other hand, mixtures of exchangeable variable models (MEVMs)…

Machine Learning · Computer Science 2022-04-29 Stefan Lüdtke , Christian Bartelt , Heiner Stuckenschmidt

The aim of this paper is to study the asymptotic behavior of strongly reinforced interacting urns with partial memory sharing. The reinforcement mechanism considered is as follows: draw at each step and for each urn a white or black ball…

Probability · Mathematics 2012-01-10 Mickaël Launay

Generalized P\'olya urns with non-linear feedback are an established probabilistic model to describe the dynamics of growth processes with reinforcement, a generic example being competition of agents in evolving markets. It is well known…

Probability · Mathematics 2025-01-07 Thomas Gottfried , Stefan Grosskinsky

We consider predictive inference using a class of temporally dependent Dirichlet processes driven by Fleming--Viot diffusions, which have a natural bearing in Bayesian nonparametrics and lend the resulting family of random probability…

Methodology · Statistics 2020-01-28 Filippo Ascolani , Antonio Lijoi , Matteo Ruggiero

It is well known that in a small P\'olya urn, i.e., an urn where second largest real part of an eigenvalue is at most half the largest eigenvalue, the distribution of the numbers of balls of different colours in the urn is asymptotically…

Probability · Mathematics 2026-01-14 Svante Janson

A random vector $X=(X_1,\ldots,X_n)$ with the $X_i$ taking values in an arbitrary measurable space $(S, \mathscr{S})$ is exchangeable if its law is the same as that of $(X_{\sigma(1)}, \ldots, X_{\sigma(n)})$ for any permutation $\sigma$.…

Probability · Mathematics 2016-03-21 Svante Janson , Takis Konstantopoulos , Linglong Yuan

The mixture of Dirichlet process (MDP) defines a flexible prior distribution on the space of probability measures. This study shows that ordinary least-squares (OLS) estimator, as a functional of the MDP posterior distribution, has…

Methodology · Statistics 2016-06-14 George Karabatsos

P{\'o}lya urns are urns where at each unit of time a ball is drawn and is replaced with some other balls according to its colour. We introduce a more general model: The replacement rule depends on the colour of the drawn ball and the value…

Discrete Mathematics · Computer Science 2018-06-22 Cyril Banderier , Philippe Marchal , Michael Wallner

We introduce an \verb|R| package, called \verb|MPS|, for computing the probability density function, computing the cumulative distribution function, computing the quantile function, simulating random variables, and estimating the parameters…

Computation · Statistics 2018-09-11 Mahdi Teimouri

We establish a one-to-one correspondence between (i) exchangeable sequences of random variables whose finite-dimensional distributions are minimum (or maximum) infinitely divisible and (ii) non-negative, non-decreasing, infinitely divisible…

Probability · Mathematics 2022-09-21 Florian Brück , Jan-Frederik Mai , Matthias Scherer

Predictive State Representations (PSRs) are an expressive class of models for controlled stochastic processes. PSRs represent state as a set of predictions of future observable events. Because PSRs are defined entirely in terms of…

Machine Learning · Computer Science 2013-09-27 Byron Boots , Geoffrey Gordon , Arthur Gretton

We study a system of interacting reinforced random walks defined on polygons. At each stage, each particle chooses an edge to traverse which is incident to its position. We allow the probability of choosing a given edge to depend on the sum…

Probability · Mathematics 2016-04-07 Jiro Akahori , Andrea Collevecchio , Timothy Garoni , Kais Hamza

Sufficient conditions are developed for a class of generalized Polya urn schemes ensuring exchangeability. The extended class includes the Blackwell-MacQueen Polya urn and the urn schemes for the two-parameter Poisson-Dirichlet process and…

Probability · Mathematics 2007-05-23 Hemant Ishwaran , Mahmoud Zarepour

Random permutation set (RPS) is a new formalism for reasoning with uncertainty involving order information. Measuring the conflict between two pieces of evidence represented by permutation mass functions remains an open issue in…

Artificial Intelligence · Computer Science 2026-03-20 Ruolan Cheng , Yong Deng

In this work we discuss two urn models with general weight sequences $(A,B)$ associated to them, $A=(\alpha_n)_{n\in\N}$ and $B=(\beta_m)_{m\in\N}$, generalizing two well known P\'olya-Eggenberger urn models, namely the so-called sampling…

Combinatorics · Mathematics 2010-05-11 Markus Kuba

A sequence of random variables is exchangeable if its joint distribution is invariant under variable permutations. We introduce exchangeable variable models (EVMs) as a novel class of probabilistic models whose basic building blocks are…

Machine Learning · Computer Science 2014-05-06 Mathias Niepert , Pedro Domingos

Let $S$ be a Polish space and $(X_n:n\geq1)$ an exchangeable sequence of $S$-valued random variables. Let $\alpha_n(\cdot)=P(X_{n+1}\in \cdot\mid X_1,\...,X_n)$ be the predictive measure and $\alpha$ a random probability measure on $S$ such…

Probability · Mathematics 2013-07-09 Patrizia Berti , Luca Pratelli , Pietro Rigo

We consider a generalization of the Bernoulli-Laplace model in which there are two urns and $n$ total balls, of which $r$ are red and $n - r$ white, and where the left urn holds $m$ balls. At each time increment, $k$ balls are chosen…