Pith. sign in

REVIEW 4 major objections 4 minor 68 references

Coarse-graining dynamics to maximize irreversibility

T0 review · 4 major / 4 minor · reviewed 2026-08-07 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read Iteratively merging states that lose the least irreversibility recovers optimal coarse-grained dynamics, and in hippocampal data it rediscovers a place-cell map without positional information.

desk verdict A clean and useful greedy coarse-graining rule with a real validation on kinesin, undercut by a neural application whose state-space construction is circularly tuned. read the letter →

arxiv 2506.01909 v1 pith:S536TPN6 submitted 2025-06-02 cond-mat.stat-mech cond-mat.dis-nnphysics.bio-phq-bio.QM

Qiwei Yu , Matthew P. Leighton , Christopher W. Lynn This is my paper · ORCID
classification cond-mat.stat-mechcond-mat.dis-nnphysics.bio-phq-bio.QM
keywords irreversibilitycoarse-grainingentropyproductionnonequilibriumdynamicsMarkovchainsplacecellshippocampusrenormalizationgroup
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper proposes that irreversibility itself is the right organizing principle for simplifying nonequilibrium dynamics. It defines a model-free coarse-graining that merges microstates in pairs, choosing at each step the merger that destroys the least local irreversibility, measured through steady-state fluxes. The paper shows that this procedure keeps as much dissipative information as possible in the reduced description, and demonstrates it on molecular-motor cycles, a biochemical oscillator, and hippocampal calcium imaging. In the neural data, the procedure groups neurons into macroscopic place cells whose firing encodes the mouse's position, even though no positional information is given to the algorithm.

What carries the argument

The engine of the argument is the pairwise merge cost of Eq. (4), $\Delta\sigma_{\alpha\beta}$, which for candidate states $\alpha$ and $\beta$ subtracts the irreversibility lost when $\alpha$ and $\beta$ are fused, including both the flux directly between them and the changes in fluxes to all other states $\gamma$. The procedure repeatedly merges the pair with the smallest such drop, starting from the measured fluxes $J_{ij}$ and steady-state probabilities; because total irreversibility can only fall under coarse-graining, the ordering of merges defines a sequence of macrostates that locally maximizes retained irreversibility at every scale. In the neural application the same rule is applied to a transition matrix inferred from spike timing, so the 'states' are neurons and the macrostates are subsets of the population.

What would settle it

Shuffle the order of neural transitions while preserving each neuron's firing rate and the empirical joint activity statistics, rerun the optimal coarse-graining, and check whether the macrostates still localize along the track: if shuffled data retain the place-cell structure and high spatial mutual information, the directed fluxes are not doing the work and the central claim fails; if the structure disappears, the claim survives.

Watch

Extended reading notes

Core claim

According to the paper, for any nonequilibrium system with measured steady-state fluxes, coarse-graining can only decrease the total irreversibility (the local entropy production associated with individual transitions), so for each target number of macrostates there is generically a coarse-graining that preserves as much of it as possible. Because searching over all partitions is combinatorially intractable, the paper introduces an iterative rule that merges the pair of states producing the smallest drop in irreversibility, and it reports that this greedy procedure finds the globally optimal coarse-graining in a six-state model where exact enumeration is possible. The paper's headline empirical claim is that applying this rule to hippocampal activity, modeled as a Markov chain over 'most recently active' neurons, yields macrostates that function as place cells, with a directed flux cycle matching the mouse's navigation, and that this structure arises without any access to position or behavior.

Load-bearing premise

The neural result rests on treating the recorded population activity as a Markov chain whose state is the most recently active neuron, with transitions defined by a fixed 3-second delay chosen to maximize irreversibility; if that construction misses the real dynamics, the recovered place-cell structure could be an artifact of the state definition rather than evidence about hippocampal irreversibility.

Editorial extensions

