One-Pass Graphic Approximation of Integer Sequences

12/14/2017
by   Brian Cloteaux, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/11/2023

Integer points in the degree-sequence polytope

An integer vector b ∈ℤ^d is a degree sequence if there exists a hypergra...
research
03/09/2022

A Method for Random Packing of Spheres with Application to Bonding Modeling in Powder Bed 3D Printing Process

A Matlab-based computational procedure is proposed to fill a given volum...
research
12/23/2020

Strong laws of large numbers for Fréchet means

For 1 ≤ p < ∞, the Fréchet p-mean of a probability distribution μ on a m...
research
12/13/1999

New Error Bounds for Solomonoff Prediction

Solomonoff sequence prediction is a scheme to predict digits of binary s...
research
10/08/2020

A low discrepancy sequence on graphs

Many applications such as election forecasting, environmental monitoring...
research
02/09/2023

On Discovering Interesting Combinatorial Integer Sequences

We study the problem of generating interesting integer sequences with a ...
research
06/01/2021

Strong approximation of Bessel processes

We consider the path approximation of Bessel processes and develop a new...

Please sign up or login with your details

Forgot password? Click here to reset