• Corpus ID: 195345199

The non-tightness of the reconstruction threshold of a 4 states symmetric model with different in-block and out-block mutations

  title={The non-tightness of the reconstruction threshold of a 4 states symmetric model with different in-block and out-block mutations},
  author={Wenjian Liu and Ning Ning},
The tree reconstruction problem is to collect and analyze massive data at the $n$th level of the tree, to identify whether there is non-vanishing information of the root, as $n$ goes to infinity. Its connection to the clustering problem in the setting of the stochastic block model, which has wide applications in machine learning and data mining, has been well established. For the stochastic block model, an "information-theoretically-solvable-but-computationally-hard" region, or say "hybrid-hard… 
1 Citations

Phase Transition of the Reconstructability of a General Model with Different In-Community and Out-Community Mutations on an Infinite Tree

This paper analyzes the tree reconstruction problem by studying a general model which incorporates the characteristics of both Ising and Potts through different in-community and out-community transition probabilities, and rigorously establishing the exact conditions for reconstruction.



Information Reconstruction on an Infinite Tree for a $$4\times 4$$-State Asymmetric Model with Community Effects

It is rigorously shown that the reconstruction bound is not tight when the sum of the base frequencies of adenine and thymine falls in the interval of 0,1/2-\sqrt{3}/6\right)\bigcup, which is the first rigorous result on asymmetric noisy channels with community effects.

Non-Reconstructability in the Stochastic Block Model

A key ingredient in the result is a new connection between non-reconstructability and non-distinguishability of the block model from an Erd\H{o}s-R\'enyi model with the same average degree.

Large Degree Asymptotics and the Reconstruction Threshold of the Asymmetric Binary Channels

By means of refined analyses of moment recursion on a weighted version of the magnetization, and concentration investigations, a complete answer is given to the question of how small it needs to be to establish the tightness of the reconstruction threshold and further determine its asymptotics of large degrees.

A Proof of the Block Model Threshold Conjecture

This work proves the rest of the conjecture of Decelle, Krzkala, Moore and Zdeborová by providing an efficient algorithm for clustering in a way that is correlated with the true partition when s2>d.

The Tightness of the Kesten–Stigum Reconstruction Bound of Symmetric Model with Multiple Mutations

It is well known that reconstruction problems, as the interdisciplinary subject, have been studied in numerous contexts including statistical physics, information theory and computational biology, to

Reconstruction for the Potts model

This work confirms conjectures made by Mezard and Montanari for the Potts models proving the first exact reconstruction threshold in a non-binary model establishing the so-called Kesten-Stigum bound for the 3-state Potts model on regular trees of large degree and determines asymptotics for these reconstruction thresholds.

Reconstruction on Trees: Beating the Second Eigenvalue

It is shown that, both for the binary asymmetric channel and for the symmetric channel on many symbols, it is sometimes possible to reconstruct even when dλ22(M) < 1, indicating that, for many (maybe most) tree-indexed Markov chains, the location of the data on the boundary plays a crucial role in reconstruction problems.

Recovery and Rigidity in a Regular Stochastic Block Model

R rigidity is proved by showing that with high probability an exact recovery of the community structure is possible and that, in this setting, any suitably good partial recovery can be bootstrapped to obtain a full Recovery of the communities.

Typology of phase transitions in Bayesian inference problems

The results show that the instability of the trivial fixed point is not generic evidence for the Bayes optimality of the message-passing algorithms, and shed light on the existence of hybrid-hard phases for a large class of planted constraint satisfaction problems.

Broadcasting on trees and the Ising model

Consider a process in which information is transmitted from a given root node on a noisy tree network T . We start with an unbiased random bit R at the root of the tree and send it down the edges of