If this is right

  • Any dynamical time series can be coarse-grained without a model: fluxes alone define the merge order, so the procedure applies to systems whose underlying equations are unknown.
  • The preserved macrostates tend to organize around the dominant dissipative structures, such as the reaction cycle in kinesin, the limit cycle in the Brusselator, and the navigation loop in the hippocampus.
  • The neural result implies that irreversibility maximization can serve as an unsupervised way to discover meaningful latent variables, such as an animal's position, from collective activity alone.
  • The framework sets up the question of how much macroscopic irreversibility can survive coarse-graining in a given system, and whether consistent small-scale dissipative structures underlie large-scale function.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • A natural next test is whether the same procedure recovers known latent variables in other neural recordings, such as head direction, decision variables, or replay sequences, where the ground-truth state is known independently.
  • The optimal coarse-graining is a form of lossy compression whose distortion measure is dissipation rather than prediction error; comparing it with information-bottleneck methods might clarify when maximally irreversible representations coincide with maximally predictive ones.
  • The greedy merge rule is not guaranteed to find the global optimum in large state spaces, so an open question is whether the place-cell structure in the hippocampus is exactly the global maximum-irreversibility partition or a local one that still retains most of the dissipative flux.
  • If the delay parameter $\Delta t = 3$ s were chosen by the same irreversibility-maximization criterion, the method would become fully parameter-free in principle; testing different state constructions, such as population vectors instead of the most-recent-neuron state, would show how much of the recovered map depends on that choice.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 4 minor

Summary. The paper proposes an iterative coarse-graining procedure for nonequilibrium systems: starting from measured fluxes between microscopic states, it repeatedly merges pairs of states whose combination causes the smallest drop in the local irreversibility measure defined by Eqs. (1)-(2). The procedure is tested on three systems: a four- and six-state kinesin chemical cycle, a Brusselator model with roughly 10^4 states, and hippocampal calcium-imaging recordings from a mouse running on a virtual track. In the kinesin case the greedy procedure is checked against exhaustive enumeration and matches the global optimum. For the Brusselator the procedure preserves far more irreversibility than random or square-block merging and partitions state space along the limit cycle. For the neural data, the procedure merges neurons into groups that resemble place cells, yields high mutual information between coarse-grained activity and position, and produces a directed loop of flux. The authors conclude that a model-free, irreversibility-preserving coarse-graining can reveal the dissipative backbone of a system directly from measured dynamics.

Significance. If the claims hold, the paper offers a practical, model-free tool for identifying large-scale dissipative structure from time-series data, with potentially broad applications in active matter, biochemistry, and neuroscience. The kinesin exhaustive check is a genuine strength, as is the clear formulation of the local merge cost in Eq. (4). The nontrivial part of the paper is not that the 'optimal' procedure outperforms random merging in preserving irreversibility—that is partly by construction—but that the resulting partitions recover meaningful physical structure (the Brusselator limit cycle, hippocampal place fields). The neural application is provocative and could be important, but it depends on a somewhat ad hoc delay-window construction of the Markov chain, and the circularity between delay selection and the optimization objective needs to be addressed before the strongest claims can be accepted.

