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

06/22/2019
by   Wenjian Liu, et al.
0

The tree reconstruction problem is to collect and analyze massive data at the nth 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 phase", appears whenever the reconstruction bound is not tight of the corresponding reconstruction on the tree problem. Although it has been studied in numerous contexts, the existing literature with rigorous reconstruction thresholds established are very limited, and it becomes extremely challenging when the model under investigation has 4 states (the stochastic block model with 4 communities). In this paper, inspired by the newly proposed q_1+q_2 stochastic block model, we study a 4 states symmetric model with different in-block and out-block transition probabilities, and rigorously give the conditions for the non-tightness of the reconstruction threshold.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/26/2023

Weak Recovery Threshold for the Hypergraph Stochastic Block Model

We study the problem of weak recovery for the r-uniform hypergraph stoch...
research
06/28/2018

Typology of phase transitions in Bayesian inference problems

Many inference problems, notably the stochastic block model (SBM) that g...
research
02/22/2023

Broadcasting with Random Matrices

Motivated by the theory of spin-glasses in physics, we study the so-call...
research
02/11/2015

Reconstruction in the Labeled Stochastic Block Model

The labeled stochastic block model is a random graph model representing ...
research
12/06/2022

Exact Phase Transitions for Stochastic Block Models and Reconstruction on Trees

In this paper we continue to rigorously establish the predictions in gro...
research
05/24/2022

Semi-Supervised Clustering of Sparse Graphs: Crossing the Information-Theoretic Threshold

The stochastic block model is a canonical random graph model for cluster...
research
08/08/2017

Critical threshold for ancestral reconstruction by maximum parsimony on general phylogenies

We consider the problem of inferring an ancestral state from observation...

Please sign up or login with your details

Forgot password? Click here to reset