One-Pass Graphic Approximation of Integer Sequences
Brian Cloteaux
TL;DR
This paper introduces a fast, one-pass method for approximating degree sequences in network modeling, ensuring they are graphic while maintaining small distribution distances for large sequences.
Contribution
It presents a novel, efficient one-pass algorithm for generating graphic approximations of degree sequences in network models.
Findings
The method is fast and requires only one pass through the sequence.
It produces small probability distribution distances for large sequences.
The approach effectively approximates non-graphic sequences with graphic ones.
Abstract
A variety of network modeling problems begin by generating a degree sequence drawn from a given probability distribution. If the randomly generated sequence is not graphic, we give a new approach for generating a graphic approximation of the sequence. This approximation scheme is fast, requiring only one pass through the sequence, and produces small probability distribution distances for large sequences.
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 · Data Visualization and Analytics · Data Management and Algorithms