major comments (4)
  1. [Maximum irreversibility coarse-graining, Eq. (4)] The rule in Eq. (4) is a greedy, locally optimal rule: at each step it merges the pair with the smallest immediate irreversibility drop and then repeats. The manuscript nevertheless refers to the resulting partitions as 'optimal' throughout (e.g., Fig. 2 captions, Fig. 3 captions, and the main text 'the optimal CG'). Global optimality is verified only for the six-state kinesin model in Fig. 1(e), where exhaustive enumeration is possible. For the Brusselator (N ~ 10^4) and the neural data (N = 1485), no such verification is provided. Please rename the procedure 'greedy' or 'locally optimal' except where global optimality is proven, and state explicitly that for large systems the algorithm provides a heuristic that locally maximizes preserved irreversibility.
  2. [Neural activity, Fig. 3] The choice of the delay window is coupled to the objective that the coarse-graining procedure maximizes. The text states, 'We use a time delay of Δt=3s, which we find produces neural dynamics with the largest irreversibility', and the CG procedure then preserves that same irreversibility. Since the state-space construction itself—most-recently active neuron with transitions counted within a fixed delay—can generate apparent cyclic flux, the central neural claims need additional support. Please provide (i) a shuffle control in which the ordering of neural firing events is randomized while the delay window is kept fixed, to show that the recovered place-cell structure and the macroscopic loop in Fig. 3(e) are destroyed; (ii) a scan over Δt showing that the ten-state partition, the place fields, and the mutual information in Fig. 3(d) are stable and are not simply the partitions that happen to best preserve the particular σ maximized by the delay choice; and (iii) confidence intervals on the irreversibility and mutual information curves, for instance from cross-validated flux estimates.
  3. [Biochemical oscillator, Fig. 2(b)] For the Brusselator, the search is explicitly restricted to coarse-grainings that combine neighboring states: 'To preserve locality, we only consider CGs that combine neighboring states.' The red curve in Fig. 2(b) is therefore the best among neighboring-state merges, not the global optimum over all partitions. The comparison with random and square blocking remains informative, but the text should not imply that this is the globally optimal CG. Relatedly, the Introduction's statement that 'there is a unique coarse-graining with maximum irreversibility' is too strong; degeneracies in the merge costs can yield multiple CGs with the same preserved irreversibility, and the paper should say 'generically unique' or 'a coarse-graining' instead.
  4. [Neural activity, state construction (main text and SM)] The description of the neural Markov chain is under-specified: the main text says the state is the most recent neuron to fire and that a transition i→j is counted when neuron i firing leads to neuron j firing after a time delay Δt = 3 s. This is ambiguous when several neurons fire within the delay window or when the same neuron fires repeatedly. The supplemental material should give the exact counting algorithm (e.g., how ties and repeated firings are handled, how the delay is applied relative to imaging frame boundaries), because the numerical values of the fluxes Jij, and hence the entire irreversibility measure, depend on this construction.
minor comments (4)
  1. [Fig. 2(b) inset] The axis labels '10°2', '10°1', '100' in the inset appear to be intended as powers of ten; please use standard superscript formatting (10^-2, 10^-1, 10^0).
  2. [Captions of Figs. 2 and 3] Once the global-optimality language is adjusted, the captions should also use 'greedy' or 'locally optimal' instead of 'Optimal' to avoid overstating the result.
  3. [Fig. 3(c)] The text mentions that the first macro-cell contains the majority of non-place cells, but this macro-cell is not visibly distinguished in the figure; please mark it or add a panel so the reader can identify which field is the uniform one.
  4. [General] A statement on code and data availability would be helpful, particularly for the neural analysis, so that the shuffle and delay-robustness checks can be reproduced by readers.

Circularity Check

1 steps flagged · score 5.0 of 10

Irreversibility-preservation advantage over random baselines is definitional; the spatial and limit-cycle recovery results provide independent support.

  1. self definitional [Section 'Maximum irreversibility coarse-graining', Eq. (4); Figs. 1(e), 2(b), 3(b)]
    "Combining the pair of states that minimizes ∆σαβ and repeating this process until the desired number of macrostates is reached, we arrive at an efficient CG that locally maximizes the irreversibility. ... Strikingly, the optimal CG, computed using our iterative procedure, preserves orders of magnitude more irreversibility than these naïve methods [Fig. 2(b), red]."

    The success metric is the objective being optimized. 'Optimal' is defined as the merge sequence minimizing the irreversibility drop ∆σ, so the red curves preserving more irreversibility than random, square-block, or correlation-based merges is guaranteed by construction: the baselines do not optimize Eq. (4). Figures 1(e), 2(b), and 3(b) therefore compare an optimizer against non-optimizers on the optimizer's own loss function, and the gap cannot independently validate the method. The genuinely independent evidence is elsewhere: exact enumeration for the six-state kinesin network, the Brusselator macrostates aligning with the limit cycle, and the hippocampal place-field/mutual-information recovery, none of which appears in the objective.

full rationale

