A note on interactions-driven business cycles
β Scribed by Frank Westerhoff; Martin Hohnisch
- Publisher
- Springer-Verlag
- Year
- 2006
- Tongue
- English
- Weight
- 206 KB
- Volume
- 2
- Category
- Article
- ISSN
- 1860-711X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Nous prouvons une conjecture due & Bondy et Fan. Un cycle C d'un graphe G est dit m-dominant si tout sommet de V(G -C) est a distance au plus m de C. Notre r&t&at est: si G est k-connexe, et si G n'a pas de cycle m-dominant, alors il existe un stable de cardinal k + 1, dont les sommets sont deux 3 d
if G is a directed graph with n vertices and minimal outdegree k, then G contains a directed cycle of length at most In~k]. This conjecture is known to be true for k ~< 3. In this paper, we present a proof of the conjecture for the cases k = 4 and k = 5. We also present a new conjecture which implie
## Abstract The paper describes a procedure for examining shortβrun dynamic interactions among macroeconomic models by constructing aggregate stateβspace submodels for dynamic modes corresponding with shortβrun response patterns. Using the quarterly real GNP from the US, Germany, and Japan for 1974