Add to ORKGNew predictable sampling theorems are developed for two natural extensions of the concept of F-exchangeability applied to separately exchangeable arrays and to jointly exchangeable arrays. Further we show that weak and strong F-exchangeability are in fact the same for certain ergodic arrays.Separately exchangeable array Jointly exchangeable array Adapted time Spreadable array Predictable sampling
In inductive inference phenomena from the past are modeled in order to make predictions of the futur...
Let S be a Polish space and (Xn : n = 1) an exchangeable sequence of S-valued random variables. Let ...
A sequence of random variables is exchangeable if its joint distribution is invariant under variable...
International audienceExchangeable arrays are natural tools to model common forms of dependence betw...
In this article we demonstrate the relationship between finitely exchangeable arrays and finitely ex...
AbstractAldous and Hoover have proved independently that an array X = (Xij, i, j ∈ N) of random vari...
Aldous and Hoover have proved independently that an array X = (Xij, i, j [set membership, variant] )...
A fundamental problem in the analysis of structured relational data like graphs, networks, databases...
Exchangeability of observations corresponds to a condition shared by the vast majority of applicatio...
Exchangeability is a central notion in statistics and probability theory. The assumption that an inf...
A notion of conditionally identically distributed (c.i.d.) sequences has been studied as a form of s...
Exchangeability is a central notion in statistics and probability theory. The assumption that an inf...
A set of random variables is exchangeable if its joint distribution function is invariant under perm...
AbstractA weakly exchangeable array is a symmetric infinite array with random entries which have a j...
We prove a uniformly computable version of de Finetti’s theorem on exchangeable sequences of real ra...
In inductive inference phenomena from the past are modeled in order to make predictions of the futur...
Let S be a Polish space and (Xn : n = 1) an exchangeable sequence of S-valued random variables. Let ...
A sequence of random variables is exchangeable if its joint distribution is invariant under variable...
International audienceExchangeable arrays are natural tools to model common forms of dependence betw...
In this article we demonstrate the relationship between finitely exchangeable arrays and finitely ex...
AbstractAldous and Hoover have proved independently that an array X = (Xij, i, j ∈ N) of random vari...
Aldous and Hoover have proved independently that an array X = (Xij, i, j [set membership, variant] )...
A fundamental problem in the analysis of structured relational data like graphs, networks, databases...
Exchangeability of observations corresponds to a condition shared by the vast majority of applicatio...
Exchangeability is a central notion in statistics and probability theory. The assumption that an inf...
A notion of conditionally identically distributed (c.i.d.) sequences has been studied as a form of s...
Exchangeability is a central notion in statistics and probability theory. The assumption that an inf...
A set of random variables is exchangeable if its joint distribution function is invariant under perm...
AbstractA weakly exchangeable array is a symmetric infinite array with random entries which have a j...
We prove a uniformly computable version of de Finetti’s theorem on exchangeable sequences of real ra...
In inductive inference phenomena from the past are modeled in order to make predictions of the futur...
Let S be a Polish space and (Xn : n = 1) an exchangeable sequence of S-valued random variables. Let ...
A sequence of random variables is exchangeable if its joint distribution is invariant under variable...