Papers › Minimum time connection between non-equilibrium steady states: the Brownian gyrator
Minimum time connection between non-equilibrium steady states: the Brownian gyrator
A. Patrón, C. A. Plata, A. Prados
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We study the problem of minimising the connection time between non-equilibrium steady states of the Brownian Gyrator. This is a paradigmatic model in non-equilibrium statistical mechanics, an overdamped Brownian particle trapped in a two-dimensional elliptical potential, with the two degrees of freedom (x,y) coupled to two, in principle different, thermal baths with temperatures Tₓ and T_y, respectively. Application of Pontryagin's Maximum Principle reveals that shortest protocols belong to the boundaries of the control set defined by the limiting values of the parameters (k,u) characterising the elliptical potential. We identify two classes of optimal minimum time protocols, i.e. brachistochrones: (i) regular bang-bang protocols, for which (k,u) alternatively take their minimum and maximum values allowed, and (ii) infinitely degenerate singular protocols. We thoroughly investigate the minimum connection time over the brachistochrones in the limit of having infinite capacity for compression. A plethora of striking phenomena emerge: sets of states attained at null connection times, discontinuities in the connection time along adjacent target states, and the fact that, starting from a state in which the oscillators are coupled, uncoupled states are impossible to reach in a finite time.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections