scientific article; zbMATH DE number 2151257
From MaRDI portal
Publication:4660727
Gibbs measureGlauber dynamicsIsing modelsparsimonious coloringsPotts modelsreconstruction algorithms
Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Combinatorial probability (60C05) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Information theory (general) (94A15)
Recommendations
- Information flow on trees
- Tracking Information Flow in Dynamic Tree Structures
- Information dissemination in weighted trees
- Information Dissemination in Trees
- Information ranking and power laws on trees
- Information dissemination in trees with nonuniform edge transmission times
- scientific article; zbMATH DE number 139612
- Information flow on directed acyclic graphs
- scientific article; zbMATH DE number 475423
- Maintaining information in fully dynamic trees with top trees
Cited in
(43)- Information flow on trees
- Extremality of the translation-invariant Gibbs measures for the Potts model on the Cayley tree
- An impossibility result for reconstruction in the degree-corrected stochastic block model
- On an algebraic property of the disordered phase of the Ising model with competing interactions on a Cayley tree
- Network models: structure and function. Abstracts from the workshop held December 10--16, 2017
- The tightness of the Kesten-Stigum reconstruction bound of symmetric model with multiple mutations
- Glauber dynamics on trees: Boundary conditions and mixing time
- Branching processes, and random-cluster measures on trees
- Robust reconstruction on trees is determined by the second eigenvalue.
- Species tree estimation under joint modeling of coalescence and duplication: sample complexity of quartet methods
- Reconstructibility of a general DNA evolution model
- The critical Ising model on trees, concave recursions and nonlinear capacity
- Information reconstruction on an infinite tree for a \(4\times 4\)-state asymmetric model with community effects
- Large degree asymptotics and the reconstruction threshold of the asymmetric binary channels
- Spatial mixing and the connective constant: optimal bounds
- The Potts model with countable set of spin values on a Cayley tree
- A contour method on Cayley trees
- Phase ordering after a deep quench: the stochastic Ising and hard core gas models on a tree
- The large deviations of the whitening process in random constraint satisfaction problems
- Uniqueness of Gibbs measure for models with uncountable set of spin values on a Cayley tree
- Counting without sampling: Asymptotics of the log-partition function for certain statistical physics models
- On models with uncountable set of spin values on a Cayley tree: integral equations
- Phase transitions in the \(q\)-coloring of random hypergraphs
- Recovering a hidden community beyond the Kesten-Stigum threshold in \(O(| E|\log^\ast| V|)\) time
- Reconstruction and estimation in the planted partition model
- Gibbs measures for the fertile three-state hard-core models on a Cayley tree
- Phase transition of the reconstructability of a general model with different in-community and out-community mutations on an infinite tree
- Gibbs measures of Potts model on Cayley trees: a survey and applications
- Extremality of translation-invariant phases for a three-state SOS-model on the binary tree
- On the uniqueness of Gibbs measure in the Potts model on a Cayley tree with external field
- Ferromagnetic Potts Model: Refined #BIS-hardness and Related Results
- Community detection and percolation of information in a geometric setting
- Broadcasting‐induced colorings of preferential attachment trees
- Combinatorial statistics and the sciences
- Phase transition in the sample complexity of likelihood-based phylogeny inference
- Optimal mixing via tensorization for random independent sets on arbitrary trees
- Semi-supervised clustering of sparse graphs: crossing the information-theoretic threshold
- Broadcasting in random recursive DAGs
- Exact phase transitions for stochastic block models and reconstruction on trees
- Gibbs measures for hardcore-solid-on-solid models on Cayley trees
- Reconstruction for the Potts model
- Three-state p-SOS models on binary Cayley trees
- Reconstruction of random colourings
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4660727)