Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-14T11:07:26.243Z Has data issue: false hasContentIssue false
  • English
  • Français

Computing limiting stationary distributions of small noisy networks

Part of:Markov processes

Published online by Cambridge University Press:  14 July 2016

Fred Richman and
Katarzyna Winkowska-Nowak
Fred Richman*
Affiliation:
Florida Atlantic University
Katarzyna Winkowska-Nowak*
Affiliation:
University of Warsaw
*
∗ Postal address: Department of Mathematics, Florida Atlantic University, Boca Raton, FL 33431, USA. Email address: richman@fau.edu
∗∗ Postal address: Institute for Social Studies, University of Warsaw, Stawki 5/7, 00-183 Warsaw, Poland.
Get accessRights & Permissions [Opens in a new window]

Abstract

The dynamics of opinion transformation is modeled by a neural network with a nonnegative matrix of connections. Noise is introduced at each site, and the limit of the stationary distributions of the resulting Markov chains as the noise goes to zero is taken as an indication of what configurations will be seen. An algorithm for computing this limit is given, and a number of examples are worked out. Some of the mathematical ideas developed, such as visible states, time scales, and a calculus of indexed probabilities, are of independent interest.

Keywords

Markovnoisynetwork

MSC classification

Primary:60J20: Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.)60J22: Computational methods in Markov chains

Information

Type
Research Papers
Information
Journal of Applied Probability , Volume 39 , Issue 1 , March 2002, pp. 161 - 178
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.)

Article purchase

Temporarily unavailable

References

Cox, J. T., and Durrett, R. (1991). Nonlinear voting models. In Random Walks, Brownian Motion, and Interacting Particles Systems, Birkhäuser, Basel, pp. 189–201.Google Scholar
Feller, W. (1968). An Introduction to Probability Theory and Its Applications, Vol. 1, 3rd edn. John Wiley, New York.Google Scholar
Goles, E. and Martínez, S. (1990). Neural and Automata Networks. Kluwer, Dordrecht.Google Scholar
Hertz, J., Krogh, A., and Palmer, R. G. (1991). Introduction to the Theory of Neural Computation. Addison-Wesley, Boston.Google Scholar
Lewenstein, M., Nowak, A. and Latané, B. (1992). Statistical mechanics of social impact. Phys. Rev. 45, 763–776.CrossRefGoogle ScholarPubMed