Random assignment processes: strong law of large numbers and de Finetti theorem
From MaRDI portal
Recommendations
- A de Finetti-type theorem for nonexchangeable finite-valued random variables
- De Finetti-type theorems for nonexchangeable \(0\)-\(1\) random variables
- De Finetti-type theorems for random selection processes. Necessary and sufficient conditions
- Permutation invariant strong law of large numbers for exchangeable sequences
- De Finetti's-type results for some families of non identically distributed random variables
Cites work
- scientific article; zbMATH DE number 3896009 (Why is no real title available?)
- scientific article; zbMATH DE number 3780300 (Why is no real title available?)
- scientific article; zbMATH DE number 3787827 (Why is no real title available?)
- scientific article; zbMATH DE number 193660 (Why is no real title available?)
- scientific article; zbMATH DE number 3538605 (Why is no real title available?)
- scientific article; zbMATH DE number 3560401 (Why is no real title available?)
- scientific article; zbMATH DE number 3223982 (Why is no real title available?)
- scientific article; zbMATH DE number 964178 (Why is no real title available?)
- scientific article; zbMATH DE number 3026923 (Why is no real title available?)
- A de Finetti-type theorem for nonexchangeable finite-valued random variables
- Characterizations and embedding properties in exchangeability
- De Finetti's theorem for Markov chains
- De Finetti's theorem for abstract finite exchangeable sequences
- De Finetti's-type results for some families of non identically distributed random variables
- De Finetti-type theorems for nonexchangeable \(0\)-\(1\) random variables
- De Finetti-type theorems for random selection processes. Necessary and sufficient conditions
- Exchangeable and partially exchangeable random partitions
- Exchangeable processes need not be mixtures of independent, identically distributed random variables
- Finite exchangeable sequences
- Foundations of Modern Probability
- Gram-de Finetti matrices
- On Symmetrically Distributed Random Measures
- On the Dovbysh-Sudakov representation result
- On the representation theorem for exchangeable arrays
- Probabilistic Symmetries and Invariance Principles
- Regenerative partition structures
- Representations for partially exchangeable arrays of random variables
- Sufficient statistics and extreme points
- Symmetric Measures on Cartesian Products
- Symmetries on random arrays and set-indexed processes
- The Representation of Partition Structures
- The representation of composition structures
Cited in
(3)
This page was built for publication: Random assignment processes: strong law of large numbers and de Finetti theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2348718)