IDEAS home Printed from https://ideas.repec.org/p/hal/journl/hal-01628570.html

Sustainable Network Dynamics

Author

Listed:
  • Arnaud A. Dragicevic

    (LEF - Laboratoire d'Economie Forestière - INRA - Institut National de la Recherche Agronomique - AgroParisTech)

  • Bernard Sinclair-Desgagné

    (HEC Montréal - HEC Montréal)

Abstract

We propose a dynamic graph-theoretic model for ecosystem management as a control over networked system composed of target nodes and unmarked nodes. The network is represented by a complete graph, in which all vertices are connected by a unique edge. Target nodes are attracted by the objective function issued from the external ecosystem management. They pull the network towards the objective position, which is either non-null or stationary. The management policy is considered successful if the graph remains connected in time, that is, target nodes attain the objective and unmarked nodes stay in the convex hull. At the time of the ecosystem network transfer, the model yields an Impossibility Theorem as well as a Sustainability Criterion to maintain full connectivity of the network. The latter can be easily linked to the general definition of sustainability as ecosystem integrity preservation. At last, we identify three management rules to ensure the maintenance of connectivity in time, given the properties of the objective transposition function, the nature of connections and utility updating time-delays between the nodes Nous proposons un modèle dynamique de gestion des écosystèmes par la théorie des graphes en tant que contrôle d'un système en réseau composé de nuds cibles et de nuds non identifiés. Le réseau est représenté par un graphe complet dans lequel tous les nuds sont connectés par une arête unique. Les nuds cibles sont attirés par une fonction objectif issue d'un processus externe de gestion des écosystèmes. Ils tirent le réseau vers la position de l'objectif qui peut être non-nulle ou stationnaire. La politique de gestion est considérée réussie si le graphe reste connecté dans le temps, c'est-à-dire que les nuds cibles atteignent l'objectif et les nuds non identifiés restent dans l'enveloppe convexe. Lors de la transposition du réseau écosystémique dans le temps, le modèle génère un Théorème de l'Impossibilité ainsi qu'un Critère de Durabilité qui maintien
(This abstract was borrowed from another version of this item.)

Suggested Citation

  • Arnaud A. Dragicevic & Bernard Sinclair-Desgagné, 2012. "Sustainable Network Dynamics," Post-Print hal-01628570, HAL.
    • Handle: RePEc:hal:journl:hal-01628570
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    Other versions of this item:

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. is not listed on IDEAS
    2. Dragicevic, Arnaud Z., 2020. "The economics of the Sylvo-Cynegetic equilibrium," Forest Policy and Economics, Elsevier, vol. 120(C).
    3. Arnaud Z. Dragicevic, 2019. "Market Coordination Under Non-Equilibrium Dynamics," Networks and Spatial Economics, Springer, vol. 19(3), pages 697-715, September.
    4. Dragicevic, Arnaud Z. & Shogren, Jason F., 2021. "Preservation Value in Socio-Ecological Systems," Ecological Modelling, Elsevier, vol. 443(C).
    5. repec:wsi:acsxxx:v:21:y:2018:i:08:n:s0219525918500182 is not listed on IDEAS

    More about this item

    JEL classification:

    • Q2 - Agricultural and Natural Resource Economics; Environmental and Ecological Economics - - Renewable Resources and Conservation
    • Q5 - Agricultural and Natural Resource Economics; Environmental and Ecological Economics - - Environmental Economics

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hal:journl:hal-01628570. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.