There is, I think, something ethereal about i —the square root of minus one. I remember first hearing about it at school. It seemed an odd beast at that time—an intruder hovering on the edge of reality.

Usually familiarity dulls this sense of the bizarre, but in the case of i it was the reverse: over the years the sense of its surreal nature intensified. It seemed that it was impossible to write mathematics that described the real world in …

I and i

Journal of Statistical Mechanics: theory and experiment

In ergodic physical systems, time-averaged quantities converge (for large times) to their ensemble-averaged values. Large deviation theory describes rare events where these time averages differ significantly from the corresponding ensemble averages. It allows estimation of the probabilities of these events, and their mechanisms. This theory has been applied to a range of physical systems, where it has yielded new insights into entropy production, current fluctuations, metastability, transport processes, and glassy behaviour. We review some of these developments, identifying general principles. We discuss a selection of dynamical phase transitions, and we highlight some connections between large-deviation theory and optimal control theory.

/pdf/ergodicity-and-large-deviations-in-physical-systems-with-16p7m9o025.pdf

Ergodicity and large deviations in physical systems with stochastic dynamics

Very often when studying non-equilibrium systems one is interested in analysing dynamical behaviour that occurs with very low probability, so called rare events. In practice, since rare events are by definition atypical, they are often difficult to access in a statistically significant way. What are required are strategies to "make rare events typical" so that they can be generated on demand. Here we present such a general approach to adaptively construct a dynamics that efficiently samples atypical events. We do so by exploiting the methods of reinforcement learning (RL), which refers to the set of machine learning techniques aimed at finding the optimal behaviour to maximise a reward associated with the dynamics. We consider the general perspective of dynamical trajectory ensembles, whereby rare events are described in terms of ensemble reweighting. By minimising the distance between a reweighted ensemble and that of a suitably parametrised controlled dynamics we arrive at a set of methods similar to those of RL to numerically approximate the optimal dynamics that realises the rare behaviour of interest. As simple illustrations we consider in detail the problem of excursions of a random walker, for the case of rare events with a finite time horizon; and the problem of a studying current statistics of a particle hopping in a ring geometry, for the case of an infinite time horizon. We discuss natural extensions of the ideas presented here, including to continuous-time Markov systems, first passage time problems and non-Markovian dynamics.

A reinforcement learning approach to rare trajectory sampling

We analyze collective motion that occurs during rare (large deviation) events in systems of active particles, both numerically and analytically. We discuss the associated dynamical phase transition to collective motion, which occurs when the active work is biased towards larger values, and is associated with alignment of particles' orientations. A finite biasing field is needed to induce spontaneous symmetry breaking, even in large systems. Particle alignment is computed exactly for a system of two particles. For many-particle systems, we analyze the symmetry breaking by an optimal-control representation of the biased dynamics, and we propose a fluctuating hydrodynamic theory that captures the emergence of polar order in the biased state.

Collective motion in large deviations of active particles

We describe a simple form of importance sampling designed to bound and compute large-deviation rate functions for time-extensive dynamical observables in continuous-time Markov chains. We start with a model, defined by a set of rates, and a time-extensive dynamical observable. We construct a reference model, a variational ansatz for the behavior of the original model conditioned on atypical values of the observable. Direct simulation of the reference model provides an upper bound on the large-deviation rate function associated with the original model, an estimate of the tightness of the bound, and, if the ansatz is chosen well, the exact rate function. The exact rare behavior of the original model does not need to be known in advance. We use this method to calculate rate functions for currents and counting observables in a set of network- and lattice models taken from the literature. Straightforward ansatze yield bounds that are tighter than bounds obtained from Level 2.5 of large deviations via approximations that involve uniform scalings of rates. We show how to correct these bounds in order to recover the rate functions exactly. Our approach is complementary to more specialized methods and offers a physically transparent framework for approximating and calculating the likelihood of dynamical large deviations.

/pdf/direct-evaluation-of-dynamical-large-deviation-rate-2yugm7xui3.pdf

Direct evaluation of dynamical large-deviation rate functions using a variational ansatz.

