Hostname: page-component-76fb5796d-25wd4 Total loading time: 0 Render date: 2024-04-28T09:16:08.081Z Has data issue: false hasContentIssue false

Asymptotics of locally-interacting Markov chains with global signals

Published online by Cambridge University Press:  01 July 2016

Ulrich Horst*
Affiliation:
Humboldt-Universität zu Berlin
*
Current address: Bendheim Center for Finance, Dial Lodge, 26 Prospect Avenue, Princeton University, Princeton, NJ 08540-5296, USA. Email address: uhorst@princeton.edu

Abstract

We study the long-run behaviour of interactive Markov chains on infinite product spaces. The behaviour at a single site is influenced by the local situation in some neighbourhood and by a random signal about the average situation throughout the whole system. The asymptotic behaviour of such Markov chains is analyzed on the microscopic level and on the macroscopic level of empirical fields. We give sufficient conditions for convergence on the macroscopic level. Combining a convergence result from the theory of random systems with complete connections with a perturbation of the Dobrushin-Vasserstein contraction technique, we show that macroscopic convergence implies that the underlying microscopic process has local asymptotic loss of memory.

Type
General Applied Probability
Copyright
Copyright © Applied Probability Trust 2002 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Brock, W. A. and Hommes, C. (1997). A rational route to randomness. Econometrica 65, 10591095.CrossRefGoogle Scholar
Dobrushin, R. L. (1968). Description of random fields by means of conditional probabilities and the conditions of its regularity. Theory Prob. Appl. 13, 201229.Google Scholar
Föllmer, H., (1979a). Macroscopic convergence of Markov chains on infinite product spaces. In Random Fields (Colloq. Math. Soc. Janos Bolyai 27), North-Holland, Amsterdam, pp. 363371.Google Scholar
Föllmer, H., (1979b). Tail structure of Markov chains on infinite product spaces. Z. Wahrscheinlichkeitsth. 50, 273285.CrossRefGoogle Scholar
Föllmer, H., (1982). A covariance estimate for Gibbs measures. J. Funct. Anal. 46, 387395.Google Scholar
Föllmer, H. and Horst, U. (2001). Convergence of locally and globally interacting Markov chains. Stoch. Process. Appl. 96, 99121.Google Scholar
Georgii, H. (1988). Gibbs Measures and Phase Transitions. Walter de Gruyter, Berlin.CrossRefGoogle Scholar
Horst, U. (2000). Asymptotics of locally and globally interacting Markov chains arising in microstructure models of financial markets. , Humboldt-Universität zu Berlin.Google Scholar
Iosifescu, M. and Grigorescu, S. (1990). Dependence with Complete Connections and Its Applications. Cambridge University Press.Google Scholar
Iosifescu, M. and Theodorescu, R. (1968). Random Processes and Learning. Springer, Berlin.Google Scholar
Kirman, A. (1998). On the transitory nature of gurus. Working paper, EHESS and Université de Marseille III.Google Scholar
Lebowitz, J. L., Maes, C. and Speer, E. R. (1990). Statistical mechanics of probabilistic cellular automata. J. Statist. Phys. 59, 117170.CrossRefGoogle Scholar
Norman, F. M. (1972). Markov Processes and Learning Models. Academic Press, New York.Google Scholar
Simon, B. (1993). The Statistical Mechanics of Lattice Gases. Princeton University Press.Google Scholar
Vasserstein, L. N. (1969). Markov processes over denumerable product of spaces describing large systems of automata. Problemy Peredaci Informacii 5, 6472.Google Scholar