A Monte Carlo algorithm to measure probabilities of rare events in cluster-cluster aggregation
arXiv:2210.17267 · doi:10.1016/j.cpc.2023.108727
Abstract
We develop a biased Monte Carlo algorithm to measure probabilities of rare events in cluster-cluster aggregation for arbitrary collision kernels. Given a trajectory with a fixed number of collisions, the algorithm modifies both the waiting times between collisions, as well as the sequence of collisions, using local moves. We show that the algorithm is ergodic by giving a protocol that transforms an arbitrary trajectory to a standard trajectory using valid Monte Carlo moves. The algorithm can sample rare events with probabilities of the order of and lower. The algorithm's effectiveness in sampling low-probability events is established by showing that the numerical results for the large deviation function of constant-kernel aggregation reproduce the exact results. It is shown that the algorithm can obtain the large deviation functions for other kernels, including gelling ones, as well as the instanton trajectories for atypical times. The dependence of the autocorrelation times, both temporal and configurational, on the different parameters of the algorithm is also characterized.
arXiv comment26 pages, 10 figures
References in corpus (27)
- The large deviation approach to statistical mechanics
- Scaling Theory and Exactly Solved Models In the Kinetics of Irreversible Aggregation
- Computation of extreme heat waves in climate models using a large deviation algorithm
- Size distribution of particles in Saturn's rings from aggregation and fragmentation
- Shock-Like Dynamics of Inelastic Gases
- Numerical computation of rare events via large deviation theory
- Dynamics of Freely Cooling Granular Gases
- Large-deviation properties of largest component for random graphs
- Rare event algorithm study of extreme warm summers and heat waves over Europe
- Stationary Kolmogorov Solutions of the Smoluchowski Aggregation Equation with a Source Term
- Distribution of diameters for Erdös-Rényi random graphs
- Aggregation Dynamics of Rigid Polyelectrolytes
- Cluster-Cluster Aggregation as an Analogue of a Turbulent Cascade : Kolmogorov Phenomenology, Scaling Laws and the Breakdown of self-similarity
- Energy decay in three-dimensional freely cooling granular gas
- Ballistic aggregation: a solvable model of irreversible many particles dynamics
- Hard core run and tumble particles on a one dimensional lattice
- Persistence properties of a system of coagulating and annihilating random walkers
- Stationary mass distribution and nonlocality in models of coalescence and shattering
- Breakdown of Kolmogorov scaling in models of cluster aggregation with deposition
- Variational approach to rare event simulation using least-squares regression
- Probing the large deviations of the Kardar-Parisi-Zhang equation at short time with an importance sampling of directed polymers in random media
- On the large time asymptotics of decaying Burgers turbulence
- Instanton based importance sampling for rare events in stochastic PDEs
- Kang-Redner Anomaly in Cluster-Cluster Aggregation
- Direct simulation Monte Carlo for new regimes in aggregation-fragmentation kinetics
- Lattice models for ballistic aggregation in one-dimension
- Non-extensive super-cluster states in aggregation with fragmentation