Socio-ecological network structures from process graphs.
We propose a process graph (P-graph) approach to develop ecosystem networks from knowledge of the properties of the component species. Originally developed as a process engineering tool for designing industrial plants, the P-graph framework has key advantages over conventional ecological network ana...
Main Authors: | , , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Public Library of Science (PLoS)
2020-01-01
|
Series: | PLoS ONE |
Online Access: | https://doi.org/10.1371/journal.pone.0232384 |
id |
doaj-6412cd96090f41eea51db32c64f86c16 |
---|---|
record_format |
Article |
spelling |
doaj-6412cd96090f41eea51db32c64f86c162021-03-03T21:59:02ZengPublic Library of Science (PLoS)PLoS ONE1932-62032020-01-01158e023238410.1371/journal.pone.0232384Socio-ecological network structures from process graphs.Angelyn LaoHeriberto CabezasÁkos OroszFerenc FriedlerRaymond TanWe propose a process graph (P-graph) approach to develop ecosystem networks from knowledge of the properties of the component species. Originally developed as a process engineering tool for designing industrial plants, the P-graph framework has key advantages over conventional ecological network analysis techniques based on input-output models. A P-graph is a bipartite graph consisting of two types of nodes, which we propose to represent components of an ecosystem. Compartments within ecosystems (e.g., organism species) are represented by one class of nodes, while the roles or functions that they play relative to other compartments are represented by a second class of nodes. This bipartite graph representation enables a powerful, unambiguous representation of relationships among ecosystem compartments, which can come in tangible (e.g., mass flow in predation) or intangible form (e.g., symbiosis). For example, within a P-graph, the distinct roles of bees as pollinators for some plants and as prey for some animals can be explicitly represented, which would not otherwise be possible using conventional ecological network analysis. After a discussion of the mapping of ecosystems into P-graph, we also discuss how this framework can be used to guide understanding of complex networks that exist in nature. Two component algorithms of P-graph, namely maximal structure generation (MSG) and solution structure generation (SSG), are shown to be particularly useful for ecological network analysis. These algorithms enable candidate ecosystem networks to be deduced based on current scientific knowledge on the individual ecosystem components. This method can be used to determine the (a) effects of loss of specific ecosystem compartments due to extinction, (b) potential efficacy of ecosystem reconstruction efforts, and (c) maximum sustainable exploitation of human ecosystem services by humans. We illustrate the use of P-graph for the analysis of ecosystem compartment loss using a small-scale stylized case study, and further propose a new criticality index that can be easily derived from SSG results.https://doi.org/10.1371/journal.pone.0232384 |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Angelyn Lao Heriberto Cabezas Ákos Orosz Ferenc Friedler Raymond Tan |
spellingShingle |
Angelyn Lao Heriberto Cabezas Ákos Orosz Ferenc Friedler Raymond Tan Socio-ecological network structures from process graphs. PLoS ONE |
author_facet |
Angelyn Lao Heriberto Cabezas Ákos Orosz Ferenc Friedler Raymond Tan |
author_sort |
Angelyn Lao |
title |
Socio-ecological network structures from process graphs. |
title_short |
Socio-ecological network structures from process graphs. |
title_full |
Socio-ecological network structures from process graphs. |
title_fullStr |
Socio-ecological network structures from process graphs. |
title_full_unstemmed |
Socio-ecological network structures from process graphs. |
title_sort |
socio-ecological network structures from process graphs. |
publisher |
Public Library of Science (PLoS) |
series |
PLoS ONE |
issn |
1932-6203 |
publishDate |
2020-01-01 |
description |
We propose a process graph (P-graph) approach to develop ecosystem networks from knowledge of the properties of the component species. Originally developed as a process engineering tool for designing industrial plants, the P-graph framework has key advantages over conventional ecological network analysis techniques based on input-output models. A P-graph is a bipartite graph consisting of two types of nodes, which we propose to represent components of an ecosystem. Compartments within ecosystems (e.g., organism species) are represented by one class of nodes, while the roles or functions that they play relative to other compartments are represented by a second class of nodes. This bipartite graph representation enables a powerful, unambiguous representation of relationships among ecosystem compartments, which can come in tangible (e.g., mass flow in predation) or intangible form (e.g., symbiosis). For example, within a P-graph, the distinct roles of bees as pollinators for some plants and as prey for some animals can be explicitly represented, which would not otherwise be possible using conventional ecological network analysis. After a discussion of the mapping of ecosystems into P-graph, we also discuss how this framework can be used to guide understanding of complex networks that exist in nature. Two component algorithms of P-graph, namely maximal structure generation (MSG) and solution structure generation (SSG), are shown to be particularly useful for ecological network analysis. These algorithms enable candidate ecosystem networks to be deduced based on current scientific knowledge on the individual ecosystem components. This method can be used to determine the (a) effects of loss of specific ecosystem compartments due to extinction, (b) potential efficacy of ecosystem reconstruction efforts, and (c) maximum sustainable exploitation of human ecosystem services by humans. We illustrate the use of P-graph for the analysis of ecosystem compartment loss using a small-scale stylized case study, and further propose a new criticality index that can be easily derived from SSG results. |
url |
https://doi.org/10.1371/journal.pone.0232384 |
work_keys_str_mv |
AT angelynlao socioecologicalnetworkstructuresfromprocessgraphs AT heribertocabezas socioecologicalnetworkstructuresfromprocessgraphs AT akosorosz socioecologicalnetworkstructuresfromprocessgraphs AT ferencfriedler socioecologicalnetworkstructuresfromprocessgraphs AT raymondtan socioecologicalnetworkstructuresfromprocessgraphs |
_version_ |
1714814060921356288 |