Search arXivSearch

arXiv · 2602.12467

State dependent delay differential equations with distributed memory

Abstract

We investigate state dependent delay differential equations with distributed memory, combining discrete state dependent delays and a convolution type memory operator. Under Lipschitz type assumptions on the delay, kernel, and nonlinear term, we establish local well posedness using a fixed point argument in a Banach space of histories. The distributed memory operator is shown to be locally Lipschitz, ensuring existence and uniqueness. As a benchmark, we analyze a logistic model with a Gamma distributed memory kernel of order two. The convolution term is reduced to a finite dimensional form, yielding an explicit characteristic equation and closed form Hopf bifurcation threshold and frequency. The results show that higher order memory kernels may induce oscillatory dynamics, unlike purely exponential memory, and provide a rigorous framework for stability and bifurcation analysis in delay systems with state dependent memory.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Taylan Demir, Niaz Ali Shah. 2026-02-12. State dependent delay differential equations with distributed memory. https://arxiv.org/abs/2602.12467

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