A sequential algorithm for generating random graphs (Q603928): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: cs/0702124 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Examples comparing importance sampling and the Metropolis algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: The asymptotic number of labeled graphs with given degree sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sampling binary contingency tables with a greedy start / rank
 
Normal rank
Property / cites work
 
Property / cites work: Negative examples for sequential importance sampling of binary contingency tables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient importance sampling for binary contingency tables / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Sequential Importance Sampling Algorithm for Generating Random Graphs with Prescribed Degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A probabilistic proof of an asymptotic formula for the number of labelled regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential Monte Carlo Methods for Statistical Analysis of Tables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected components in random graphs with given expected degree sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sampling Regular Graphs and a Peer-to-Peer Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4845257 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relaxing the uniformity and independence assumptions using the concept of fractal dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate counting, uniform generation and rapidly mixing Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast uniform generation of regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random generation of combinatorial structures from a uniform distribution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4697457 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4262220 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Brooks' Theorem for Sparse Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concentration of multivariate polynomials and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating random regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sandwiching random graphs: universality between random graph models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematics and Computer Science: Coping with Finiteness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3684147 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform generation of random regular graphs of moderate degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic enumeration by degree sequence of graphs with degrees \(o(n^{1/2})\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A critical point for random graphs with a given degree sequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating Random Regular Graphs Quickly / rank
 
Normal rank
Property / cites work
 
Property / cites work: Concentration of non‐Lipschitz functions and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4263664 / rank
 
Normal rank

Latest revision as of 11:28, 3 July 2024

scientific article
Language Label Description Also known as
English
A sequential algorithm for generating random graphs
scientific article

    Statements

    A sequential algorithm for generating random graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    8 November 2010
    0 references
    0 references
    random graphs
    0 references
    sequential importance sampling
    0 references
    FPRAS
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references