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

Information slows down hierarchy growth

426   0   0.0 ( 0 )
 نشر من قبل Krzysztof Suchecki
 تاريخ النشر 2013
والبحث باللغة English




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

We consider models of growing multi-level systems wherein the growth process is driven by rules of tournament selection. A system can be conceived as an evolving tree with a new node being attached to a contestant node at the best hierarchy level (a level nearest to the tree root). The proposed evolution reflects limited information on system properties available to new nodes. It can also be expressed in terms of population dynamics. Two models are considered: a constant tournament (CT) model wherein the number of tournament participants is constant throughout system evolution, and a proportional tournament (PT) model where this number increases proportionally to the growing size of the system itself. The results of analytical calculations based on a rate equation fit well to numerical simulations for both models. In the CT model all hierarchy levels emerge but the birth time of a consecutive hierarchy level increases exponentially or faster for each new level. The number of nodes at the first hierarchy level grows logarithmically in time, while the size of the last, worst hierarchy level oscillates quasi log-periodically. In the PT model the occupations of the first two hierarchy levels increase linearly but worse hierarchy levels either do not emerge at all or appear only by chance in early stage of system evolution to further stop growing at all. The results allow to conclude that information available to each new node in tournament dynamics restrains the emergence of new hierarchy levels and that it is the absolute amount of information, not relative, which governs such behavior.



قيم البحث

اقرأ أيضاً

We study quantum many-body systems with a global U(1) conservation law, focusing on a theory of $N$ interacting fermions with charge conservation, or $N$ interacting spins with one conserved component of total spin. We define an effective operator si ze at finite chemical potential through suitably regularized out-of-time-ordered correlation functions. The growth rate of this density-dependent operator size vanishes algebraically with charge density; hence we obtain new bounds on Lyapunov exponents and butterfly velocities in charged systems at a given density, which are parametrically stronger than any Lieb-Robinson bound. We argue that the density dependence of our bound on the Lyapunov exponent is saturated in the charged Sachdev-Ye-Kitaev model. We also study random automaton quantum circuits and Brownian Sachdev-Ye-Kitaev models, each of which exhibit a different density dependence for the Lyapunov exponent, and explain the discrepancy. We propose that our results are a cartoon for understanding Planckian-limited energy-conserving dynamics at finite temperature.
We investigate how structural relaxation in mixtures with strong dynamical asymmetry is affected by the microscopic dynamics. Brownian and Newtonian dynamics simulations of dense mixtures of fast and slow hard spheres reveal a striking trend reversal . Below a critical density, increasing the mobility of the fast particles fluidizes the system, yet, above that critical density, the same increase in mobility strongly hinders the relaxation of the slow particles. The critical density itself does not depend on the dynamical asymmetry and can be identified with the glass-transition density of the mode-coupling theory. The asymptotic dynamics close to the critical density is universal, but strong pre-asymptotic effects prevail in mixtures with additional size asymmetry. This observation reconciles earlier findings of a strong dependence on kinetic parameters of glassy dynamics in colloid--polymer mixtures with the paradigm that the glass transition is determined by the properties of configuration space alone.
Hierarchical networks are prevalent in nature and society, corresponding to groups of actors - animals, humans or even robots - organised according to a pyramidal structure with decision makers at the top and followers at the bottom. While this pheno menon is seemingly universal, the underlying governing principles are poorly understood. Here we study the emergence of hierarchies in groups of people playing a simple dot guessing game in controlled experiments, lasting for about 40 rounds, conducted over the Internet. During the games, the players had the possibility to look at the answer of a limited number of other players of their choice. This act of asking for advice defines a directed connection between the involved players, and according to our analysis, the initial random configuration of the emerging networks became more structured overt time, showing signs of hierarchy towards the end of the game. In addition, the achieved score of the players appeared to be correlated with their position in the hierarchy. These results indicate that under certain conditions imitation and limited knowledge about the performance of other actors is sufficient for the emergence of hierarchy in a social group.
122 - M. Karsai , M. Kivela , R. K. Pan 2010
Communication networks show the small-world property of short paths, but the spreading dynamics in them turns out slow. We follow the time evolution of information propagation through communication networks by using the SI model with empirical data o n contact sequences. We introduce null models where the sequences are randomly shuffled in different ways, enabling us to distinguish between the contributions of different impeding effects. The slowing down of spreading is found to be caused mostly by weight-topology correlations and the bursty activity patterns of individuals.
We investigate dynamical self-friction, the process by which material that is stripped from a subhalo torques its remaining bound remnant, which causes it to lose orbital angular momentum. By running idealized simulations of a subhalo orbiting within an analytical host halo potential, we isolate the effect of self-friction from traditional dynamical friction due to the host halo. While at some points in a subhalos orbit the torque of the stripped material can boost the orbital angular momentum of the remnant, the net effect over the long term is orbital decay regardless of the initial orbital parameters or subhalo mass. In order to quantify the strength of self-friction, we run a suite of simulations spanning typical host-to-subhalo mass ratios and orbital parameters. We find that the time-scale for self-friction, defined as the exponential decay time of the subhalos orbital angular momentum, scales with mass ratio and orbital circularity similar to standard dynamical friction. The decay time due to self-friction is roughly an order of magnitude longer, suggesting that self-friction only contributes at the 10 percent level. However, along more radial orbits, self-friction can occasionally dominate over dynamical friction close to pericentric passage, where mass stripping is intense. This is also the epoch at which the self-friction torque undergoes large and rapid changes in both magnitude and direction, indicating that self-friction is an important process to consider when modeling pericentric passages of subhaloes and their associated satellite galaxies.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

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