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

耦合Logistic映射网络的实性与复性

Real and complex behavior for networks of coupled logistic maps

Anca Radulescu, Ariel Pignatelli

摘要:

许多自然系统被组织成网络,其中节点以时间依赖的方式相互作用。我们研究的目的是将连接性与网络的时间行为联系起来,其中节点是(真实的或复杂的)Logistic映射,根据遵守某些约束的连接方案耦合,但也包含随机方面。我们特别调查的系统架构和可能的动态之间的关系。在本文中,我们专注于建立低维网络的框架,术语和相关问题。随后的论文将进一步解决高维网络中的硬连线和动态之间的关系。对于复杂和真实节点映射的网络,我们定义了传统上在单个映射迭代的上下文中定义的Julia和Mandelbrot集的扩展。对于三个不同的模型网络,我们使用分析和数值工具的组合来说明系统的行为(通过朱利亚集的拓扑性质测量)如何改变扰动时,底层邻接图。我们区分不同的扰动,直接调制网络的连接动态的影响:增加/减少边的权重,并通过添加,删除或移动边缘改变边缘配置。我们讨论的影响,考虑一个严格的扩展Fatou-Julia理论已知适用于迭代的单个地图,迭代的集合耦合的地图作为节点在网络中。

英文摘要:

Many natural systems are organized as networks, in which the nodes interact in a time-dependent fashion. The object of our study is to relate connectivity to the temporal behavior of a network in which the nodes are (real or complex) logistic maps, coupled according to a connectivity scheme that obeys certain constrains, but also incorporates random aspects. We investigate in particular the relationship between the system architecture and possible dynamics. In the current paper we focus on establishing the framework, terminology and pertinent questions for low-dimensional networks. A subsequent paper will further address the relationship between hardwiring and dynamics in high-dimensional networks. For networks of both complex and real node-maps, we define extensions of the Julia and Mandelbrot sets traditionally defined in the context of single map iterations. For three different model networks, we use a combination of analytical and numerical tools to illustrate how the system behavior (measured via topological properties of the Julia sets) changes when perturbing the underlying adjacency graph. We differentiate between the effects on dynamics of different perturbations that directly modulate network connectivity: increasing/decreasing edge weights, and altering edge configuration by adding, deleting or moving edges. We discuss the implications of considering a rigorous extension of Fatou-Julia theory known to apply for iterations of single maps, to iterations of ensembles of maps coupled as nodes in a network.

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

↑