arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2410.05520math.DSnlin.CD
收藏

什么是动力系统的图?

What is the graph of a dynamical system?

Chirag Adwani, Roberto De Leo, James A. Yorke

AI总结:

本文为涵盖逻辑斯谛映射到偏微分方程的任意动力系统定义了基于“epsilon-链”的“链图”概念,并在温和假设下证明了其连通性。

摘要:

任何动力系统的一些基本性质都可以用图来概括。我们理论中的动力系统涵盖了从逻辑斯谛映射到常微分方程再到耗散偏微分方程的系统。我们的目标是为任何动力系统定义一个有意义的图的概念。因此,我们将“链图”的定义建立在“epsilon-链”之上,用链来定义图的节点和边。具体而言,节点通常是极大极限集,如果存在一条轨迹,其前向极限集在一个节点中而后向极限集在另一个节点中,则这两个节点之间存在一条边。我们最初的目标是证明动力系统的每个“链图”在某种意义上都是连通的,并且我们在温和的假设下证明了连通性。

英文摘要:

Some of the basic properties of any dynamical system can be summarized by a graph. The dynamical systems in our theory run from maps like the logistic map to ordinary differential equations to dissipative partial differential equations. Our goal has been to define a meaningful concept of graph of any dynamical system. As a result, we base our definition of ``chain graph'' on ``epsilon-chains'', defining both nodes and edges of the graph in terms of chains. In particular, nodes are often maximal limit sets and there is an edge between two nodes if there is a trajectory whose forward limit set is in one node and its backward limit set is in the other. Our initial goal was to prove that every ``chain graph'' of a dynamical system is, in some sense, connected, and we prove connectedness under mild hypotheses.

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

↑