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

Super-linear scaling of offsprings at criticality in branching processes

123   0   0.0 ( 0 )
 نشر من قبل Didier Sornette
 تاريخ النشر 2013
  مجال البحث فيزياء
والبحث باللغة English




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

For any branching process, we demonstrate that the typical total number $r_{rm mp}( u tau)$ of events triggered over all generations within any sufficiently large time window $tau$ exhibits, at criticality, a super-linear dependence $r_{rm mp}( u tau) sim ( u tau)^gamma$ (with $gamma >1$) on the total number $ u tau$ of the immigrants arriving at the Poisson rate $ u$. In branching processes in which immigrants (or sources) are characterized by fertilities distributed according to an asymptotic power law tail with tail exponent $1 < gamma leqslant 2$, the exponent of the super-linear law for $r_{rm mp}( u tau)$ is identical to the exponent $gamma$ of the distribution of fertilities. For $gamma>2$ and for standard branching processes without power law distribution of fertilities, $r_{rm mp}( u tau) sim ( u tau)^2$. This novel scaling law replaces and tames the divergence $ u tau/(1-n)$ of the mean total number ${bar R}_t(tau)$ of events, as the branching ratio (defined as the average number of triggered events of first generation per source) tends to 1. The derivation uses the formalism of generating probability functions. The corresponding prediction is confirmed by numerical calculations and an heuristic derivation enlightens its underlying mechanism. We also show that ${bar R}_t(tau)$ is always linear in $ u tau$ even at criticality ($n=1$). Our results thus illustrate the fundamental difference between the mean total number, which is controlled by a few extremely rare realizations, and the typical behavior represented by $r_{rm mp}( u tau)$.



قيم البحث

اقرأ أيضاً

As a classical state, for instance a digitized image, is transferred through a classical channel, it decays inevitably with the distance due to the surroundings interferences. However, if there are enough number of repeaters, which can both check and recover the states information continuously, the states decay rate will be significantly suppressed, then a classical Zeno effect might occur. Such a physical process is purely classical and without any interferences of living beings, therefore, it manifests that the Zeno effect is no longer a patent of quantum mechanics, but does exist in classical stochastic processes.
258 - Shinsuke Koyama 2013
The fluctuation scaling law has universally been observed in a wide variety of phenomena. For counting processes describing the number of events occurred during time intervals, it is expressed as a power function relationship between the variance and the mean of the event count per unit time, the characteristic exponent of which is obtained theoretically in the limit of long duration of counting windows. Here I show that the scaling law effectively appears even in a short timescale in which only a few events occur. Consequently, the counting statistics of nonstationary event sequences are shown to exhibit the scaling law as well as the dynamics at temporal resolution of this timescale. I also propose a method to extract in a systematic manner the characteristic scaling exponent from nonstationary data.
We study the avalanche statistics observed in a minimal random growth model. The growth is governed by a reproduction rate obeying a probability distribution with finite mean a and variance va. These two control parameters determine if the avalanche size tends to a stationary distribution, (Finite Scale statistics with finite mean and variance or Power-Law tailed statistics with exponent in (1, 3]), or instead to a non-stationary regime with Log-Normal statistics. Numerical results and their statistical analysis are presented for a uniformly distributed growth rate, which are corroborated and generalized by analytical results. The latter show that the numerically observed avalanche regimes exist for a wide family of growth rate distributions and provide a precise definition of the boundaries between the three regimes.
We propose a novel algorithm that outputs the final standings of a soccer league, based on a simple dynamics that mimics a soccer tournament. In our model, a team is created with a defined potential(ability) which is updated during the tournament acc ording to the results of previous games. The updated potential modifies a teams future winning/losing probabilities. We show that this evolutionary game is able to reproduce the statistical properties of final standings of actual editions of the Brazilian tournament (Brasileir~{a}o). However, other leagues such as the Italian and the Spanish tournaments have notoriously non-Gaussian traces and cannot be straightforwardly reproduced by this evolutionary non-Markovian model. A complete understanding of these phenomena deserves much more attention, but we suggest a simple explanation based on data collected in Brazil: Here several teams were crowned champion in previous editions corroborating that the champion typically emerges from random fluctuations that partly preserves the gaussian traces during the tournament. On the other hand, in the Italian and Spanish leagues only a few teams in recent history have won their league tournaments. These leagues are based on more robust and hierarchical structures established even before the beginning of the tournament. For the sake of completeness, we also elaborate a totally Gaussian model (which equalizes the winning, drawing, and losing probabilities) and we show that the scores of the Brasileir~{a}o cannot be reproduced. Such aspects stress that evolutionary aspects are not superfluous in our modeling. Finally, we analyse the distortions of our model in situations where a large number of teams is considered, showing the existence of a transition from a single to a double peaked histogram of the final classification scores. An interesting scaling is presented for different sized tournaments.
We investigate a stationary processs crypticity---a measure of the difference between its hidden state information and its observed information---using the causal states of computational mechanics. Here, we motivate crypticity and cryptic order as ph ysically meaningful quantities that monitor how hidden a hidden process is. This is done by recasting previous results on the convergence of block entropy and block-state entropy in a geometric setting, one that is more intuitive and that leads to a number of new results. For example, we connect crypticity to how an observer synchronizes to a process. We show that the block-causal-state entropy is a convex function of block length. We give a complete analysis of spin chains. We present a classification scheme that surveys stationary processes in terms of their possible cryptic and Markov orders. We illustrate related entropy convergence behaviors using a new form of foliated information diagram. Finally, along the way, we provide a variety of interpretations of crypticity and cryptic order to establish their naturalness and pervasiveness. Hopefully, these will inspire new applications in spatially extended and network dynamical systems.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

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