Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2406.17359

Classification of 3-Node Restricted Excitatory-Inhibitory Networks

Manuela Aguiar·Ana Dias·Ian Stewart
View original source ↗Read source document ↗Export metadata ↓

Abstract

We classify connected 3-node restricted excitatory-inhibitory networks, extending our previous paper (`Classification of 2-node Excitatory-Inhibitory Networks', Mathematical Biosciences 373 (2024) 109205). We assume that there are two node-types and two arrow-types, excitatory and inhibitory; all excitatory arrows are identical and all inhibitory arrows are identical; and excitatory (resp. inhibitory) nodes can only output excitatory (resp. inhibitory) arrows. The classification is performed under the following two network perspectives: ODE-equivalence and minimality; and valence less or equal to 2. The results of this and the previous work constitute a first step towards analysing dynamics and bifurcations of excitatory-inhibitory networks and have potential applications to biological network models.

Explore related subjects

math.DS

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Manuela Aguiar, Ana Dias, Ian Stewart. 2024-06-25. Classification of 3-Node Restricted Excitatory-Inhibitory Networks. https://arxiv.org/abs/2406.17359

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