Distinguishing power-law uniform random graphs from inhomogeneous random graphs through small subgraphs (Q2116499): 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: 2102.09315 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5395267 / 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: Generating simple random graphs with prescribed degree distribution / rank
 
Normal rank
Property / cites work
 
Property / cites work: The average distances in random graphs with given expected degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counting triangles in power-law uniform random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subgraph probability of random graphs with specified degrees and applications to chromatic number and connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subgraphs in preferential attachment models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4262418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal subgraph structures in scale-free configuration models / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Probability That a Random Multigraph is Simple / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large Cliques in a Power-Law Random Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / 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: The asymptotic distribution of short cycles in random regular graphs / rank
 
Normal rank

Latest revision as of 09:33, 28 July 2024

scientific article
Language Label Description Also known as
English
Distinguishing power-law uniform random graphs from inhomogeneous random graphs through small subgraphs
scientific article

    Statements

    Distinguishing power-law uniform random graphs from inhomogeneous random graphs through small subgraphs (English)
    0 references
    0 references
    17 March 2022
    0 references
    0 references
    0 references
    0 references
    0 references
    subgraphs
    0 references
    uniform random graphs
    0 references
    randomized algorithms
    0 references
    0 references
    0 references