Asymptotic enumeration, global structure, and constrained evolution (Q5931454): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q105583790 / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0012-365x(00)00211-9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2052770391 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 11:53, 30 July 2024
scientific article; zbMATH DE number 1591120
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Asymptotic enumeration, global structure, and constrained evolution |
scientific article; zbMATH DE number 1591120 |
Statements
Asymptotic enumeration, global structure, and constrained evolution (English)
0 references
24 July 2001
0 references
Counting the objects in a finite set is usually easy if all objects can be generated by a sequence of independent decisions. When there exists no such independence then counting becomes much harder. This interesting paper surveys methods applicable for such situations. For example one possible strategy is to show that a certain subclass of those objects can be generated by a sequence of independent decisions, and this subclass contains almost all objects. This also makes it possible to determine the structure of the typical objects: the so-called global structure.
0 references
random graphs
0 references
phase transition
0 references
asymptotic enumeration
0 references
global structure
0 references
