Anomalous scaling and phase transition in large deviations of dynamical observables of stationary Gaussian processes
Abstract: We study large deviations, over a long time window $T \to \infty$, of the dynamical observables $A_n = \int_{0}{T} xn(t) dt$, $n=3,4,\dots$, where $x(t)$ is a centered stationary Gaussian process in continuous time. We show that, for short-correlated processes the probability density of $A_n$ exhibits an anomalous scaling $P(A_n,T) \sim \exp[-Tμ f_n(ΔA_n T{-ν})]$ at $T\to \infty$ while keeping $ΔA_n T{-ν}$ constant. Here $ΔA_n$ is the deviation of $A_n$ from its ensemble average. The anomalous exponents $μ$ and $ν$ depend on $n$ and are smaller than $1$, whereas the rate function $f_n(z)$ exhibits a first-order dynamical phase transition (DPT) which resembles condensation transitions observed in many systems. The same type of anomaly and DPT, with the same $μ$ and $ν$, was previously uncovered for the Ornstein-Uhlenbeck process - the only stationary Gaussian process which is also Markovian. We also uncover an anomalous behavior and a similar DPT in the long-correlated Gaussian processes. However, the anomalous exponents $μ$ and $ν$ are determined in this case not only by $n$ but also by the power-law long-time decay $\sim |t|{-α}$ of the covariance. The different anomalous scaling behavior is a consequence of a faster-than-linear scaling with $T$ of the variance of $A_n$. Finally, for sufficiently long-ranged correlations, $α<2/n$, the DPT disappears, giving way to a smooth crossover between the regions of typical, Gaussian fluctuations and large deviations. The basic mechanism behind the DPT is the existence of strongly localized optimal paths of the process conditioned on very large $A_n$ and coexistence between the localized and delocalized paths of the conditioned process. Our theoretical predictions are corroborated by replica-exchange Wang-Landau simulations where we could probe probability densities down to $10{-200}$.
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.