On exchangeable random variables and the statistics of large graphs and hypergraphs
From MaRDI portal
Publication:980774
DOI10.1214/08-PS124zbMath1189.60020arXiv0801.1698OpenAlexW3103788012MaRDI QIDQ980774
Publication date: 29 June 2010
Published in: Probability Surveys (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0801.1698
Parametric hypothesis testing (62F03) Combinatorial probability (60C05) Probabilistic measure theory (60A10) Research exposition (monographs, survey articles) pertaining to probability theory (60-02) Exchangeability for stochastic processes (60G09)
Related Items (47)
Cut distance identifying graphon parameters over weak* limits ⋮ A representation of exchangeable hierarchies by sampling from random real trees ⋮ On convergence for graphexes ⋮ A classification of orbits admitting a unique invariant measure ⋮ The limit theorem for maximum of partial sums of exchangeable random variables ⋮ Hypergraph limits: A regularity approach ⋮ Coalescent results for diploid exchangeable population models ⋮ Spin glass models from the point of view of spin distributions ⋮ General erased-word processes: product-type filtrations, ergodic laws and Martin boundaries ⋮ Decomposition of tournament limits ⋮ A hierarchical version of the de Finetti and Aldous-Hoover representations ⋮ Concentration estimates for functions of finite high‐dimensional random arrays ⋮ Natural quasirandomness properties ⋮ Invariant measures via inverse limits of finite structures ⋮ Nilspace Factors for General Uniformity Seminorms, Cubic Exchangeability and Limits ⋮ A Unified Approach to Structural Limits and Limits of Graphs with Bounded Tree-Depth ⋮ Multigraph limits and exchangeability ⋮ Poset limits and exchangeable random posets ⋮ Interval graph limits ⋮ Deducing the density Hales-Jewett theorem from an infinitary removal lemma ⋮ Random graphs with a given degree sequence ⋮ Estimating and understanding exponential random graph models ⋮ A measure-theoretic approach to the theory of dense hypergraphs ⋮ Relating the cut distance and the weak* topology for graphons ⋮ Semantic limits of dense combinatorial objects ⋮ An analytic approach to sparse hypergraphs: hypergraph removal ⋮ On a notion of partially conditionally identically distributed sequences ⋮ The full replica symmetry breaking in the Ising spin glass on random regular graph ⋮ Computable Exchangeable Sequences Have Computable de Finetti Measures ⋮ INVARIANT MEASURES CONCENTRATED ON COUNTABLE STRUCTURES ⋮ Quantum invariant families of matrices in free probability ⋮ Limits of structures and the example of tree semi-lattices ⋮ Testability and repair of hereditary hypergraph properties ⋮ Unnamed Item ⋮ Sampling perspectives on sparse exchangeable graphs ⋮ A hypergraph blow-up lemma ⋮ Cut-norm and entropy minimization over \(\text{weak}^{\ast}\) limits ⋮ Computable de Finetti measures ⋮ Limits of sparse configuration models and beyond: graphexes and multigraphexes ⋮ Tensor Decompositions for Learning Latent Variable Models (A Survey for ALT) ⋮ The Cut Metric for Probability Distributions ⋮ On the rate of convergence in de Finetti's representation theorem ⋮ A generalization of hierarchical exchangeability on trees to directed acyclic graphs ⋮ Exchangeable interval hypergraphs and limits of ordered discrete structures ⋮ Poset limits can be totally ordered ⋮ Matrix estimation by universal singular value thresholding ⋮ Random projectors with continuous resolutions of the identity in a finite-dimensional Hilbert space
This page was built for publication: On exchangeable random variables and the statistics of large graphs and hypergraphs