We show how to calculate the likelihood of dynamical large deviations using evolutionary reinforcement learning. An agent, a stochastic model, propagates a continuous-time Monte Carlo trajectory and receives a reward conditioned upon the values of certain path-extensive quantities. Evolution produces progressively fitter agents, eventually allowing the calculation of a piece of a large-deviation rate function for a particular model and path-extensive quantity. For models with small state spaces the evolutionary process acts directly on rates, and for models with large state spaces the process acts on the weights of a neural network that parameterizes the model's rates. This approach shows how path-extensive physics problems can be considered within a framework widely used in machine learning.

/pdf/evolutionary-reinforcement-learning-of-dynamical-large-5fhacrwpc0.pdf

Evolutionary reinforcement learning of dynamical large deviations.

We show how to bound and calculate the likelihood of dynamical large deviations using evolutionary reinforcement learning. An agent, a stochastic model, propagates a continuous-time Monte Carlo trajectory and receives a reward conditioned upon the values of certain path-extensive quantities. Evolution produces progressively fitter agents, potentially allowing the calculation of a piece of a large-deviation rate function for a particular model and path-extensive quantity. For models with small state spaces, the evolutionary process acts directly on rates, and for models with large state spaces, the process acts on the weights of a neural network that parameterizes the model's rates. This approach shows how path-extensive physics problems can be considered within a framework widely used in machine learning.

/pdf/evolutionary-reinforcement-learning-of-dynamical-large-4oh04sghfb.pdf

Singularities of dynamical large-deviation functions are often interpreted as the signal of a dynamical phase transition and the coexistence of distinct dynamical phases, by analogy with the correspondence between singularities of free energies and equilibrium phase behavior. Here we study models of driven random walkers on a lattice. These models display large-deviation singularities in the limit of large lattice size, but the extent to which each model's phenomenology resembles a phase transition depends on the details of the driving. We also compare the behavior of ergodic and nonergodic models that present large-deviation singularities. We argue that dynamical large-deviation singularities indicate the divergence of a model timescale, but not necessarily one associated with cooperative behavior or the existence of distinct phases.

/pdf/varied-phenomenology-of-models-displaying-dynamical-large-57hn98vxl9.pdf

Varied phenomenology of models displaying dynamical large-deviation singularities.

Handle everyday research tasks with reliable, citation-backed results

Your personal Research Agent to handle research tasks with citation-backed results

Popular Tasks used by Researchers

How can I help with your research?

Meet SciSpace

Get more enhanced response by uploading the PDFs you want me to reference.

No relevant PDFs in your library

SciSpace is the AI research assistant for academics. Run systematic literature reviews on 280M+ papers, and write papers with cited sources. Trusted by 1M+ students, PhDs & researchers.

SciSpace | AI for Research

Analyze PDFs

Code & Manuscripts

Funding & Grants

Literature & Patents

Medical & Clinical Data

Systematic Review

Visualize & Present

Web & Data

Build a Google Scholar-like website for your research.

Build a website

Create charts and images for your research

Create a Chart

Write a paper for submission to a journal

Draft a manuscript

Patent Search

Design eye-catching scientific posters in minutes.

Scientific Poster Generation

Systematic Literature Review

One task is running at the moment. Your messages will be shown right after.

Drag and drop or click here to browse

Loved by <highlight>1 million+</highlight> researchers

Extract a list of specific topics and their sources from unstructured text

Topics

Compare and analyze relevant papers that matches with your search

Papers

Get insights from PDFs and bookmarked papers from your library

My library

Recent searches

Try searching for:

Catch AI-generated content in scholarly and non-scholarly content

{ai} Detector

Ai Writer

Get PDF Summaries, highlighted text explanations 

Chat with PDF

Effortlessly create in-text citations and bibliographies in APA and 2,500 other formats

Citation generator

Get explanations, summaries, and answers on academic papers

Ease up your research workflow with {scispace}'s cohort of exciting AI tools

Elevate your academic writing skills and convey your ideas the way you want

Paraphraser

Explore our range of reading and writing tools

Your file is being prepared and should be ready in a few minutes. If it's a large file, it might take a bit longer. You can close this window, and we'll email you the file when it's done.

You have reached a maximum limit of <strong>{limit}</strong> columns in the table. Remove at least <strong>1</strong> column to add or create another one.

Daniel Jacobson

Author Tools

Chat about Author

Papers

Direct evaluation of dynamical large-deviation rate functions using a variational ansatz.

Evolutionary reinforcement learning of dynamical large deviations.

Evolutionary reinforcement learning of dynamical large deviations.

Varied phenomenology of models displaying dynamical large-deviation singularities.