PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
March 1, 1975Advances in Applied Probability19 citations

Ergodic theorems for graph interactions

View Full Paper
DGDavid Griffeath

Key Points

Key points are not available for this paper at this time.

Abstract

A criterion for ergodicity of lattice interactions has been given by Dobrushin 2, and improved by Harris 3 and Holley 5. In this paper we present a simplified derivation of these results, and obtain stronger conditions for interactions on the one- and two-dimensional integer lattices, and the 3–Bethe lattice.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

David Griffeath (1975) studied this question.

synapsesocial.com/papers/6a0ee5a125c30b2cc7f9e573https://doi.org/10.1017/s0001867800040350
Ask AI
Helpful
Bookmark
Share
View Full Paper

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

  1. 1Ergodic Theorems for Weakly Interacting Infinite Systems and the Voter Model1975 · 1,137 citations
  2. 2Convergence of a local lattice process1975 · 4 citations
  3. 3Recurrent random walk of an infinite particle system1974 · 30 citations
  4. 4Lectures on analysis1969 · 479 citations
  5. 5Existence theorems for infinite particle systems1972 · 108 citations