Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userCoarse-graining the Dynamics of a Driven Interface in the Presence of Mobile Impurities: Effective Description via Diffusion Maps
219
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Developing effective descriptions of the microscopic dynamics of many physical phenomena can both dramatically enhance their computational exploration and lead to a more fundamental understanding of the underlying physics. Previously, an effective description of a driven interface in the presence of mobile impurities, based on an Ising variant model and a single empirical coarse variable, was partially successful; yet it underlined the necessity of selecting additional coarse variables in certain parameter regimes. In this paper we use a data mining approach to help identify the coarse variables required. We discuss the implementation of this diffusion map approach, the selection of a similarity measure between system snapshots required in the approach, and the correspondence between empirically selected and automatically detected coarse variables. We conclude by illustrating the use of the diffusion map variables in assisting the atomistic simulations, and we discuss the translation of information between fine and coarse descriptions using lifting and restriction operators.
rate research
Read More
Lumping a Markov process introduces a coarser level of description that is useful in many contexts and applications. The dynamics on the coarse grained states is often approximated by its Markovian component. In this letter we derive finite-time bounds on the error in this approximation. These results hold for non-reversible dynamics and for probabilistic mappings between microscopic and coarse grained states.
We present a computer-assisted approach to coarse-graining the evolutionary dynamics of a system of nonidentical oscillators coupled through a (fixed) network structure. The existence of a spectral gap for the coupling network graph Laplacian suggests that the graph dynamics may quickly become low-dimensional. Our first choice of coarse variables consists of the components of the oscillator states -their (complex) phase angles- along the leading eigenvectors of this Laplacian. We then use the equation-free framework [1], circumventing the derivation of explicit coarse-grained equations, to perform computational tasks such as coarse projective integration, coarse fixed point and coarse limit cycle computations. In a second step, we explore an approach to incorporating oscillator heterogeneity in the coarse-graining process. The approach is based on the observation of fastdeveloping correlations between oscillator state and oscillator intrinsic properties, and establishes a connection with tools developed in the context of uncertainty quantification.
We study the coarse-graining approach to derive a generator for the evolution of an open quantum system over a finite time interval. The approach does not require a secular approximation but nevertheless generally leads to a Lindblad-Gorini-Kossakowski-Sudarshan generator. By combining the formalism with Full Counting Statistics, we can demonstrate a consistent thermodynamic framework, once the switching work required for the coupling and decoupling with the reservoir is included. Particularly, we can write the second law in standard form, with the only difference that heat currents must be defined with respect to the reservoir. We exemplify our findings with simple but pedagogical examples.
Big data often has emergent structure that exists at multiple levels of abstraction, which are useful for characterizing complex interactions and dynamics of the observations. Here, we consider multiple levels of abstraction via a multiresolution geometry of data points at different granularities. To construct this geometry we define a time-inhomogeneous diffusion process that effectively condenses data points together to uncover nested groupings at larger and larger granularities. This inhomogeneous process creates a deep cascade of intrinsic low pass filters on the data affinity graph that are applied in sequence to gradually eliminate local variability while adjusting the learned data geometry to increasingly coarser resolutions. We provide visualizations to exhibit our method as a continuously-hierarchical clustering with directions of eliminated variation highlighted at each step. The utility of our algorithm is demonstrated via neuronal data condensation, where the constructed multiresolution data geometry uncovers the organization, grouping, and connectivity between neurons.
The fluctuation-dissipation theorem is a central result in statistical mechanics and is usually formulated for systems described by diffusion processes. In this paper, we propose a generalization for a wider class of stochastic processes, namely the class of Markov processes that satisfy detailed balance and a large-deviation principle. The generalized fluctuation-dissipation theorem characterizes the deterministic limit of such a Markov process as a generalized gradient flow, a mathematical tool to model a purely irreversible dynamics via a dissipation potential and an entropy function: these are expressed in terms of the large-deviation dynamic rate function of the Markov process and its stationary distribution. We exploit the generalized fluctuation-dissipation theorem to develop a new method of coarse-graining and test it in the context of the passage from the diffusion in a double-well potential to the jump process that describes the simple reaction $A rightleftarrows B$ (Kramers escape problem).
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
