Entropy bounds for Glass networks

Benjamin W. Wild; Roderick Edwards

Home/Archive/arXiv

arXiv · 2406.04435

Entropy bounds for Glass networks

Benjamin W. Wild·Roderick Edwards

View original source ↗Read source document ↗Export metadata ↓

Abstract

We propose that chaotic Glass networks (a class of piecewise-linear Ordinary Differential Equations) are good candidates for the design of true random number generators. A Glass network design has the advantage of involving only standard Boolean logic gates. Furthermore, an already chaotic (deterministic) system combined with random ``jitter'' due to thermal noise can be used to generate random bit sequences in a more robust way than noisy limit-cycle oscillators. Since the goal is to generate bit sequences with as large a positive entropy as possible, it is desirable to have a theoretical method to assess the irregularity of a large class of networks. We develop a procedure here to calculate good upper bounds on the entropy of a Glass network, by means of symbolic representations of the continuous dynamics. Our method improves on a result by Farcot (2006), and allows in principle for an arbitrary level of precision by refinements of the estimate, and we show that in the limiting case, these estimates converge to the true entropy of the symbolic system corresponding to the continuous dynamics. As a check on the method, we demonstrate for an example network that our upper bound after only a few refinement steps is very close to the entropy estimated from a long numerical simulation.

Explore related subjects

math.DS

Keep this discovery

BibTeX RIS

Benjamin W. Wild, Roderick Edwards. 2024-06-06. Entropy bounds for Glass networks. https://arxiv.org/abs/2406.04435

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Admissible Fourier Lengths, KAM Reducibility, and Spectral Applications

We develop a perturbative KAM reducibility theory for one-frequency $\mathrm{SL}(2,\mathbb{R})$ cocycles based on an admissible Fourier length $\ell$. The regularity relevant to the iteration is measured by positive adapted Fourier width rather than ordinary smoothness in the Euclidean length $|n|$. The same length governs Fourier decay, truncation and resonance scales, and the arithmetic condition controlling the small divisors. This framework contains the classical analytic and Gevrey settings, while non-monotone choices of $\ell$ allow classical nowhere differentiable Weierstrass-type perturbations and continuous perturbations outside every positive H\"older class. As spectral applications, we obtain purely absolutely continuous spectrum for every phase and $1/2$-H\"older continuity of the integrated density of states for the associated quasiperiodic Schr\"odinger operators. The Aubry dual has pure point spectrum for Lebesgue almost every dual phase, with eigenfunctions exponentially localized in the metric induced by $\ell$. We also construct nowhere differentiable quasiperiodic potentials with purely absolutely continuous Cantor spectrum.

math.DS↗

arXiv2026

Dynamics inside the attracting basins of some skew products

Polynomial skew products in $\mathbb{C}^2$ are maps of the form $F(z,w)=(P(z),Q(z,w))$, where $P$ and $Q$ are polynomials. Their local dynamics have been widely investigated. In this paper, we study the global dynamics inside Fatou components of some skew products. We consider all the inverse images in a Fatou component of a given point and use the Kobayashi metric to measure the distance between points. In the cases we consider, there are always arbitrarily large Kobayashi balls in the complement of these inverse sets.

math.DS↗

arXiv2026

Ergodicity of dynamical systems without uniqueness of orbits

Recently, there has been considerable interest in the study of non-deterministic dynamical systems. To analyze the chaotic behavior of such systems from a measure-theoretic viewpoint, it is desirable to consider ergodicity. However, the classical definition of ergodicity involves invariant sets, whose definition is not unique for non-deterministic dynamical systems. Thus, we are led to the question of which invariance yields an interesting definition of ergodicity. Here, we propose a definition based on the strong backward invariance and show that analogs of classical results hold. We also consider implications of the Birkhoff ergodic theorem for systems without uniqueness of orbits.

math.DS↗