Let G be the set of finite graphs whose vertices belong to some fixed countable set, and let ≡ be an equivalence relation on G. By the strengthening of ≡ we mean an equivalen...
The cone ˆG of a finite graph G is obtained by adding a new vertex p, called the cone point, and joining each vertex of G to p by a simple edge. We show that the rank of the red...
Loopy belief propagation has been employed in a wide variety of applications with great empirical success, but it comes with few theoretical guarantees. In this paper we analyze t...
Sujay Sanghavi, Dmitry M. Malioutov, Alan S. Wills...
Association studies in populations relate genomic variation among individuals with medical condition. Key to these studies is the development of efficient and affordable genotypin...
A secret-sharing scheme realizes a graph if every two vertices connected by an edge can reconstruct the secret while every independent set in the graph does not get any informatio...