The structure of an evolving random bipartite graph

MaRDI QIDQ2834146zbMATH OpenFDO

Authors Reinhard Kutzelnigg

Publication date 25 November 2016

zbMATH Keywords

generating functiongraph evolutionrandom bipartite graphrandom graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80)

Review text

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].

Recommendations

• scientific article; zbMATH DE number 3168330
• The Evolution of Random Graphs
• scientific article; zbMATH DE number 3173143
• Component structure in the evolution of random hypergraphs
• scientific article; zbMATH DE number 3902655
• On a random graph evolving by degrees
• A general evolving model for growing bipartite networks
• Evolution of a modified binomial random graph by agglomeration
• Component evolution in random intersection graphs
• Bipartite decomposition of random graphs

Cited in

(1)

• The Evolution of Random Graphs

This page was built for publication: The structure of an evolving random bipartite graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2834146)