Breakdown of the Finite-Time and -Population Scalings of the Large Deviation Function in the Large-Size Limit of a Contact Process
Esteban Guevara Hidalgo

TL;DR
This study extends the analysis of large deviation function estimator scalings in contact processes to larger system sizes, revealing that traditional $t^{-1}$ and $N_c^{-1}$ scalings break down and can even become unreliable with increasing system size.
Contribution
The paper introduces generalized exponents to characterize LDF estimator behavior across various system sizes, highlighting limitations of standard scalings in large systems.
Findings
Standard scalings fail for large system sizes.
Negative exponents indicate unreliable estimations.
Scaling laws depend on system size and can break down.
Abstract
In a recent study, the finite-time () and -population size () scalings in the evaluation of a large deviation function (LDF) estimator were analyzed by means of the cloning algorithm. These scalings provide valuable information about the convergence of the LDF estimator in the infinite- and infinite- limits. For the cases analyzed in that study, the scalings of the systematic errors of the estimator were found to behave as and in the large- and large- asymptotics. Moreover, it was shown how this convergence speed can be used in order to extract an asymptotic limit which resulted to render a better LDF estimation in comparison to the standard estimator. However, the validity of these scaling laws and thus, the convergence of the estimator was proved only in systems for which the number of sites (where the dynamics occurs) was small. In this…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
