research
∙
08/12/2023
Latent Random Steps as Relaxations of Max-Cut, Min-Cut, and More
Algorithms for node clustering typically focus on finding homophilous st...
share
research
∙
09/30/2022
Direct Embedding of Temporal Network Edges via Time-Decayed Line Graphs
Temporal networks model a variety of important phenomena involving timed...
research
∙
02/08/2022
Simplified Graph Convolution with Heterophily
Graph convolutional networks (GCNs) (Kipf Welling, 2017) attempt to ...
research
∙
11/04/2021
An Interpretable Graph Generative Model with Heterophily
Many models for graphs fall under the framework of edge-independent dot ...
research
∙
10/29/2021
On the Power of Edge Independent Graph Models
Why do many modern neural-network-based graph generative models fail to ...
research
∙
02/17/2021
DeepWalking Backwards: From Embeddings Back to Graphs
Low-dimensional node embeddings play a key role in analyzing graph datas...
research
∙
06/10/2020
Node Embeddings and Exact Low-Rank Representations of Complex Networks
Low-dimensional embeddings, from classical spectral embeddings to modern...
research
∙
05/29/2020
