Network Price Identity

Arnaud Dragicevic () and Ahmed Barkaoui ()
Additional contact information
Arnaud Dragicevic: Chaire Forêts pour Demain, AgroParisTech-Office National des Forêts

No 2015-11, Working Papers - Cahiers du LEF from Laboratoire d'Economie Forestiere, AgroParisTech-INRA

Abstract: We model a closed-loop network of agents distributed among subnetworks and study the conditions that satisfy the time-dependent stability of network connectedness in presence of random perturbations. We show that the evolutionary stability of the network structure depends on the prevalence of perturbations on between-subnetwork coupling. Our findings permit to unveil the conservation value of the topological structure, as well as to situate the Price theorem, both in its standard and expanded forms, in the context of network evolutionary variational identity. Whenever the dynamics deals with interconnected structures, the network-based framework is more suitable to address the questions that revolve around the stability of input-output systems.

Keywords: bioeconomics; forest planning; mean-variance model; mixed-species forests; climate Change (search for similar items in EconPapers)
JEL-codes: C61 C65 C67 L23 Q57 (search for similar items in EconPapers)
Pages: 21 pages
Date: 2015-11, Revised 2015-11
New Economics Papers: this item is included in nep-hme and nep-net
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www6.nancy.inra.fr/lef/Cahiers-du-LEF/2015/2015-11 First version, 2010

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:lef:wpaper:2015-11

Access Statistics for this paper

More papers in Working Papers - Cahiers du LEF from Laboratoire d'Economie Forestiere, AgroParisTech-INRA Contact information at EDIRC.
Bibliographic data for series maintained by Sylvain CAURLa ( this e-mail address is bad, please contact ).