Application of information-percolation method to reconstruction problems on graphs

@article{Polyanskiy2018ApplicationOI,
  title={Application of information-percolation method to reconstruction problems on graphs},
  author={Yury Polyanskiy and Yihong Wu},
  journal={ArXiv},
  year={2018},
  volume={abs/1806.04195}
}
  • Yury Polyanskiy, Yihong Wu
  • Published 2018
  • Computer Science, Mathematics
  • ArXiv
  • In this paper we propose a method of proving impossibility results based on applying strong data-processing inequalities to estimate mutual information between sets of variables forming certain Markov random fields. The end result is that mutual information between two `far away' (as measured by the graph distance) variables is bounded by the probability of existence of open path in a bond-percolation problem on the same graph. Furthermore, stronger bounds can be obtained by establishing mutual… CONTINUE READING
    2
    Twitter Mentions

    Figures and Topics from this paper.

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 24 REFERENCES

    Mutual information in rank-one matrix estimation

    Dissipation of Information in Channels With Input Constraints

    MMSE of probabilistic low-rank matrix estimation: Universality with respect to the output channel