The paper's core algorithm is explicitly defined as minimizing the irreversibility loss in Eq. (4), so its 'optimal' coarse-grainings preserving more irreversibility than random merges is a definitional consequence, not an empirical discovery. I flag that as one self-definitional step. However, the central scientific claims do not reduce entirely to this objective. The kinesin optimal CG is checked against exhaustive enumeration; the Brusselator CG is shown to recover the limit-cycle structure without being given any spatial information; and the hippocampal macrostates are validated by mutual information with mouse position and by a directed flux loop, both external to the optimized irreversibility. The neural delay choice Δt=3 s is selected by maximizing the same σ, which weakens claims about the absolute magnitude of neural irreversibility and is a robustness concern, but it is not presented as a prediction and does not by itself force the spatial representation results. No load-bearing self-citation chain or imported uniqueness theorem was found. Overall, the paper has genuine independent content, so the circularity score is moderate rather than high.

Assumptions & free parameters 1 free parameters · 5 assumptions · 0 invented entities

No new physical entities are introduced. The main free parameter is the neural delay Delta t, selected to maximize the very quantity the method then preserves. The axioms capture the steady-state Markov description, the choice of local irreversibility as the objective, the locality constraint in the Brusselator, and the neural state construction.

free parameters (1)
  • Neural time delay Delta t = 3 s
    Chosen in the paper because it 'produces neural dynamics with the largest irreversibility'; the same quantity is the metric used to evaluate the coarse-graining, so the delay is selected against the target.
assumptions (5)
  • domain assumption The system admits steady-state probabilities P_i and fluxes J_ij = k_ij P_i satisfying flux balance.
    Invoked at the start of 'Maximum irreversibility coarse-graining'; for empirical neural data, stationarity and ergodicity of the inferred flux matrix are assumed without test.
  • ad hoc to paper The local irreversibility sigma defined by Eqs. (1) and (2) is the right objective even when coarse-grained dynamics are non-Markovian.
    The text says 'we can still define sigma; it measures the local irreversibility' and cites Refs. [23,38]; choosing this measure rather than full entropy production of the hidden process is a modeling decision that favors the algorithm's objective.
  • standard math Coarse-graining cannot increase sigma, so Delta sigma >= 0.
    Cited to Esposito (Ref. [31]) and said to be shown in the SM; it underlies the existence of a maximum-irreversibility CG.
  • ad hoc to paper For the Brusselator, only coarse-grainings that combine neighboring states are considered.
    The text states 'To preserve locality, we only consider CGs that combine neighboring states,' so the claimed optimality is relative to this constraint, not to all possible partitions.
  • domain assumption Hippocampal population activity is modeled as a Markov chain on the most recently active neuron, with transitions counted at a fixed delay Delta t.
    This defines the state space and fluxes in the neural section; the state construction is itself a severe coarse-graining and its fidelity to the true dynamics is not established.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Coarse-graining dynamics to maximize irreversibility." pith.science (2026). https://pith.science/paper/S536TPN6

@misc{pith2026250601909,
  author       = {Pith},
  title        = {Pith review of: Coarse-graining dynamics to maximize irreversibility},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/S536TPN6}},
  note         = {Machine review of arXiv:2506.01909}
}
read the original abstract

In many far-from-equilibrium biological systems, energy injected by irreversible processes at microscopic scales propagates to larger scales to fulfill important biological functions. But given dissipative dynamics at the microscale, how much irreversibility can persist at the macroscale? Here, we propose a model-free coarse-graining procedure that merges microscopic states to minimize the amount of lost irreversibility. Beginning with dynamical measurements, this procedure produces coarse-grained dynamics that retain as much information as possible about the underlying irreversibility. In synthetic and experimental data spanning molecular motors, biochemical oscillators, and recordings of neural activity, we derive simplified descriptions that capture the essential nonequilibrium processes. These results provide the tools to study the fundamental limits on the emergence of macroscopic irreversibility.

Figures

Figures reproduced from arXiv: 2506.01909 by the authors.

