ﻻ يوجد ملخص باللغة العربية
Nucleation is considered near the pseudospinodal in a one-dimensional $phi^4$ model with a non-conserved order parameter and long-range interactions. For a sufficiently large system or a system with slow relaxation to metastable equilibrium, there is a non-negligible probability of nucleation occurring before reaching metastable equilibrium. This process is referred to as transient nucleation. The critical droplet is defined to be the configuration of maximum likelihood that is dynamically balanced between the metastable and stable wells. Time-dependent droplet profiles and nucleation rates are derived, and theoretical results are compared to computer simulation. The analysis reveals a distribution of nucleation times with a distinct peak characteristic of a nonstationary nucleation rate. Under the quench conditions employed, transient critical droplets are more compact than the droplets found in metastable equilibrium simulations and theoretical predictions.
We develop a theory in order to describe the effect of relaxation in a condensed medium upon the quantum decay of a metastable liquid near the spinodal at low temperatures. We find that both the regime and the rate of quantum nucleation strongly depe
We analyze the structure of fluctuations near critical points and spinodals in mean-field and near-mean-field systems. Unlike systems that are non-mean-field, for which a fluctuation can be represented by a single cluster in a properly chosen percola
We propose a mean field theory for the localization of damage in a quasistatic fuse model on a cylinder. Depending on the quenched disorder distribution of the fuse thresholds, we show analytically that the system can either stay in a percolation reg
Universal scaling of entanglement estimators of critical quantum systems has drawn a lot of attention in the past. Recent studies indicate that similar universal properties can be found for bipartite information estimators of classical systems near p
Optimizing a high-dimensional non-convex function is, in general, computationally hard and many problems of this type are hard to solve even approximately. Complexity theory characterizes the optimal approximation ratios achievable in polynomial time