A sequential importance sampling algorithm for generating random graphs with prescribed degrees
Download
1 / 6

A SEQUENTIAL IMPORTANCE SAMPLING ALGORITHM FOR GENERATING RANDOM GRAPHS WITH PRESCRIBED DEGREES - PowerPoint PPT Presentation


  • 81 Views
  • Uploaded on

A SEQUENTIAL IMPORTANCE SAMPLING ALGORITHM FOR GENERATING RANDOM GRAPHS WITH PRESCRIBED DEGREES. (Introduction). For example d = (2, 2, 2). Other Algorithms. 1 . Algorithms for random graphs with given degree distributions . 2 . The Pairing Model . 3 . Algorithms Based on the Pairing Model

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

PowerPoint Slideshow about ' A SEQUENTIAL IMPORTANCE SAMPLING ALGORITHM FOR GENERATING RANDOM GRAPHS WITH PRESCRIBED DEGREES' - hovan


An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
A sequential importance sampling algorithm for generating random graphs with prescribed degrees

A SEQUENTIAL IMPORTANCE SAMPLING ALGORITHM FORGENERATING RANDOM GRAPHS WITH PRESCRIBED DEGREES

(Introduction)



Other algorithms

Other Algorithms

1. Algorithms for random graphs with given degree distributions.

2. The Pairing Model.

3. Algorithms Based on the Pairing Model

4. Adjacency Lists and Havel-Hakimi Variants.

5. Markov Chain Monte Carlo Algorithms(MCMC).


The sequential algorithm
The Sequential Algorithm


ad