J. D. Shore, M. Holzer and J. P. Sethna, Logarithmically slow domain growth in nonrandomly frustrated systems: Ising models with competing interactions, Phys. Rev. B 46 (1992), no. 18, 11376--11404. Home/Search Document Not in Database Summary APS Related Articles Check |
This paper is cited in the following contexts:
A Random Walk in Statistical Physics - Svenson (Correct)
....classes for coarsening phenomena have been identified by Lai, Mazenko and Valls [123] In addition to model A and B, they introduce two types of system that have logarithmic coarsening, R#t# # R # ##AT ## . Such logarithmic coarsening has been found in a simple tiling model by Shore et al. [124]. For strongly disordered systems, additional complications arise, since there is currently no consensus on how the energy of an excitation relates to any length scale in the system, or even if there are length scales at all in the systems. For instance, figure 20 in paper I seems to indicate ....
J. D. Shore, M. Holzer and J. P. Sethna, Logarithmically slow domain growth in nonrandomly frustrated systems: Ising models with competing interactions, Phys. Rev. B 46 (1992), no. 18, 11376--11404.
Complexity of Two-Dimensional Patterns - Lindgren, Moore, Nordahl (2000) (7 citations) (Correct)
.... was thought of quasicrystals up until a local algorithm was discovered [46] there may be no local way to grow large blocks from smaller ones; and attempts to relax large blocks from random initial conditions may lead to very slow, glass like dynamics, as in some 2 and 3 dimensional models (e.g. [54]) The diculty of growing a pattern from an initial seed, or relaxing to a pattern from a random initial condition, are themselves good de nitions of complexity, and not necessarily correlated with the complexity of recognizing a completed picture. 10 2.3 Deterministic Finite Automata, or DFA s ....
J.D. Shore, M. Holzer, and J.P. Sethna, \Logarithmically slow domain growth in nonrandomly frustrated systems: Ising models with competing interactions." Physical Review B 46 (1992) 376-404.
Complexity of Two-Dimensional Patterns - Lindgren, Moore, Nordahl (1997) (7 citations) (Correct)
.... was thought of quasicrystals up until a local algorithm was discovered [41] there may be no local way to grow large blocks from smaller ones; and attempts to relax large blocks from random initial conditions may lead to very slow, glass like dynamics, as in some 2 and 3 dimensional models (e.g. [49]) The difficulty of growing a pattern from an initial seed, or relaxing to a pattern from a random initial condition, are themselves good definitions of complexity, and not necessarily correlated with the complexity of recognizing a completed picture. 2.3 Deterministic Finite Automata, or ....
J.D. Shore, M. Holzer, and J.P. Sethna, "Logarithmically slow domain growth in nonrandomly frustrated systems: Ising models with competing interactions." Physical Review B 46 (1992) 376--404.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC