ترغب بنشر مسار تعليمي؟ اضغط هنا

Mapping dynamical systems onto complex networks

231   0   0.0 ( 0 )
 نشر من قبل Ernesto Pinheiro Borges
 تاريخ النشر 2006
  مجال البحث فيزياء
والبحث باللغة English




اسأل ChatGPT حول البحث

A procedure to characterize chaotic dynamical systems with concepts of complex networks is pursued, in which a dynamical system is mapped onto a network. The nodes represent the regions of space visited by the system, while edges represent the transitions between these regions. Parameters used to quantify the properties of complex networks, including those related to higher order neighborhoods, are used in the analysis. The methodology is tested for the logistic map, focusing the onset of chaos and chaotic regimes. It is found that the corresponding networks show distinct features, which are associated to the particular type of dynamics that have generated them.



قيم البحث

اقرأ أيضاً

161 - Ruoshi Yuan , Xinan Wang , Yian Ma 2012
We find exact mappings for a class of limit cycle systems with noise onto quasi-symplectic dynamics, including a van der Pol type oscillator. A dual role potential function is obtained as a component of the quasi-symplectic dynamics. Based on a stoch astic interpretation different from the traditional Itos and Stratonovichs, we show the corresponding steady state distribution is the familiar Boltzmann-Gibbs type for arbitrary noise strength. The result provides a new angle for understanding processes without detailed balance and can be verified by experiments.
Many real-world complex networks arise as a result of a competition between growth and rewiring processes. Usually the initial part of the evolution is dominated by growth while the later one rather by rewiring. The initial growth allows the network to reach a certain size while rewiring to optimise its function and topology. As a model example we consider tree networks which first grow in a stochastic process of node attachment and then age in a stochastic process of local topology changes. The ageing is implemented as a Markov process that preserves the node-degree distribution. We quantify differences between the initial and aged network topologies and study the dynamics of the evolution. We implement t
We develop a geometric framework to study the structure and function of complex networks. We assume that hyperbolic geometry underlies these networks, and we show that with this assumption, heterogeneous degree distributions and strong clustering in complex networks emerge naturally as simple reflections of the negative curvature and metric property of the underlying hyperbolic geometry. Conversely, we show that if a network has some metric structure, and if the network degree distribution is heterogeneous, then the network has an effective hyperbolic geometry underneath. We then establish a mapping between our geometric framework and statistical mechanics of complex networks. This mapping interprets edges in a network as non-interacting fermions whose energies are hyperbolic distances between nodes, while the auxiliary fields coupled to edges are linear functions of these energies or distances. The geometric network ensemble subsumes the standard configuration model and classical random graphs as two limiting cases with degenerate geometric structures. Finally, we show that targeted transport processes without global topology knowledge, made possible by our geometric framework, are maximally efficient, according to all efficiency measures, in networks with strongest heterogeneity and clustering, and that this efficiency is remarkably robust with respect to even catastrophic disturbances and damages to the network structure.
We study the extreme events taking place on complex networks. The transport on networks is modelled using random walks and we compute the probability for the occurance and recurrence of extreme events on the network. We show that the nodes with small er number of links are more prone to extreme events than the ones with larger number of links. We obtain analytical estimates and verify them with numerical simulations. They are shown to be robust even when random walkers follow shortest path on the network. The results suggest a revision of design principles and can be used as an input for designing the nodes of a network so as to smoothly handle an extreme event.
The combination of the compactness of networks, featuring small diameters, and their complex architectures results in a variety of critical effects dramatically different from those in cooperative systems on lattices. In the last few years, researche rs have made important steps toward understanding the qualitatively new critical phenomena in complex networks. We review the results, concepts, and methods of this rapidly developing field. Here we mostly consider two closely related classes of these critical phenomena, namely structural phase transitions in the network architectures and transitions in cooperative models on networks as substrates. We also discuss systems where a network and interacting agents on it influence each other. We overview a wide range of critical phenomena in equilibrium and growing networks including the birth of the giant connected component, percolation, k-core percolation, phenomena near epidemic thresholds, condensation transitions, critical phenomena in spin models placed on networks, synchronization, and self-organized criticality effects in interacting systems on networks. We also discuss strong finite size effects in these systems and highlight open problems and perspectives.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا