Search arXivSearch

arXiv · 2510.17126

Practicalities of State-Dependent and Threshold Delay Differential Equations

Abstract

Delays are ubiquitous in applied problems, but often do not arise as the simple constant discrete delays that analysts and numerical analysts like to treat. In this chapter we show how state-dependent delays arise naturally when modeling and the consequences that follow. We treat discrete state-dependent delays, and delays implicitly defined by threshold conditions. We will consider modeling, formulation as dynamical systems, linearization, and numerical techniques. For discrete state-dependent delays we show how breaking points can be tracked efficiently to preserve the order of numerical methods for simulating solutions. For threshold conditions we will discuss how a velocity ratio term arises in models, and present a heuristic linearization method that avoids Banach spaces and sun-star calculus, making the method accessible to a wider audience. We will also discuss numerical implementations of threshold and distributed delay problems which allows them to be treated numerically with standard software.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

A. R. Humphries, A. S. Eremin, Z. Wang. 2025-11-08. Practicalities of State-Dependent and Threshold Delay Differential Equations. https://arxiv.org/abs/2510.17126

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

KEEP EXPLORING

Related papers

Effective equidistribution of orbits under semisimple groups on congruence quotients

We prove an effective equidistribution result for periodic orbits of semisimple groups on congruence quotients of an ambient semisimple group.This extends a previous work of Einsiedler, Margulis and Venkatesh. The main new feature is that we allow for periodic orbits of semisimple groups with nontrivial centralizer in the ambient group. Our proof uses crucially an effective closing lemma from work of the author with Lindenstrauss, Margulis,Mohammadi, and Shah.

math.DS

Generalized entropy of measure-induced maps

A classical result by E. Glasner and B. Weiss states that the topological entropy of a map $f$ is zero if and only if the topological entropy of its measure-induced map $f_*$ is zero, where $f_*$ is defined as the push-forward of a measure. In this work, we use generalized entropy to distinguish the complexity of these maps and prove that the measure-induced map is much more complex than the original map. Moreover, we introduce the generalized mean dimension, an invariant that is useful for distinguishing dynamical systems with zero mean dimension, including those with the small-boundary property, and we show a relationship between this new invariant and generalized entropy.

math.DS

The endpoint problem for $\varepsilon$-hypercyclicity

For a fixed $0<\varepsilon<1$, F. Bayart asked in 2024 whether there exists an operator $T$ such that, for every $0<δ<1$, $T$ is $δ$-hypercyclic if and only if $δ\in[\varepsilon,1)$. We answer this question affirmatively by constructing a weighted backward shift on $\ell_2(\mathbb N_0,\ell_2(\mathbb N_0))$ with this property.

math.DS