Laplacian is a useful representation of graphs. The unnormalized Laplacian is $$ \mathbf L = \mathbf …

Homophily is the principle that a contact between similar people occurs at ahigher rate than among …

Node degree of a node $u$ $$ d_u = \sum_{v\in \mathcal V} A[u,v], $$ where $A$ is the adjacency …

Structural Equivalence means that nodes with similar neighborhood structures will share similar …

Introduce geometry into the manifold of complex networks