Geography of local configurations (Q988755): Difference between revisions

A \(d\)-dimensional binary Markov random field on a lattice torus is considered, with emphasis on the properties of lattices of large size. The problem is set in the theory of random graphs where, upon the replacement of the edges with states of a binary Markov field, the standard notion of a subgraph is replaced by that of a local configuration. The appearance of a given local configuration, although probabilistic in nature, relies on the lattice size \(n\). Precise bounds for the probability for a local configuration to occur in a large ball are given. The speed at which local configurations occur is specified. A sufficient condition ensuring that a given local configuration is present everywhere in the graph is stated