2000 character limit reached
An Infinite Swapping Approach to the Rare-Event Sampling Problem
Published 30 Jun 2011 in cond-mat.stat-mech | (1106.6305v1)
Abstract: We describe a new approach to the rare-event Monte Carlo sampling problem. This technique utilizes a symmetrization strategy to create probability distributions that are more highly connected and thus more easily sampled than their original, potentially sparse counterparts. After discussing the formal outline of the approach and devising techniques for its practical implementation, we illustrate the utility of the technique with a series of numerical applications to Lennard-Jones clusters of varying complexity and rare-event character.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.