The structure of an evolving random bipartite graph (Q2834146)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6656624
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The structure of an evolving random bipartite graph |
scientific article; zbMATH DE number 6656624 |
Statements
25 November 2016
0 references
random graph
0 references
random bipartite graph
0 references
graph evolution
0 references
generating function
0 references
0 references
0.9141003
0 references
0 references
0.9028076
0 references
0.9023349
0 references
0.9012271
0 references
0.9006163
0 references
The structure of an evolving random bipartite graph (English)
0 references
The paper under review is a survey of results on the structure of an evolving random bipartite graph. Both sparse and critical cases are considered. Results discussed include estimation of the probability that no complex component (i.e. one with more than one cycle) occurs and results on the number of tree components and cyclic components. Enumerative results are discussed using multivariate generating functions, and some empirical data are presented which suggest some topics for future investigation.NEWLINENEWLINEFor the entire collection see [Zbl 1254.68023].
0 references
