Distinguishing power-law uniform random graphs from inhomogeneous random graphs through small subgraphs (Q2116499)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Distinguishing power-law uniform random graphs from inhomogeneous random graphs through small subgraphs |
scientific article; zbMATH DE number 7491666
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Distinguishing power-law uniform random graphs from inhomogeneous random graphs through small subgraphs |
scientific article; zbMATH DE number 7491666 |
Statements
Distinguishing power-law uniform random graphs from inhomogeneous random graphs through small subgraphs (English)
0 references
17 March 2022
0 references
subgraphs
0 references
uniform random graphs
0 references
randomized algorithms
0 references
0 references
0 references
0.8055963516235352
0 references
0.7641231417655945
0 references
0.7490279674530029
0 references
0.7326393723487854
0 references
0.7269929647445679
0 references
