The Structure of Cycling in the Ythan Estuary
A method for identifying all the simple, directed cycles in a network of ecosystems flows is described. Furthermore, the cycles may be divided into distinct groups, or nexuses, distinguished by certain critical links. These groupings may also be used to analytically separate the network into two constituent graphs — one graph containing only cycled flow and the other consisting of only once-through pathways.
The analysis, when applied to the carbon flow in the Ythan estuary, graphically portrays both the importance and the vulnerability of the higher trophic level transfers.
KeywordsCarbon Flow Simple Cycle Fundamental Cycle Cycling Index Backtrack Search Algorithm
Unable to display preview. Download preview PDF.
- Baird, D. and Milne, H. (1981). Energy flow in the Ythan estuary, Aberdeenshire, Scotland. Estuarine. Coastal and Shelf Science 13 455–472.Google Scholar
- Jaynes, E.T. (1958). Probability Theory in Science and Engineering. Colloquium Lectures in Pure and Applied Science No. 4. Socony Mobil Oil Company, Dallas, TX. 189 pp.Google Scholar
- Mateti, P. and Deo, N. (1976). On algorithms for enumerating all circuits of a graph. SIAM I, Comput. 5: 90–99.Google Scholar
- May, R.M. (1973). Stability and Complexity in Model Ecosystems. Princeton Univ. Press, Princeton, NJ. 235 pp.Google Scholar
- Read, R.C. and Tarjan, R.E. (1975). Bounds on backtrack algorithms for listing cycles, paths, and spanning trees. Networks 5237–252.Google Scholar
- Ulanowicz, R.E. (1982). Community measures of Marine food networks and their possible applications. In M.J.R. Fasham (ed.) Measurement of Fluxes in Marine Ecosystems. UNESCO Press, Paris. (in press)Google Scholar
- Yan, C.S. (1969). Introduction to Input-Output Economics. Holt, Rinehart and Winston, NY.Google Scholar