arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2501.05973math.DS
收藏

由两个循环组成的图导出的完整异宿网络

Complete heteroclinic networks derived from graphs consisting of two cycles

Faculdade de Economia and Centro de Matemática, Universidade do Porto(波尔图大学经济系与数学中心);Fachbereich Mathematik, Universität Hamburg(汉堡大学数学系)

Sofia B. S. D. Castro, Alexander Lohse

AI总结:

本文提出了一种方法,通过扩展由两个循环组成的图并应用单纯形方法,构造出包含所有平衡点不稳定流形的完整异宿网络,并讨论了正特征值对循环稳定性的影响。

摘要:

我们探讨了给定的连接结构(有向图)如何能够实现为一个完整的异宿网络,即包含其所有平衡点的不稳定流形。对于由两个循环组成的有向图,我们提供了一种构造方法:(i)通过添加一些边来扩展图;(ii)应用单纯形方法以获得相空间中的网络。根据循环的长度,我们推导出所需新边的最小数量。在所得到的网络中,每条添加的边都会在相应的平衡点处产生正的横截特征值。我们讨论了单个循环中的总正特征值数量以及这对循环稳定性的一些影响。

英文摘要:

We address the question how a given connection structure (directed graph) can be realised as a heteroclinic network that is complete in the sense that it contains all unstable manifolds of its equilibria. For a directed graph consisting of two cycles we provide a constructive method to achieve this: (i) enlarge the graph by adding some edges and (ii) apply the simplex method to obtain a network in phase space. Depending on the length of the cycles we derive the minimal number of required new edges. In the resulting network each added edge leads to a positive transverse eigenvalue at the respective equilibrium. We discuss the total number of such positive eigenvalues in an individual cycle and some implications for the stability of this cycle.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