Exact Representation of Sparse Networks with Symmetric Nonnegative Embeddings

We prove that our model can exactly represent any graph with low arboric-ity, a property that many real-world networks satisfy; our proof also applies to related models but has much greater scope than the closest prior bound, which is based on low max degree .