Pith. Sign in

RECORD

Single-stage direct Langevin dynamic simulations of transitions over arbitrary high energy barriers: Concept of the energy-dependent temperature

Statistical Mechanics · Submitted 15 Jul 2021

abstract compiled · 2026-09-23 · no language-model review

The authors' main claim In our algorithm, simulation time required for the computation of the corresponding switching rate does not increase with energy barrier.

how it is stated · asserted 1.00 read the record →

Comment (0) Read on arXiv ↗
Cite ▾
arXiv ID2107.07293 (version 1)
Pith ID34J6JXJL, Pith's permanent record of this paper and its review
CitationDmitry Berkov, Elena K. Semenova, Natalia L. Gorn. "Single-stage direct Langevin dynamic simulations of transitions over arbitrary high energy barriers: Concept of the energy-dependent temperature." arXiv:2107.07293 (2021). https://pith.science/paper/34J6JXJL
Claim paper

The compiled record

The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.

Open the compiled record

Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-09-23: 1 request, 4,993 input tokens.

What the abstract itself states, as probabilities: claims first 0.07 · states limitation 0.09 · human participants 0.01 · controlled comparison 0.59 · randomized assignment 0.01 · states quantitative result 0.09 · compares with prior results 0.98 · mentions code or data availability 0.02.

The abstract, sentence by sentence

arXiv listing abstract v1. Results and the main claim are underlined; .

In this paper we present an algorithm which allows single-stage direct Langevin dynamics simulations of transitions over arbitrary high energy barriers employing the concept of the energy-dependent temperature (EDT). In our algorithm, simulation time required for the computation of the corresponding switching rate does not increase with energy barrier. This is achieved by using in simulations an effective temperature which depends on the system energy: around the energy minima this temperature is high and tends towards the room temperature when the energy approaches the saddle point value. Switching times computed via our EDT algorithm show an excellent agreement with results obtained with the established forward flux sampling (FFS) method. As the simulation time required by our method does not increase with the energy barrier, we achieve a very large speedup when compared even to the highly optimized FFS version. In addition, our method does not suffer from stability problems occurring in multi-stage algorithms (like FFS and 'energy bounce' methods) due to the multiplication of a large number of transition probabilities between the interfaces.

background contribution method result interpretation main claim

What the classifier reports for each sentence. The number is the probability it gave the label.
#sentencerolethe authors' own workstates the main conclusionstrength
s0 In this paper we present an algorithm which allows single-stage direct Langevin dynamics simulations of transitions over arbitrary high energy barriers employing the concept of the energy-dependent temperature (EDT). contribution 0.99 0.92 0.31 asserted 1.00
s1 In our algorithm, simulation time required for the computation of the corresponding switching rate does not increase with energy barrier. result 0.81 0.90 0.44 asserted 1.00
s2 This is achieved by using in simulations an effective temperature which depends on the system energy: around the energy minima this temperature is high and tends towards the room temperature when the energy approaches the saddle point value. method 1.00 0.81 0.10 asserted 1.00
s3 Switching times computed via our EDT algorithm show an excellent agreement with results obtained with the established forward flux sampling (FFS) method. result 1.00 0.92 0.18 asserted 1.00
s4 As the simulation time required by our method does not increase with the energy barrier, we achieve a very large speedup when compared even to the highly optimized FFS version. result 0.66 0.88 0.32 asserted 1.00
s5 In addition, our method does not suffer from stability problems occurring in multi-stage algorithms (like FFS and 'energy bounce' methods) due to the multiplication of a large number of transition probabilities between the interfaces. result 0.49 0.66 0.12 asserted 1.00

What kind of paper the classifier reports this is: method or tool 1.00 · evidence from simulation or computation 1.00.

What was examined, and what was not

sources read
  • arXiv listing abstract v1
not examined
  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers
levels run
  • P abstract
not run
  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. Every number in the measurements table is the authors', checked by code. Record as JSON

The paper
Original abstract

In this paper we present an algorithm which allows single-stage direct Langevin dynamics simulations of transitions over arbitrary high energy barriers employing the concept of the energy-dependent temperature (EDT). In our algorithm, simulation time required for the computation of the corresponding switching rate does not increase with energy barrier. This is achieved by using in simulations an effective temperature which depends on the system energy: around the energy minima this temperature is high and tends towards the room temperature when the energy approaches the saddle point value. Switching times computed via our EDT algorithm show an excellent agreement with results obtained with the established forward flux sampling (FFS) method. As the simulation time required by our method does not increase with the energy barrier, we achieve a very large speedup when compared even to the highly optimized FFS version. In addition, our method does not suffer from stability problems occurring in multi-stage algorithms (like FFS and 'energy bounce' methods) due to the multiplication of a large number of transition probabilities between the interfaces.

Human review

Discussion

Know something about this paper? Leave a comment, or highlight any passage above to comment on it.