Figure 1
Figure 1. FIG. 1. Coarse-graining the kinesin chemical reaction cy [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗
Figure 2
Figure 2. FIG. 2. Coarse-graining biochemical oscillations. (a) Steady-state probability density (colors) and net fluxes (arrows) in [PITH_FULL_IMAGE:figures/full_fig_p003_2.png] view at source ↗
Figure 3
Figure 3. FIG. 3. Coarse-graining neural activity in the hippocampus. (a) A mouse runs along a one-dimensional virtual track as [PITH_FULL_IMAGE:figures/full_fig_p004_3.png] view at source ↗

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

68 extracted references · 63 canonical work pages

  1. [1]

    F. S. Gnesotto, F. Mura, J. Gladrow, and C. P. Broed- ersz, Broken detailed balance and non-equilibrium dy- namics in living systems: a review, Rep. Prog. Phys. 81, 066601 (2018)

    work page 2018

  2. [2]

    X. Yang, M. Heinemann, J. Howard, G. Huber, S. Iyer- Biswas, G. Le Treut, M. Lynch, K. L. Montooth, D. J. Needleman, S. Pigolotti, J. Rodenfels, P. Ronceray, S. Shankar, I. Tavassoly, S. Thutupalli, D. V. Titov, J. Wang, and P. J. Foster, Physical bioenergetics: En- ergy fluxes, budgets, and constraints in cells, Proc. Natl. Acad. Sci. U. S. A. 118, e2026...

    work page 2021

  3. [3]

    J. J. Hopfield, Kinetic proofreading: A new mechanism for reducing errors in biosynthetic processes requiring high specificity, Proceedings of the National Academy of Sciences 71, 4135 (1974)

    work page 1974

  4. [4]

    Ninio, Kinetic amplification of enzyme discrimination, Biochimie 57, 587 (1975)

    J. Ninio, Kinetic amplification of enzyme discrimination, Biochimie 57, 587 (1975)

    work page 1975

  5. [5]

    Murugan, D

    A. Murugan, D. A. Huse, and S. Leibler, Speed, dissipa- tion, and error in kinetic proofreading, Proc. Natl. Acad. Sci. U. S. A. 109, 12034 (2012)

    work page 2012

  6. [6]

    Murugan, D

    A. Murugan, D. A. Huse, and S. Leibler, Discriminatory proofreading regimes in nonequilibrium systems, Phys. Rev. X 4, 021016 (2014)

    work page 2014

  7. [7]

    Q. Yu, A. B. Kolomeisky, and O. A. Igoshin, The en- ergy cost and optimal design of networks for biological discrimination, J. R. Soc. Interface 19, 20210883 (2022)

    work page 2022

  8. [8]

    T. E. Ouldridge, C. C. Govern, and P. R. Ten Wolde, Thermodynamics of computational copying in biochemi- cal systems, Phys. Rev. X 7, 021004 (2017)

    work page 2017

Show all 68 references
  1. [9]

    Mehta, A

    P. Mehta, A. H. Lang, and D. J. Schwab, Landauer in the age of synthetic biology: Energy consumption and information processing in biochemical networks, J. Stat. Phys. 162, 1153 (2016)

    2016

  2. [10]

    P. R. Ten Wolde, N. B. Becker, T. E. Ouldridge, and A. Mugler, Fundamental limits to cellular sensing, J. Stat. Phys. 162, 1395 (2016)

    2016

  3. [11]

    C. C. Govern and P. R. ten Wolde, Optimal resource allocation in cellular sensing systems, Proc. Natl. Acad. Sci. U. S. A. 111, 17486 (2014)

    2014

  4. [12]

    Hathcock, Q

    D. Hathcock, Q. Yu, B. A. Mello, D. N. Amin, G. L. Hazelbauer, and Y. Tu, A nonequilibrium allosteric model for receptor-kinase complexes: The role of energy dissipation in chemotaxis signaling, Proc. Natl. Acad. Sci. U. S. A. 120, e2303115120 (2023)

    2023

  5. [13]

    Hathcock, Q

    D. Hathcock, Q. Yu, and Y. Tu, Time-reversal symme- try breaking in the chemosensory array reveals a general mechanism for dissipation-enhanced cooperative sensing, Nat. Commun. 15, 8892 (2024)

    2024

  6. [14]

    Pagare, S

    A. Pagare, S. H. Min, and Z. Lu, Theoretical upper bound of multiplexing in biological sensory receptors, Physical Review Research 5, 023032 (2023)

    2023

  7. [15]

    A. J. Tjalma, V. Galstyan, J. Goedhart, L. Slim, N. B. Becker, and P. R. Ten Wolde, Trade-offs between cost 6 and information in cellular prediction, Proc. Natl. Acad. Sci. U. S. A. 120, e2303078120 (2023)

    2023

  8. [16]

    S. J. Bryant and B. B. Machta, Physical constraints in intracellular signaling: The cost of sending a bit, Phys. Rev. Lett. 131, 068401 (2023)

    2023

  9. [17]

    Ferretti, S

    F. Ferretti, S. Grosse-Holz, C. Holmes, J. L. Shivers, I. Giardina, T. Mora, and A. M. Walczak, Signatures of irreversibility in microscopic models of flocking, Phys. Rev. E 106, 034608 (2022)

    2022

  10. [18]

    Yu and Y

    Q. Yu and Y. Tu, Energy cost for flocking of active spins: the cusped dissipation maximum at the flocking transi- tion, Physical review letters 129, 278001 (2022)

    2022

  11. [19]

    Ferretti, I

    F. Ferretti, I. Giardina, T. Grigera, G. Pisegna, and M. Veca, Out of equilibrium response and fluctuation- dissipation violations across scales in flocking systems, arXiv [cond-mat.stat-mech] (2024)

    2024

  12. [20]

    P. J. Foster, J. Bae, B. Lemma, J. Zheng, W. Ireland, P. Chandrakar, R. Boros, Z. Dogic, D. J. Needleman, and J. J. Vlassak, Dissipation and energy propagation across scales in an active cytoskeletal material, Proc. Natl. Acad. Sci. U. S. A. 120, e2207662120 (2023)

    2023

  13. [21]

    J. J. Harris, R. Jolivet, and D. Attwell, Synaptic energy use and supply, Neuron 75, 762 (2012)

    2012

  14. [22]

    C. W. Lynn, E. J. Cornblath, L. Papadopoulos, M. A. Bertolero, and D. S. Bassett, Broken detailed balance and entropy production in the human brain, Proceedings of the National Academy of Sciences 118, e2109889118 (2021)

    2021

  15. [23]

    C. W. Lynn, C. M. Holmes, W. Bialek, and D. J. Schwab, Decomposing the local arrow of time in interacting sys- tems, Phys. Rev. Lett. 129, 118101 (2022)

    2022

  16. [24]

    L. P. Kadanoff, Scaling laws for ising models near Tc, Physics 2, 263 (1966)

    1966

  17. [25]

    K. G. Wilson, The renormalization group: Critical phe- nomena and the Kondo problem, Rev. Mod. Phys. 47, 773 (1975)

    1975

  18. [26]

    Tu, The renormalization group for non-equilibrium systems, Nat

    Y. Tu, The renormalization group for non-equilibrium systems, Nat. Phys. 19, 1536 (2023)

    2023

  19. [27]

    Meshulam, J

    L. Meshulam, J. L. Gauthier, C. D. Brody, D. W. Tank, and W. Bialek, Coarse graining, fixed points, and scaling in a large population of neurons, Phys. Rev. Lett. 123, 178103 (2019)

    2019

  20. [28]

    Cavagna, L

    A. Cavagna, L. Di Carlo, I. Giardina, L. Grandinetti, T. S. Grigera, and G. Pisegna, Dynamical renormaliza- tion group approach to the collective behavior of swarms, Phys. Rev. Lett. 123, 268001 (2019)

    2019

  21. [29]

    Cavagna, L

    A. Cavagna, L. Di Carlo, I. Giardina, T. S. Grigera, S. Melillo, L. Parisi, G. Pisegna, and M. Scandolo, Nat- ural swarms in 3.99 dimensions, Nat. Phys. 19, 1043 (2023)

    2023

  22. [30]

    Q. Yu, D. Zhang, and Y. Tu, Inverse power law scal- ing of energy dissipation rate in nonequilibrium reaction networks, Phys. Rev. Lett. 126, 080601 (2021)

    2021

  23. [31]

    Esposito, Stochastic thermodynamics under coarse graining, Phys

    M. Esposito, Stochastic thermodynamics under coarse graining, Phys. Rev. E 85, 041125 (2012)

    2012

  24. [32]

    D. M. Busiello, J. Hidalgo, and A. Maritan, Entropy pro- duction for coarse-grained dynamics, New J. Phys. 21, 073004 (2019)

    2019

  25. [33]

    D. M. Busiello and A. Maritan, Entropy production in master equations and fokker–planck equations: facing the coarse-graining and recovering the information loss, J. Stat. Mech. 2019, 104013 (2019)

    2019

  26. [34]

    Bo and A

    S. Bo and A. Celani, Entropy production in stochastic systems with fast and slow time-scales, J. Stat. Phys. 154, 1325 (2014)

    2014

  27. [35]

    Cocconi, G

    L. Cocconi, G. Salbreux, and G. Pruessner, Scaling of entropy production under coarse graining in active dis- ordered media, Phys. Rev. E. 105, L042601 (2022)

    2022

  28. [36]

    Yu and Y

    Q. Yu and Y. Tu, State-space renormalization group the- ory of nonequilibrium reaction networks: Exact solutions for hypercubic lattices in arbitrary dimensions, Phys. Rev. E. 105, 044140 (2022)

    2022

  29. [37]

    Yu and P

    Q. Yu and P. E. Harunari, Dissipation at limited reso- lutions: power law and detection of hidden dissipative scales, J. Stat. Mech. 2024, 103201 (2024)

    2024

  30. [38]

    C. W. Lynn, C. M. Holmes, W. Bialek, and D. J. Schwab, Emergence of local irreversibility in complex interacting systems, Phys. Rev. E. 106, 034102 (2022)

    2022

  31. [39]

    M. E. Fisher and A. B. Kolomeisky, Simple mechanochemistry describes the dynamics of ki- nesin molecules, Proceedings of the National Academy of Sciences 98, 7748 (2001)

    2001

  32. [40]

    H. M. Berman, J. Westbrook, Z. Feng, G. Gilliland, T. N. Bhat, H. Weissig, I. N. Shindyalov, and P. E. Bourne, The protein data bank, Nucleic Acids Research 28, 235 (2000)

    2000

  33. [41]

    D. S. Goodsell, C. Zardecki, H. M. Berman, and S. K. Burley, Insights from 20 years of the molecule of the month, Biochemistry and Molecular Biology Education 48, 350 (2020)

    2020

  34. [42]

    Liepelt and R

    S. Liepelt and R. Lipowsky, Kinesin’s network of chemo- mechanical motor cycles, Physical review letters 98, 258102 (2007)

    2007

  35. [43]

    Nicolis and I

    G. Nicolis and I. Prigogine, Self-organization in non- equilibrium systems (Wiley, New York, 1997)

    1997

  36. [44]

    J. H. Fritz, B. Nguyen, and U. Seifert, Stochastic ther- modynamics of chemical reactions coupled to finite reser- voirs: A case study for the brusselator, J. Chem. Phys. 152, 235101 (2020)

    2020

  37. [45]

    Hirokawa, Y

    N. Hirokawa, Y. Noda, Y. Tanaka, and S. Niwa, Kinesin superfamily motor proteins and intracellular transport, Nat. Rev. Mol. Cell Biol. 10, 682 (2009)

    2009

  38. [46]

    J. L. Gauthier and D. W. Tank, A dedicated population for reward coding in the hippocampus, Neuron 99, 179 (2018)

    2018

  39. [47]

    Li, C57 mouse (2021)

    L. Li, C57 mouse (2021)

    2021

  40. [48]

    O’Keefe, Place units in the hippocampus of the freely moving rat, Exp

    J. O’Keefe, Place units in the hippocampus of the freely moving rat, Exp. Neurol. 51, 78 (1976)

    1976

  41. [49]

    O’Keefe and L

    J. O’Keefe and L. Nadel, The hippocampus as a cognitive map, Behav. Brain Sci. 2, 520 (1979)

    1979

  42. [50]

    Meshulam, J

    L. Meshulam, J. L. Gauthier, C. D. Brody, D. W. Tank, and W. Bialek, Collective behavior of place and non-place neurons in the hippocampal network, Neuron 96, 1178 (2017)

    2017

  43. [51]

    K. I. Blum and L. F. Abbott, A model of spatial map formation in the hippocampus of the rat, Neural Comput. 8, 85 (1996)

    1996

  44. [52]

    Hazon, V

    O. Hazon, V. H. Minces, D. P. Tom` as, S. Ganguli, M. J. Schnitzer, and P. E. Jercog, Noise correlations in neu- ral ensemble activity limit the accuracy of hippocampal spatial representations, Nat. Commun. 13, 4276 (2022)

    2022

  45. [53]

    Nardin, J

    M. Nardin, J. Csicsvari, G. Tkaˇ cik, and C. Savin, The structure of hippocampal ca1 interactions optimizes spa- tial coding across experience, J. Neurosci. 43, 8140 (2023)

    2023

  46. [54]

    Schrodinger, What is life? The physical aspect of the living cell (Cambridge University Press, 1948)

    E. Schrodinger, What is life? The physical aspect of the living cell (Cambridge University Press, 1948)

    1948

  47. [55]

    J. Li, J. M. Horowitz, T. R. Gingrich, and N. Fakhri, 7 Quantifying dissipation using fluctuating currents, Na- ture communications 10, 1666 (2019)

    2019

  48. [56]

    Otsubo, S

    S. Otsubo, S. Ito, A. Dechant, and T. Sagawa, Esti- mating entropy production by machine learning of short- time fluctuating currents, Physical Review E101, 062106 (2020)

    2020

  49. [57]

    J. M. Horowitz and T. R. Gingrich, Thermodynamic uncertainty relations constrain non-equilibrium fluctua- tions, Nature Physics 16, 15 (2020)

    2020

  50. [58]

    F. A. Cisneros, N. Fakhri, and J. M. Horowitz, Dissi- pative timescales from coarse-graining irreversibility, J. Stat. Mech. 2023, 073201 (2023)

    2023

  51. [59]

    Ghosal and G

    A. Ghosal and G. Bisker, Inferring entropy production rate from partially observed langevin dynamics under coarse-graining, Physical Chemistry Chemical Physics 24, 24021 (2022)

    2022

  52. [60]

    D. J. Skinner and J. Dunkel, Improved bounds on entropy production in living systems, Proc. Natl. Acad. Sci. U. S. A. 118, e2024300118 (2021)

    2021

  53. [61]

    D. J. Skinner and J. Dunkel, Estimating entropy pro- duction from waiting time distributions, Phys. Rev. Lett. 127, 198101 (2021)

    2021

  54. [62]

    van der Meer, B

    J. van der Meer, B. Ertel, and U. Seifert, Thermodynamic inference in partially accessible markov networks: A uni- fying perspective from transition-based waiting time dis- tributions, Phys. Rev. X. 12, 031025 (2022)

    2022

  55. [63]

    P. E. Harunari, A. Dutta, M. Polettini, and E. Rold´ an, What to learn from a few visible transitions’ statistics?, Phys. Rev. X. 12, 041026 (2022)

    2022

  56. [64]

    M. P. Leighton and D. A. Sivak, Jensen bound for the entropy production rate in stochastic thermodynamics, Physical Review E 109, L012101 (2024)

    2024

  57. [65]

    Li, C.-W

    J. Li, C.-W. J. Liu, M. Szurek, and N. Fakhri, Measuring irreversibility from learned representations of biological patterns, PRX Life 2, 033013 (2024)

    2024

  58. [66]

    G. J. Berman, D. M. Choi, W. Bialek, and J. W. Shae- vitz, Mapping the stereotyped behaviour of freely moving fruit flies, J. R. Soc. Interface 11, 20140672 (2014)

    2014

  59. [67]

    A. C. Costa, T. Ahamed, D. Jordan, and G. J. Stephens, A markovian dynamics for caenorhabditis elegans behav- ior across scales, Proc. Natl. Acad. Sci. U. S. A. 121, e2318805121 (2024)

    2024

  60. [68]

    Castellano, M

    C. Castellano, M. Marsili, and A. Vespignani, Nonequi- librium phase transition in a model for social influence, Phys. Rev. Lett. 85, 3536 (2000)

    2000

Pith tools

Reviewed August 7, 2026 · model on record in the stance chip above.