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

by   C. Seshadhri, et al.

The study of complex networks is a significant development in modern science, and has enriched the social sciences, biology, physics, and computer science. Models and algorithms for such networks are pervasive in our society, and impact human behavior via social networks, search engines, and recommender systems to name a few. A widely used algorithmic technique for modeling such complex 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 the common view, we argue that such graph embeddings do notcapture salient properties of complex networks. The two properties we focus on are low degree and large clustering coefficients, which have been widely established to be empirically true for real-world networks. We mathematically prove that any embedding (that uses dot products to measure similarity) that can successfully create these two properties must have rank nearly linear in the number of vertices. Among other implications, this establishes that popular embedding techniques such as Singular Value Decomposition and node2vec fail to capture significant structural aspects of real-world complex networks. Furthermore, we empirically study a number of different embedding techniques based on dot product, and show that they all fail to capture the triangle structure.


page 1

page 2

page 3

page 4


Low-Rank Representations Towards Classification Problem of Complex Networks

Complex networks representing social interactions, brain activities, mol...

Node Embeddings and Exact Low-Rank Representations of Complex Networks

Low-dimensional embeddings, from classical spectral embeddings to modern...

Heterogeneous Information Network Embedding for Meta Path based Proximity

A network embedding is a representation of a large graph in a low-dimens...

DeepWalking Backwards: From Embeddings Back to Graphs

Low-dimensional node embeddings play a key role in analyzing graph datas...

Spectral Embedding of Graph Networks

We introduce an unsupervised graph embedding that trades off local node ...

Classic Graph Structural Features Outperform Factorization-Based Graph Embedding Methods on Community Labeling

Graph representation learning (also called graph embeddings) is a popula...

The iterated local transitivity model for hypergraphs

Complex networks are pervasive in the real world, capturing dyadic inter...

Please sign up or login with your details

Forgot password? Click here to reset