Related Experiment Video
Updated: Mar 16, 2026

Genomic MRI - a Public Resource for Studying Sequence Patterns within Genomic DNA
Published on: May 9, 2011
Fast Sequential Creation of Random Realizations of Degree Sequences
1National Institute of Standards and Technology, Applied and Computational Mathematics Division, Gaithersburg, MD.
Abstract:
We examine the problem of creating random realizations of very large degree sequences. Although fast in practice, the Markov chain Monte Carlo (MCMC) method for selecting a realization has limited usefulness for creating large graphs because of memory constraints. Instead, we focus on sequential importance sampling (SIS) schemes for random graph creation. A difficulty with SIS schemes is assuring that they terminate in a reasonable amount of time. We introduce a new sampling method by which we guarantee termination while achieving speed comparable to the MCMC method.
Related Concept Videos
Random Variables
Uppercase letters such as X or Y denote a random variable. Lowercase letters like x or y denote the value of a random variable. If X is a random variable, then X is written in words, and x is given as a number.
For example, let X = the...
Geometric Sequences
Maxam-Gilbert Sequencing
Challenges of the Maxam-Gilbert Method
The...
Arithmetic Sequences
Basic Discrete Time Signals
The unit impulse or sample sequence is mathematically expressed as zero for all n values except at n=0, where it is one. The unit impulse sequence, denoted by δ(n), is the first difference of the unit step sequence, while the unit step sequence u(n) is the...
Next-generation Sequencing
Next-Generation Sequencing Methods
Although all next-generation methods use different technologies, they all share a set of standard features....

