Generating Similar Graphs From Spherical Features
Dalton Lunga, Sergey Kirshner

TL;DR
This paper introduces a novel graph generation model that uses spherical features and von Mises-Fisher distribution, avoiding degeneracy issues of traditional ERGMs, and demonstrates its effectiveness on small and large networks.
Contribution
The paper presents a new graph generation method based on hyperspherical features and von Mises-Fisher distribution, improving over ERGMs by avoiding degeneracy.
Findings
Effective on small 8-node graphs
Performs well on larger social networks
Avoids degeneracy issues of ERGMs
Abstract
We propose a novel model for generating graphs similar to a given example graph. Unlike standard approaches that compute features of graphs in Euclidean space, our approach obtains features on a surface of a hypersphere. We then utilize a von Mises-Fisher distribution, an exponential family distribution on the surface of a hypersphere, to define a model over possible feature values. While our approach bears similarity to a popular exponential random graph model (ERGM), unlike ERGMs, it does not suffer from degeneracy, a situation when a significant probability mass is placed on unrealistic graphs. We propose a parameter estimation approach for our model, and a procedure for drawing samples from the distribution. We evaluate the performance of our approach both on the small domain of all 8-node graphs as well as larger real-world social networks.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComplex Network Analysis Techniques · Human Mobility and Location-Based Analysis · Data Management and Algorithms
