The impossibility of low-rank representations for triangle-rich complex networks

@article{Comandur2020TheIO,
  title={The impossibility of low-rank representations for triangle-rich complex networks},
  author={Seshadhri Comandur and Aneesh Sharma and Andrew Stolman and Ashish Goel},
  journal={Proceedings of the National Academy of Sciences of the United States of America},
  year={2020},
  volume={117},
  pages={5631 - 5637}
}
  • Seshadhri Comandur, Aneesh Sharma, +1 author Ashish Goel
  • Published 2020
  • Computer Science, Mathematics, Medicine
  • Proceedings of the National Academy of Sciences of the United States of America
  • Significance Our main message is that the popular method of low-dimensional embeddings provably cannot capture important properties of real-world complex networks. A widely used algorithmic technique for modeling these networks is to construct a low-dimensional Euclidean embedding of the vertices of the network, where proximity of vertices is interpreted as the likelihood of an edge. Contrary to common wisdom, we argue that such graph embeddings do not capture salient properties of complex… CONTINUE READING

    Figures, Tables, and Topics from this paper.

    Citations

    Publications citing this paper.
    SHOWING 1-4 OF 4 CITATIONS

    References

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

    Community structure and scale-free collections of Erdös-Rényi graphs

    Statistical Inference on Random Dot Product Graphs: a Survey

    VIEW 2 EXCERPTS

    node2vec: Scalable Feature Learning for Networks

    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    Block models and personalized PageRank