Combinatorial statistics and the sciences

DOI10.4171/icm2022/179OpenAlexW4389841785MaRDI QIDQ6118118

Elchanan Mossel

Publication date: 20 March 2024

Published in: International Congress of Mathematicians (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4171/icm2022/179

zbMATH Keywords

combinatorial statisticsbroadcasting on treesthe reconstruction problem on trees

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to statistics (62-01) Combinatorial probability (60C05) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Research exposition (monographs, survey articles) pertaining to probability theory (60-02)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Belief propagation, robust reconstruction and optimal recovery of block models
• Reconstruction and estimation in the planted partition model
• On the inference of large phylogenies with long branches: how long is too long?
• Spectral clustering and the high-dimensional stochastic blockmodel
• Phase transition in the sample complexity of likelihood-based phylogeny inference
• Reconstruction for the Potts model
• Evolutionary trees and the Ising model on the Bethe lattice: A proof of Steel's conjecture
• Reconstruction of random colourings
• Reconstruction on trees and spin glass transition
• The asymptotic \(k\)-SAT threshold
• Full reconstruction of Markov models on evolutionary trees: identifiability and consistency.
• Markov random fields on an infinite tree
• Remarks on the limiting Gibbs states on a (d+1)-tree
• Taxonomy with confidence
• Estimation and prediction for stochastic blockmodels for graphs with latent block structure
• The Metropolis algorithm for graph bisection
• Information flow on trees
• A phase transition for a random cluster model on phylogenetic trees.
• On the purity of the limiting Gibbs state for the Ising model on the Bethe lattice.
• Information-theoretic thresholds from the cavity method
• A proof of the block model threshold conjecture
• The Ising model and percolation on trees and tree-like graphs
• Reconstruction on trees: Beating the second eigenvalue
• Broadcasting on trees and the Ising model.
• Robust reconstruction on trees is determined by the second eigenvalue.
• On the extremality of the disordered state for the Ising model on the Bethe lattice
• A few logs suffice to build (almost) all trees. II
• Application of the information-percolation method to reconstruction problems on graphs
• The critical Ising model on trees, concave recursions and nonlinear capacity
• Maximum independent sets on random regular graphs
• Limit theorems for decomposable multi-dimensional Galton-Watson processes
• An information-percolation bound for spin synchronization on general graphs
• Phylogeny
• Proof of the Satisfiability Conjecture for Large k
• A nonparametric view of network models and Newman–Girvan and other modularities
• Spectral redemption in clustering sparse networks
• The solution of some random NP-hard problems in polynomial expected time
• Reconstruction and Clustering in Random Constraint Satisfaction Problems
• NON-BACKTRACKING RANDOM WALKS MIX FASTER
• A proof of Alon’s second eigenvalue conjecture and related problems
• Random matrices, nonbacktracking walks, and orthogonal polynomials
• A new look at survey propagation and its generalizations
• Graph Partitioning via Adaptive Spectral Techniques
• Information, Physics, and Computation
• Gibbs States on Countable Sets
• A few logs suffice to build (almost) all trees (I)
• Signal propagation and noisy circuits
• Proof of the Achievability Conjectures for the General Stochastic Block Model
• Broadcasting on Random Directed Acyclic Graphs
• The phase transition in inhomogeneous random graphs
• Gibbs states and the set of solutions of random constraint satisfaction problems
• Catching the k-NAESAT threshold
• Additional Limit Theorems for Indecomposable Multidimensional Galton-Watson Processes
• Learning nonsingular phylogenies and hidden Markov models
• Satisfiability threshold for random regular \textsc{nae-sat}