Impossibility of low-rank embeddings for triangle rich networks, Part II (Apr 4)

Name: Impossibility of low-rank embeddings for triangle rich networks, Part II (Apr 4)
Uploaded: 2020-11-25T00:00:00.000Z
Duration: 56 min 25 s
Description: Low-dimensional inner-product embeddings cannot generate sparse, triangle-rich graphs of the social-network type: if \(P(ij\text{ is an edge})=\min(\max(vi\cdot vj,0),1)\) and the expected number of triangles on verti...

C. Seshadhri · 56:25

Low-dimensional inner-product embeddings cannot generate sparse, triangle-rich graphs of the social-network type: if \(P(ij\text{ is an edge})=\min(\max(vi\cdot vj,0),1)\) and the expected number of triangles on verti...

Read the full summary on tuber