Information-theoretic limits of selecting binary graphical models in high dimensions

Details Information-theoretic limits of selecting binary graphical models in high dimensions Information-theoretic limits of selecting binary graphical models in high dimensions

2009-05-16

arxiv.org/abs/0905.2639v1

Computer Science

Information Theory

27 pages

Scientific paper

The problem of graphical model selection is to correctly estimate the graph structure of a Markov random field given samples from the underlying distribution. We analyze the information-theoretic limitations of the problem of graph selection for binary Markov random fields under high-dimensional scaling, in which the graph size $p$ and the number of edges $k$, and/or the maximal node degree $d$ are allowed to increase to infinity as a function of the sample size $n$. For pairwise binary Markov random fields, we derive both necessary and sufficient conditions for correct graph selection over the class $\mathcal{G}_{p,k}$ of graphs on $p$ vertices with at most $k$ edges, and over the class $\mathcal{G}_{p,d}$ of graphs on $p$ vertices with maximum degree at most $d$. For the class $\mathcal{G}_{p, k}$, we establish the existence of constants $c$ and $c'$ such that if $\numobs < c k \log p$, any method has error probability at least 1/2 uniformly over the family, and we demonstrate a graph decoder that succeeds with high probability uniformly over the family for sample sizes $\numobs > c' k^2 \log p$. Similarly, for the class $\mathcal{G}_{p,d}$, we exhibit constants $c$ and $c'$ such that for $n < c d^2 \log p$, any method fails with probability at least 1/2, and we demonstrate a graph decoder that succeeds with high probability for $n > c' d^3 \log p$.

Affiliated with

Also associated with

No associations

Rating

Information-theoretic limits of selecting binary graphical models in high dimensions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Information-theoretic limits of selecting binary graphical models in high dimensions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Information-theoretic limits of selecting binary graphical models in high dimensions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-503611