Cloteaux, B.
(2017),
One-Pass Graphic Approximation of Integer Sequences, Journal of Graph Algorithms and Applications
(Accessed February 10, 2025)
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
Secure .gov websites use HTTPS
A lock (
) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.
One-Pass Graphic Approximation of Integer Sequences
Published
Author(s)
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.Citation
Journal of Graph Algorithms and Applications
Pub Type
Journals
Keywords
degree sequence, approximation
Citation
Issues
If you have any questions about this publication or are having problems accessing it, please contact reflib@nist.gov.
Created December 17, 2017, Updated September 18, 2020