Neurons and Cognition · arXiv:2611.16999 v1 · submitted 12 Nov 2026 · 36 references
Dynamical mean-field theory of latching Potts networks
The paper says
“Spontaneous transitions between memories, as observed in internally generated cognition such as mind-wandering and free association, require neural dynamics capable of destabilizing one attractive memory state and moving towards another.”
more of the abstract
We ask what minimal representational structure is required for such transitions to emerge in random associative networks. To address this question, we study Potts associative networks with S active states per unit and slow adaptive thresholds. The S = 1 case can model a standard Hopfield-like network of binary units. We employ dynamical mean-field theory in the extensive-load regime, where the number of stored patterns scales linearly with network size and connectivity, and we focus on transitions between two condensed memories, which are singled out in the connectivity matrix. In the finite-load regime, we show that transitions are governed by an effective drive term, whose sign and temporal evolution distinguish high-latching (structured), low-latching (random), and non-latching regimes. The resulting phase diagram shows that adaptation alone is not sufficient: transitions only occur within certain ranges of the overlap between the two memories. In the binary case S = 1, in particular, no unit can be active in both memories but in different Potts states, thus strongly supressing the high-latching, structured transitions that exist for S > 1. In the extensive-load regime, non-condensed memories generate colored fluctuations and retarded self-interactions through an effective memory kernel. We find that latching trajectories change the effective timescale of this kernel, a dynamical signature of transitions in the extensive-load regime. These results indicate that multi-state Potts-like representations are essential for structured memory-to-memory transitions, a hallmark of spontaneous thought.
from the abstract
Pith says
Machine review · deepseek-v4-flash · 13 Nov 2026 · what was read was not recorded · not checked by a person
It can be wrong. Challenge this review or reply to it.
Holds up, with conditions. DMFT for Potts latching networks: technically solid, central claim about S>1 necessity is well-supported at α=0 but not yet proven at finite load. This line is wrong
4 major objections · 6 minor
How often objections from reviews like this one are right: not yet measured
Not checked: figures, code, what the 36 references say.
The paper says, at §IV C, Fig. 7, and §V
The review did not quote this passage.
Pith says: Objection 1 of 4 · major
The central claim that S>1 is necessary for structured transitions is supported primarily by the α=0 analysis (§IV A-B). The α>0 phase diagram (Fig. 7) is computed only for S=3, and the paper does not present an α>0 analysis for S=1.
more of objection 1
The authors state that 'the basic result essentially holds' (§V) but provide no evidence. Given that the α>0 regime introduces colored noise and retarded self-interactions that could in principle create effective transition channels even in S=1, the necessity claim is not fully established for the extensive-load regime. The paper acknowledges that 'a more complete analytical theory of the different regimes remains to be developed' (§V), which includes the S=1 case at finite load. Without this analysis, the claim that S>1 is necessary for structured transitions is overstated. I recommend that the authors either provide an α>0 analysis for S=1 (even if limited to a few representative points) or explicitly qualify the claim to apply only to the α=0 regime, with the α>0 results presented as consistent but not yet conclusive.
The paper says, at §IV A 2, Eqs. (35)-(36)
The review did not quote this passage.
Pith says: Objection 2 of 4 · major
The observables M_HIGH and M_LOW are defined post hoc based on simulation observations: M_HIGH is the time-averaged effective drive over [0, τθ], and M_LOW is the average derivative of M12 over [2τθ, 3τθ]. While these definitions capture the phenomenology, they are not derived from the dynamics and their thresholds (e.g., the specific time windows) are chosen to match the observed regimes.
more of objection 2
This raises a concern about circularity: the phase boundaries are identified by the sign change of observables that are constructed from the simulation data they aim to predict. The paper acknowledges that 'the dynamical origin of this additional constraint remains an open question' (§IV A 4), but the reliance on these ad hoc observables weakens the predictive power of the phase diagram. I suggest that the authors discuss the sensitivity of the phase boundaries to the choice of time windows and, if possible, provide a more principled derivation of M_HIGH and M_LOW from the dynamics.
The paper says, at §IV A 1, Eqs. (33)-(34)
The review did not quote this passage.
Pith says: Objection 3 of 4 · major
The effective drive expressions (Eqs. 33-34) are derived under the approximation that activities in colors unrelated to the two condensed memories (the k-components) are strongly suppressed. This is asserted based on Fig. 2 but not proven across the entire phase diagram.
more of objection 3
The phase boundaries derived from these expressions may be less reliable where k-components are not negligible, e.g., near the silent state or during transitions. The authors should either provide a quantitative justification for neglecting k-components (e.g., by showing that their contribution is small in the relevant parameter range) or discuss the potential impact on the phase boundaries.
The paper says, at §IV C 2, Fig. 8
The review did not quote this passage.
Pith says: Objection 4 of 4 · major
The suppression of low latching at finite load is demonstrated for a single point (X=0.06, Y=0.78) with 24 disorder realizations. While this is a useful illustration, the claim that 'low latching is the regime most strongly suppressed by the load' (§IV C 2) would require a more systematic exploration of the (X,Y) plane at α>0.
more of objection 4
The paper shows that the low-latching region shrinks (Fig. 7, yellow region), but the quantitative extent of suppression is not characterized. I recommend that the authors provide a more comprehensive analysis, e.g., a phase diagram for α>0 that includes the probability of low-latching events as a function of (X,Y).
6 minor objections
The paper says, at General
Pith says: minor objection 1 of 6
The paper is generally well-written, but there are several typographical errors and formatting issues. For example, in the abstract: 'supressing' should be 'suppressing'. In §II A, 'phasetransitions' should be 'phase transitions'. In §IV A 1, the equation numbers (30)-(31) are referenced but the equations themselves are not numbered in the text. In Fig. 4, the labels 'M HIGH = 0' and 'M LOW = 0' are difficult to read due to small font size. These issues should be corrected.
The paper says, at §III A
Pith says: minor objection 2 of 6
The classification of single-site dynamics into five configurations (xx, xy, xs, sy, ss) is clear, but the subsequent statement that 'this procedure yields ten distinct equations for the dynamical fields' is not fully explained. The derivation of the ten equations from the five configurations should be made more explicit, perhaps with a table or a brief enumeration.
show 4 more
The paper says, at §IV A 3
Pith says: minor objection 3 of 6
The description of pathological latching regimes (transient vs. sustained) is clear, but the criteria for distinguishing them (e.g., 'a finite or an infinite number of times') are qualitative. The paper later uses numerical criteria (Appendix F 2) to identify phases from simulations, but the connection between the analytical description and the numerical criteria could be made more explicit.
The paper says, at §IV C 1, Eq. (44)
Pith says: minor objection 4 of 6
The derivation of the memory kernel timescale τmem(t) in Appendix G assumes that the response function ˜G(t,t') decays exponentially with a time scale τG. This assumption is plausible but should be validated against the DMFT results, e.g., by showing that ˜G(t,t') is indeed approximately exponential for the relevant parameters. The authors provide a comparison in Fig. G1, which is helpful, but a brief comment on the validity of the exponential approximation would strengthen the argument.
The paper says, at §V
Pith says: minor objection 5 of 6
The discussion acknowledges several limitations (two condensed memories, random patterns, specific adaptation mechanism). However, the paper does not discuss the potential impact of the softmax nonlinearity (Eq. 4) on the results. The inverse temperature β and the bias U are fixed parameters in the simulations; a brief comment on how varying β or U might affect the phase diagram would be useful.
The paper says, at References
Pith says: minor objection 6 of 6
Reference [19] is a PhD thesis (Ryom, 2023). While this is acceptable, the authors should ensure that the thesis is publicly accessible (the provided link is a handle). If the thesis is not yet publicly available, the authors should consider citing a published paper instead.
What would settle it
Perform DMFT simulations for S=1 at α=0.1, scanning the (X,Y) plane (where X = C1/(C1+C2) and Y = (C1+C2)/(aN), with C2=0 for S=1). Compute the phase diagram and the effective drive M12. If any region with structured transitions (high-latching or low-latching with non-random direction) appears, the necessity claim is weakened. If no such region appears, the claim is strengthened. The test should use the same parameters as Fig. 7 (N=800, a=0.25, U=0.3, β=5, τr=10, τθ=100, w=0.8) and at least 16 disorder realizations.
from the skeptic's reading
How the review went
4 readings by deepseek-v4-flash · 13 Nov 2026
- Reader holds up, with conditions
- Skeptic partly agrees
- Editor wrote the verdict above
- Referee major revision: 4 major objections, 6 minor
Not run on this paper: the simulated authors' defence.
Pith did not check this review's objections against the paper.
The review in full
The review in brief, machine-written
The paper develops a dynamical mean-field theory for adaptive Potts associative networks and uses it to ask whether multi-state units are necessary for structured memory-to-memory transitions. The DMFT derivation is technically careful and validated against finite-size simulations, which is real work. The phase diagram at α=0 cleanly separates high-latching, low-latching, and pathological regimes based on overlap geometry, and the effective drive expressions give a clear mechanistic picture. The comparison between S=1 and S>1 at α=0 is convincing: the xy transition channel is absent in binary units, and the paper shows why the effective drive is too weak for structured transitions under typical random overlaps.
The soft spot is the finite-load analysis. The central claim that S>1 is necessary for structured transitions is supported primarily by the α=0 case. At α>0, the paper only computes the phase diagram for S=3 and does not present an equivalent analysis for S=1. The authors acknowledge that 'a more complete analytical theory of the different regimes remains to be developed' and that the low-latching regime is strongly suppressed by load. The stress-test concern is fair: it is possible that at finite load, colored noise and retarded self-interactions could create effective transition channels even in S=1, or that the suppression of low-latching affects both S=1 and S>1, making the comparison less clear. The paper does not rule this out. The claim that 'the basic result essentially holds' at finite load is asserted but not demonstrated with the same rigor as the α=0 case.
That said, the paper is a serious piece of work. The DMFT machinery is correctly applied, the simulations match, and the α=0 phase diagram is a genuine contribution. The limitation is clearly stated by the authors themselves. For a reader interested in the statistical mechanics of recurrent networks or in the mechanistic basis of spontaneous cognitive dynamics, this paper provides a useful theoretical framework and a clear result for the finite-load limit. The extension to extensive load is partial but still yields a dynamical signature (kernel timescale peaks) that is interesting.
Recommendation: This paper deserves peer review. A referee should ask for a more explicit discussion of the finite-load S=1 case, even if only through simulations or a scaling argument, to substantiate the necessity claim. But the core theoretical contribution is solid and the paper is honestly written about its limitations.
The strongest objection
The paper's central claim is that multi-state (S>1) representations are necessary for structured memory-to-memory transitions, because the xy pattern configuration provides a directed transition channel absent in S=1. This claim is supported primarily by the α=0 analysis (Sec. IV A), where the effective drive M12 for S=1 (Eq. 37) is shown to be too weak under typical random overlaps. However, the paper also shows that at α>0, low-latching (the regime where S=1 might have shown weak transitions) is strongly suppressed (Sec. IV C 2, Fig. 8), while high-latching (which requires the xy channel) is not. The α>0 phase diagram (Fig. 7) is computed only for S=3. The paper does not present an α>0 analysis for S=1, nor does it demonstrate that S=1 networks with α>0 cannot produce any structured transitions under some overlap conditions. The authors state that 'the basic result essentially holds' (Sec. V) but do not provide evidence. The concern is that the necessity claim may be overstated: it is possible that at finite load, the colored noise and retarded self-interactions could create effective transition channels even in S=1, or that the suppression of low-latching is a finite-load effect that also affects S>1, making the comparison less clear. The paper acknowledges that 'a more complete analytical theory of the different regimes remains to be developed' (Sec. V), which includes the S=1 case at finite load. Without this analysis, the claim that S>1 is necessary for structured transitions is not fully established for the extensive-load regime, which is the main focus of the DMFT development.
The reader's weakest_assumption focused on the approximation neglecting non-condensed colors in the effective drive expressions (Eqs. 33-34). While that is a valid concern, I find a more fundamental gap: the central claim about necessity of S>1 is not fully tested in the extensive-load regime, which is the regime where DMFT is most powerful. The paper shows that at α=0, S=1 cannot produce structured transitions under typical overlaps, but at α>0, the dynamics are qualitatively different due to colored noise and memory kernels. The paper does not analyze S=1 at α>0, so the claim that 'the basic result essentially holds' is an extrapolation. The authors acknowledge this limitation implicitly (Sec. V: 'a more complete analytical theory of the different regimes remains to be developed'), but the conclusion is stated without qualification. The concrete test would settle whether the necessity claim holds in the extensive-load regime. I agree with the reader that the approximation in Eqs. 33-34 is a concern, but I think the missing S=1 analysis at α>0 is more load-bearing for the central claim. Hence partial agreement.
The referee's report
If the central claim holds, the paper provides a rigorous theoretical foundation for a long-standing hypothesis in computational neuroscience: that cortical patches with multiple internal attractor states (Potts units) are necessary for spontaneous cognitive dynamics such as mind-wandering and free association. The DMFT derivation is technically detailed and validated against finite-size simulations for selected parameters, which is a strength. The paper also introduces a novel observable (the memory-kernel timescale) that could serve as a probe of latching in large-scale simulations. However, the significance is tempered by the acknowledged limitations: the analysis is restricted to two condensed memories, random patterns, and a specific adaptation mechanism. The claim of necessity for S>1 is primarily supported by the α=0 analysis; the α>0 results are only for S=3 and do not include a direct comparison with S=1 at finite load, which the authors acknowledge as future work.
Pith's reading of the paper (a machine's summary, not the authors')
Spontaneous transitions between memories, as in mind-wandering, require neural dynamics that destabilize one memory and move toward another. This paper asks what minimal representational structure is needed for such transitions. Using dynamical mean-field theory of Potts associative networks with slow adaptation, the authors show that adaptation alone is insufficient: the units must have multiple active states (S>1) to provide a directed transition channel. In binary (S=1) networks, adaptation can destabilize a memory but cannot efficiently redirect to another. The phase diagram reveals that transitions occur only within certain ranges of memory overlap, and that multi-state representations are essential for structured, non-random latching. These results suggest that multi-state cortical patches are fundamental for autonomous cognitive dynamics.
What carries the argument. The central mechanism is the effective transition drive M12, derived from the DMFT reduction to five site classes (xx, xy, xs, sy, ss) for two condensed memories. Its approximate form M12 ≈ (1-2a/S)XY σ_xxx - (2a/S)[Y(1-X)σ_xxy + (1-Y)σ_xxs] reveals that the positive contribution comes from units active in the same color in both memories (xx), while the xy units provide the channel for directed transitions. The overlap parameters X (fraction of jointly active units sharing the same color) and Y (total fraction of units active in both memories) control the dynamics. The DMFT memory kernel K(t,t′) and its half-width timescale τ_mem(t) serve as dynamical probes in the extensive-load regime.
Core claim. The paper establishes that slow adaptive thresholds alone cannot generate robust non-random transitions between memories in associative networks. Instead, the units must be multi-state Potts variables (S>1) that can be active in different colors in different memories. The xy pattern configuration—units active in different Potts states in the two memories—provides a directed transition channel that is absent in binary (S=1) networks. Using dynamical mean-field theory, the authors derive an effective drive term M12 whose sign and temporal evolution distinguish high-latching (structured), low-latching (random), and non-latching regimes. The resulting phase diagram in the plane of memory overlap parameters X and Y shows that transitions occur only within certain overlap ranges, and that binary networks cannot sustain structured latching. In the extensive-load regime, the DMFT memory kernel develops a characteristic timescale that peaks at each transition, providing a dynamical signature of latching.
The premise it rests on. The derivation of the simplified effective drive M12 (Eqs. 33-34) assumes that activities in colors unrelated to the two condensed memories are strongly suppressed; if these k-components are not negligible, the phase boundaries derived from these expressions may shift.
If the paper is right (Pith's inferences, not the authors')
Binary (S=1) Hopfield-like networks cannot support spontaneous structured memory transitions; multi-state representations are necessary.
The overlap geometry between memories, captured by X and Y, determines whether transitions are high-latching, low-latching, or absent.
In the extensive-load regime, the DMFT memory kernel’s timescale peaks at each memory transition, providing a measurable signature of latching.
The phase diagram shows that adaptation alone is insufficient; transitions require both suitable overlap and multi-state units.
Multi-state Potts units provide a mechanistic basis for spontaneous thought and free association in cortical systems.
The necessity of multi-state units implies that cortical patches with multiple local attractors are not just for memory storage but are fundamental for autonomous cognitive dynamics.
The suppression of low-latching at finite load suggests that in realistic noisy networks, only high-overlap memories may transition, potentially constraining the structure of semantic memory networks.
The DMFT kernel width could be used as an experimental probe: if neural recordings during rest show peaks in effective memory timescale, that would support the latching model.
The result that S=1 networks cannot latch challenges the view that spontaneous thought arises from simple attractor networks with adaptation, emphasizing the role of multi-state representations.
Check this review
Pith stored no record of this review's passes and took no fingerprint of it. Reviews made by code from 13 Nov 2026 on carry both.
How often reviews like this one are right
Reviews like this one: written by deepseek-v4-flash, where what was read was not recorded.
How often objections from reviews like this one are right: not yet measured
Reviews by people
This review was written by a machine. No person has reviewed this paper on Pith yet. A scientist listed on Pith can review it for a fee, and their review is published here whatever it concludes.
The paper
Abstract
Spontaneous transitions between memories, as observed in internally generated cognition such as mind-wandering and free association, require neural dynamics capable of destabilizing one attractive memory state and moving towards another. We ask what minimal representational structure is required for such transitions to emerge in random associative networks. To address this question, we study Potts associative networks with S active states per unit and slow adaptive thresholds. The S = 1 case can model a standard Hopfield-like network of binary units. We employ dynamical mean-field theory in the extensive-load regime, where the number of stored patterns scales linearly with network size and connectivity, and we focus on transitions between two condensed memories, which are singled out in the connectivity matrix. In the finite-load regime, we show that transitions are governed by an effective drive term, whose sign and temporal evolution distinguish high-latching (structured), low-latching (random), and non-latching regimes. The resulting phase diagram shows that adaptation alone is not sufficient: transitions only occur within certain ranges of the overlap between the two memories. In the binary case S = 1, in particular, no unit can be active in both memories but in different Potts states, thus strongly supressing the high-latching, structured transitions that exist for S > 1. In the extensive-load regime, non-condensed memories generate colored fluctuations and retarded self-interactions through an effective memory kernel. We find that latching trajectories change the effective timescale of this kernel, a dynamical signature of transitions in the extensive-load regime. These results indicate that multi-state Potts-like representations are essential for structured memory-to-memory transitions, a hallmark of spontaneous thought.
The paper's own sentences, arranged, kept beside the review and separate from it. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. No sentence in this record was written by a model.
abstract compiled · 2026-11-13
The authors' main claim, as the classifier picked it out 1.00
“These results indicate that multi-state Potts-like representations are essential for structured memory-to-memory transitions, a hallmark of spontaneous thought.”
How the main claim is stated: hedged possibility 0.95
What the abstract itself states, as probabilities: claims first 0.04 · states limitation 0.76 · human participants 0.03 · controlled comparison 0.12 · randomized assignment 0.01 · states quantitative result 0.19 · compares with prior results 0.33 · mentions code or data availability 0.01
The abstract, sentence by sentence
This table labels the abstract only (arXiv listing abstract v1). The number is the probability the classifier gave the label.
| Sentence | Role | The authors' own work | States the main conclusion | Strength |
|---|---|---|---|---|
| Spontaneous transitions between memories, as observed in internally generated cognition such as mind-wandering and free association, require neural dynamics capable of destabilizing one attractive memory state and moving towards another. | background 1.00 | 0.05 | 0.05 | asserted 0.99 |
| We ask what minimal representational structure is required for such transitions to emerge in random associative networks. | gap 0.63 | 0.18 | 0.02 | unclear 0.97 |
| To address this question, we study Potts associative networks with $S$ active states per unit and slow adaptive thresholds. | method 0.74 | 0.81 | 0.03 | asserted 0.74 |
| The $S=1$ case can model a standard Hopfield-like network of binary units. | background 0.84 | 0.11 | 0.02 | asserted 0.53 |
| We employ dynamical mean-field theory in the extensive-load regime, where the number of stored patterns scales linearly with network size and connectivity, and we focus on transitions between two condensed memories, which are singled out in the connectivity matrix. | method 0.95 | 0.88 | 0.05 | asserted 0.83 |
| In the finite-load regime, we show that transitions are governed by an effective drive term, whose sign and temporal evolution distinguish high-latching (structured), low-latching (random), and non-latching regimes. | result 0.99 | 0.95 | 0.12 | asserted 1.00 |
| The resulting phase diagram shows that adaptation alone is not sufficient: transitions only occur within certain ranges of the overlap between the two memories. | result 0.99 | 0.90 | 0.15 | asserted 1.00 |
| In the binary case $S=1$, in particular, no unit can be active in both memories but in different Potts states, thus strongly supressing the high-latching, structured transitions that exist for $S>1$. | result 0.90 | 0.70 | 0.14 | asserted 1.00 |
| In the extensive-load regime, non-condensed memories generate colored fluctuations and retarded self-interactions through an effective memory kernel. | result 0.93 | 0.79 | 0.04 | asserted 1.00 |
| We find that latching trajectories change the effective timescale of this kernel, a dynamical signature of transitions in the extensive-load regime. | result 0.99 | 0.96 | 0.09 | asserted 1.00 |
| These results indicate that multi-state Potts-like representations are essential for structured memory-to-memory transitions, a hallmark of spontaneous thought. | interpretation 1.00 | 0.79 | 0.90 | hedged possibility 0.95 |
What kind of paper the classifier reports this is: theoretical result 1.00 · evidence from proof or derivation 0.96
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
How the labels were made
Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-11-13: 1 request, 8,315 input tokens.
Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. This record as JSON
Figures (8)
Figures are the authors', reproduced from the paper.
References (36)
- [1] J. J. Hopfield, Neural networks and physical systems with emergent collective computational abilities, Proceedings of the National Academy of Sciences of the United States of America79, 2554 (1982) on Pith
- [2] Suppression of low latching at finite load. Low latching is the regime most strongly suppressed by the load. We illustrate this at X = 0.06, Y = 0.78, a point that lies deep inside the low-latching region of the α = 0 diagram, simulating 24 independent realisations of the diso... on Pith
- [3] J. J. Hopfield, Neurons with graded response have collective computational properties like those of two-state neurons, Proceedings of the National Academy of Sciences of the United States of America81, 3088 (1984) on Pith
- [4] D. J. Amit, H. Gutfreund, and H. Sompolinsky, Spin-glass models of neural networks, Physical Review A32, 1007 (1985) on Pith
- [5] M. V. Tsodyks and M. V. Feigel’man, The enhanced storage capacity in neural networks with low activity level, Europhysics Letters6, 101 (1988) on Pith
- [6] V. Braitenberg and A. Sch¨ uz,Anatomy of the cortex: statistics and geometry, Vol. 18 (Springer Science & Business Media, 2013) on Pith
- [7] I. Kanter, Potts-glass models of neural networks, Physical Review A37, 2739 (1988) on Pith
- [8] A. Treves, Frontal latching networks: a possible neural basis for infinite recursion, Cognitive Neuropsychology 22, 276 (2005) on Pith
- [9] M. Naim, V. Boboeva, C. J. Kang, and A. Treves, Reducing a cortical network to a Potts model yields storage capacity estimates, Journal of Statistical Mechanics: Theory and Experiment2018, 043304 (2018) on Pith
- [10] E. Russo, V. M. K. Namboodiri, A. Treves, and E. Kropff, Free association transitions in models of cortical latching dynamics, New Journal of Physics10, 015008 (2008) on Pith
- [11] E. Russo and A. Treves, Cortical free-association dynamics: distinct phases of a latching network, Physical Review E85, 051920 (2012) on Pith
- [12] D. Horn and M. Usher, Neural networks with dynamical thresholds, Physical Review A40, 1036 (1989) on Pith
- [13] M. Herrmann, E. Ruppin, and M. Usher, A neural model of the dynamic activation of memory, Biological cybernetics68, 455 (1993) on Pith
- [14] C. J. Kang, M. Naim, V. Boboeva, and A. Treves, Life on the edge: Latching dynamics in a Potts neural network, Entropy19, 468 (2017) on Pith
- [15] P. C. Martin, E. D. Siggia, and H. A. Rose, Statistical dynamics of classical systems, Phys. Rev. A8, 423 (1973) on Pith
- [16] A. C. C. Coolen, Statistical mechanics of recurrent neural networks ii: Dynamics, inHandbook of Biological Physics, Vol. 4 (Elsevier, 2001) pp. 619–684 on Pith
- [17] A. Crisanti and H. Sompolinsky, Path integral approach to random neural networks, Phys. Rev. E98, 062120 (2018) on Pith
- [18] F. L. Metz, Dynamical mean-field theory of complex systems on sparse directed networks, Phys. Rev. Lett. 134, 037401 (2025) on Pith
- [19] C. F. Mari and A. Treves, Modeling neocortical areas with a modular neural network, Biosystems48, 47 (1998) on Pith
- [20] K. I. Ryom, Statistical analysis of potts neural networks and latching dynamics, PhD Thesis (2023), accessible from https://hdl.handle.net/20.500.11767/134430 on Pith
show 16 more
- [21] K. S. Ryu, S. I. Om, K. I. Ryom, and Y. H. Ko, Retrieval properties of attractor neural networks with regulated levels of activity, The European Physical Journal B99, 59 (2026) on Pith
- [22] S. H. Kim, Y. G. Hong, K. I. Ryom, and C. J. Kang, Glassy and retrieval properties of Potts neural networks with constrained mean activity, AIP Advances16, 045114 (2026) on Pith
- [23] D. O’Kane and A. Treves, Short-and long-range connections in autoassociative memory, Journal of Physics A: Mathematical and General25, 5055 (1992) on Pith
- [24] H. Itoh and M. Kimoto, Chaotic itinerancy with preferred transition routes appearing in an atmospheric model, Physica D: Nonlinear Phenomena109, 274 (1997) on Pith
- [25] I. Tsuda, The plausibility of a chaotic brain theory, Behavioral and Brain Sciences24, 829 (2001) on Pith
- [26] K. Kaneko, From coupled dynamical systems to biological irreversibility, Dynamical Systems and Irreversibility: A Special Volume of Advances in Chemical Physics122, 53 (2002) on Pith
- [27] M. Rabinovich, R. Huerta, and G. Laurent, Transient dynamics for neural processing, Science321, 48 (2008) on Pith
- [28] M. I. Rabinovich and P. Varona, Robust transient dynamics and brain functions, Frontiers in Computational Neuroscience5, 24 (2011) on Pith
- [29] C. J. Kang and A. Treves, The challenge of taming a latching network near criticality, inThe Functional Role of Critical Dynamics in Neural Systems(Springer, 2019) pp. 81–94 on Pith
- [30] Y. Y. Mun, J. U. Song, C. J. K. Kang, and K. I. Ryom, Latching dynamics instructed through an extra adaptation-related field in Potts neural network, AIP Advances16, 065026 (2026) on Pith
- [31] H. Sompolinsky, A. Crisanti, and H.-J. Sommers, Chaos in random neural networks, Physical Review Letters61, 259 (1988) on Pith
- [32] F. Mastrogiuseppe and S. Ostojic, Linking connectivity, dynamics, and computations in low-rank recurrent neural 16 networks, Neuron99, 609 (2018) on Pith
- [33] R. Tremblay, S. Lee, and B. Rudy, Gabaergic interneurons in the neocortex: from cellular properties to circuits, Neuron91, 260 (2016) on Pith
- [34] K. I. Ryom and A. Treves, Speed inversion in a Potts glass model of cortical dynamics, PRX Life1, 013005 (2023) on Pith
- [35] W. H. Press, S. A. Teukolsky, W. T. Vetterling, and B. P. Flannery,Numerical Recipes 3rd Edition: The Art of Scientific Computing, 3rd ed. (Cambridge University Press, 2007) on Pith
- [36] C. Chicone,Ordinary Differential Equations with Applications, 2nd ed., Texts in Applied Mathematics (Springer, 2006). 17 Appendix A: Dynamical mean-field theory In this appendix, we derive the effective single-site equation for N→ ∞using dynamical mean-field theory (DMFT). We ... on Pith
Challenges and discussion
Disagree with the review, or know something it missed? Leave a comment, or challenge this review formally: a challenge becomes a permanent entry in this paper's record, and its decision is published here.
Come back by email
A short list of the week's newly reviewed papers. Nothing is sent until you confirm from your inbox, and every email has a link that stops it. No account.
No comments yet.
Sign in to comment