Stratigraphy of a random acyclic directed graph: The size of trophic levels in the cascade model

DOI10.1214/AOAP/1177005431MaRDI QIDQ687699zbMATH OpenOpenAlexFDO

Authors Tomasz Łuczak, Joel E. Cohen

Publication date 28 October 1993

Published in The Annals of Applied Probability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1214/aoap/1177005431

zbMATH Keywords

acyclic directed graphsecological food websrandom graph problem

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Random graphs (graph-theoretic aspects) (05C80) Ecology (92D40)

Review text

The authors claim that the random graph problem considered in this paper has an application in the field of ecological food webs, which may be described by acyclic directed graphs. The trophic levels of species of plants or animals correspond in this framework to the levels of a random digraph \(D(n,c)\) with \(n\) vertices and edge probability \(c/n\). The edges are directed from the vertex with the greater number to the vertex with the smaller one. The size of levels and the number of edges between two levels in \(D(n,c)\) are given.

Recommendations

• Giant components in three-parameter random directed graphs
• scientific article; zbMATH DE number 953297
• Random Generation of Directed Acyclic Graphs
• scientific article; zbMATH DE number 638670
• On random models of complex food webs

Cited in

(1)

• Oriented graphs generated by random points on a circle

This page was built for publication: Stratigraphy of a random acyclic directed graph: The size of trophic levels in the cascade model

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