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

Quantifying information loss on chaotic attractors through recurrence networks

86   0   0.0 ( 0 )
 نشر من قبل G Ambika
 تاريخ النشر 2019
  مجال البحث فيزياء
والبحث باللغة English




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

We propose an entropy measure for the analysis of chaotic attractors through recurrence networks which are un-weighted and un-directed complex networks constructed from time series of dynamical systems using specific criteria. We show that the proposed measure converges to a constant value with increase in the number of data points on the attractor (or the number of nodes on the network) and the embedding dimension used for the construction of the network, and clearly distinguishes between the recurrence network from chaotic time series and white noise. Since the measure is characteristic to the network topology, it can be used to quantify the information loss associated with the structural change of a chaotic attractor in terms of the difference in the link density of the corresponding recurrence networks. We also indicate some practical applications of the proposed measure in the recurrence analysis of chaotic attractors as well as the relevance of the proposed measure in the context of the general theory of complex networks.



قيم البحث

اقرأ أيضاً

The preferential attachment (PA) process is a popular theory for explaining network power-law degree distributions. In PA, the probability that a new vertex adds an edge to an existing vertex depends on the connectivity of the target vertex. In real- world networks, however, each vertex may have asymmetric accessibility to information. Here we address this issue using a new network-generation mechanism that incorporates asymmetric accessibility to upstream and downstream information. We show that this asymmetric information accessibility directly affects the power-law exponent, producing a broad range of values that are consistent with observations. Our findings shed new light on the possible mechanisms in three important real-world networks: a citation network, a hyperlink network, and an online social network.
An avalanche or cascade occurs when one event causes one or more subsequent events, which in turn may cause further events in a chain reaction. Avalanching dynamics are studied in many disciplines, with a recent focus on average avalanche shapes, i.e ., the temporal profiles that characterize the growth and decay of avalanches of fixed duration. At the critical point of the dynamics the average avalanche shapes for different durations can be rescaled so that they collapse onto a single universal curve. We apply Markov branching process theory to derive a simple equation governing the average avalanche shape for cascade dynamics on networks. Analysis of the equation at criticality demonstrates that nonsymmetric average avalanche shapes (as observed in some experiments) occur for certain combinations of dynamics and network topology; specifically, on networks with heavy-tailed degree distributions. We give examples using numerical simulations of models for information spreading, neural dynamics, and behaviour adoption and we propose simple experimental tests to quantify whether cascading systems are in the critical state.
Based on a theoretical model for opinion spreading on a network, through avalanches, the effect of external field is now considered, by using methods from non-equilibrium statistical mechanics. The original part contains the implementation that the a valanche is only triggered when a local variable (a so called awareness) reaches and goes above a threshold. The dynamical rules are constrained to be as simple as possible, in order to sort out the basic features, though more elaborated variants are proposed. Several results are obtained for a Erdos-Renyi network and interpreted through simple analytical laws, scale free or logistic map-like, i.e., (i) the sizes, durations, and number of avalanches, including the respective distributions, (ii) the number of times the external field is applied to one possible node before all nodes are found to be above the threshold, (iii) the number of nodes still below the threshold and the number of hot nodes (close to threshold) at each time step.
Productive societies feature high levels of cooperation and strong connections between individuals. Public Goods Games (PGGs) are frequently used to study the development of social connections and cooperative behavior in model societies. In such game s, contributions to the public good are made only by cooperators, while all players, including defectors, can reap public goods benefits. Classic results of game theory show that mutual defection, as opposed to cooperation, is the Nash Equilibrium of PGGs in well-mixed populations, where each player interacts with all others. In this paper, we explore the coevolutionary dynamics of a low information public goods game on a network without spatial constraints in which players adapt to their environment in order to increase individual payoffs. Players adapt by changing their strategies, either to cooperate or to defect, and by altering their social connections. We find that even if players do not know other players strategies and connectivity, cooperation can arise and persist despite large short-term fluctuations.
Recommendations around epidemics tend to focus on individual behaviors, with much less efforts attempting to guide event cancellations and other collective behaviors since most models lack the higher-order structure necessary to describe large gather ings. Through a higher-order description of contagions on networks, we model the impact of a blanket cancellation of events larger than a critical size and find that epidemics can suddenly collapse when interventions operate over groups of individuals rather than at the level of individuals. We relate this phenomenon to the onset of mesoscopic localization, where contagions concentrate around dominant groups.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

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