Searcharxiv⌕ Search

arXiv subjects

N. Persky

Publications and source records attributed to N. Persky.

4 recordsLinked to original sources
arXiv1996

Cluster Dynamics for Randomly Frustrated Systems with Finite Connectivity

In simulations of some infinite range spin glass systems with finite connectivity, it is found that for any resonable computational time, the saturatedenergy per spin that is achieved by a cluster algorithm is lowered in comparison to that achieved by Metropolis dynamics.The gap between the average energies obtained from these two dynamics is robust with respect to variations of the annealing schedule. For some probability distribution of the interactions the ground state energy is calculated analytically within the replica symmetry assumptionand is found to be saturated by a cluster algorithm.

cond-mat↗
arXiv1996

Mean Field Behavior of Cluster Dynamics

The dynamic behavior of cluster algorithms is analyzed in the classical mean field limit. Rigorous analytical results below $T_c$ establish that the dynamic exponent has the value $z_{sw}=1$ for the Swendsen-Wang algorithm and $z_{uw}=0$ for the Wolff algorithm. An efficient Monte Carlo implementation is introduced, adapted for using these algorithms for fully connected graphs. Extensive simulations both above and below $T_c$ demonstrate scaling and evaluate the finite-size scaling function by means of a rather impressive collapse of the data.

cond-mat↗
arXiv1996

Macros and Multiscale Dynamics in Spin Glasses

We study the spacial and temporal multiscale properties of complex systems. We present accelerated algorithms for dilute spin glasses and display explicitly their relation to the effective dynamics of specific collective degrees of freedom (macros). We discuss the difficulties in applying multiscale-cluster algorithms(MCA) to general frustrated systems: MCA does not succeed to break the system into clusters. We relate these difficulties to rigorous negative results in systems with an ultrametric space of ground states: the tunneling between vacua cannot be expressed into an algorithm acting upon independent macros.

cond-mat↗