Sampling \(k\)-partite graphs with a given degree sequence (Q2326166): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: Wikidata QID (P12): Q128631787, #quickstatements; #temporary_batch_1728564459526
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.2478/ausi-2018-0010 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2909715706 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sequential algorithm for generating random graphs / 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: 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: Matrices of zeros and ones with fixed row and column sum vectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4012032 / 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: An Application of Markov Chain Monte Carlo to Community Ecology / 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: Algebraic algorithms for sampling from conditional distributions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3287781 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4262220 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rejection sampling of bipartite graphs with given degree sequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Markov Chain Algorithms for Planar Lattice Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards random uniform sampling of bipartite graphs with given degree sequence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5386180 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258215 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4263664 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128631787 / rank
 
Normal rank

Latest revision as of 14:22, 10 October 2024

scientific article
Language Label Description Also known as
English
Sampling \(k\)-partite graphs with a given degree sequence
scientific article

    Statements

    Sampling \(k\)-partite graphs with a given degree sequence (English)
    0 references
    0 references
    7 October 2019
    0 references
    degree sequence
    0 references
    contraction of a degree sequence
    0 references
    degree sequence bipartition
    0 references
    contraction of a graph
    0 references
    deletion of a graph
    0 references
    ecological occurrence matrix
    0 references

    Identifiers