Keyboard shortcuts

Press ← or → to navigate between chapters

Press ? to show this help

Press Esc to hide this help

Metadata
bibkey: fernandez2018revisiting
authors: Bastien Fernandez
year: 2018
title: "Revisiting asymptotic periodicity in networks of degrade-and-fire oscillators"
doi: 10.1140/epjst/e2018-800068-8
url: "https://arxiv.org/abs/1809.03228v1"
claim: "For networks of degrade-and-fire oscillators the paper improves the conditions for asymptotic periodicity under exhaustive firing, analyses the unidirectional 3-cell chain, shows that the simplest non-exhaustive periodic orbit of the epsilon > 1/2 transition graph cannot exist, and states the belief that the same impossibility holds for every other periodic trajectory with non-exhaustive firing in that graph."
strata_touched:
  - D5/S3/StatisticalMechanics/DegradeFireNonExhaustiveOrbitRefutation
license: citation-only
triage: anchor

Fernandez, Revisiting asymptotic periodicity in networks of degrade-and-fire oscillators

B. Fernandez, Eur. Phys. J. Spec. Top. 227, 1267–1279 (2018), DOI 10.1140/epjst/e2018-800068-8; arXiv:1809.03228v1. Quotations are from the arXiv v1 TeX source DynamicsDFNetworksRevised.tex; macros are expanded.

Expression levels evolve under a threshold and a stochastic non-negative matrix with (l. 46–64): “If , then the expression level degrades at constant speed , unless (in which case, it remains steady)”; “If , a firing takes place and resets the expression level to the value 1.” A firing sequence is exhaustive when “each of its length segment must be a permutation of ” (l. 68). Section 4 takes , with rows , , and , restricted to trajectories whose coordinates are always distinct (l. 239–255). The Concluding Remarks state (l. 373):

For instance, one can check that a (minimal) periodic orbit with the simplest non-exhaustive firing sequence of the right transition graph in Fig. 1 cannot exist (see analysis below). We believe that similar impossibility prevails for any other periodic trajectory with non-exhaustive firing in this graph.

Verified locator

  • DOI: https://doi.org/10.1140/epjst/e2018-800068-8
  • Source: https://arxiv.org/abs/1809.03228v1