اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدOn a Connection between Entropy, Extensive Measurement and Memoryless Characterization
194
0
0.0
(
0
)
تأليف
Peter Sunehag
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We define an entropy based on a chosen governing probability distribution. If a certain kind of measurements follow such a distribution it also gives us a suitable scale to study it with. This scale will appear as a link function that is applied to the measurements. A link function can also be used to define an alternative structure on a set. We will see that generalized entropies are equivalent to using a different scale for the phenomenon that is studied compared to the scale the measurements arrive on. An extensive measurement scale is here a scale for which measurements fulfill a memoryless property. We conclude that the alternative algebraic structure defined by the link function must be used if we continue to work on the original scale. We derive Tsallis entropy by using a generalized log-logistic governing distribution. Typical applications of Tsallis entropy are related to phenomena with power-law behaviour.
قيم البحث
اقرأ أيضاً
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.
Usually, equal time is given to measuring the background and the sample, or even a longer background measurement is taken as it has so few counts. While this seems the right thing to do, the relative error after background subtraction improves when m
ore time is spent counting the measurement with the highest amount of scattering. As the available measurement time is always limited, a good division must be found between measuring the background and sample, so that the uncertainty of the background-subtracted intensity is as low as possible. Herein outlined is the method to determine how best to divide measurement time between a sample and the background, in order to minimize the relative uncertainty. Also given is the relative reduction in uncertainty to be gained from the considered division. It is particularly useful in the case of scanning diffractometers, including the likes of Bonse-Hart cameras, where the measurement time division for each point can be optimized depending on the signal-to-noise ratio.
We introduce a contrarian opinion (CO) model in which a fraction p of contrarians within a group holds a strong opinion opposite to the opinion held by the rest of the group. At the initial stage, stable clusters of two opinions, A and B exist. Then
we introduce contrarians which hold a strong B opinion into the opinion A group. Through their interactions, the contrarians are able to decrease the size of the largest A opinion cluster, and even destroy it. We see this kind of method in operation, e.g when companies send free new products to potential customers in order to convince them to adopt the product and influence others. We study the CO model, using two different strategies, on both ER and scale-free networks. In strategy I, the contrarians are positioned at random. In strategy II, the contrarians are chosen to be the highest degrees nodes. We find that for both strategies the size of the largest A cluster decreases to zero as p increases as in a phase transition. At a critical threshold value p_c the system undergoes a second-order phase transition that belongs to the same universality class of mean field percolation. We find that even for an ER type model, where the degrees of the nodes are not so distinct, strategy II is significantly more effctive in reducing the size of the largest A opinion cluster and, at very small values of p, the largest A opinion cluster is destroyed.
It is studied the MIT-BIH Normal Sinus Rhythm Database using a statistical technique of analysis, that is based on the Wavelet and Hilbert Transforms. With that technique, it was previously found, that there is a collective and intrinsic dynamical be
havior up to a scale of 64 heartbeats. Now it is shown, that using the Biorthogonal wavelet bior3.1 such a behavior reaches the scale 1024. That result confirms, that the circulatory system is out of equilibrium. According to the Statistical Mechanics of Tsallis, and a recent interpretation of G. Wilk et al. respect to the non extensive parameter q, the healthy human being is characterized by q=1.70+/-0.01.
Since Bandt and Pompes seminal work, permutation entropy has been used in several applications and is now an essential tool for time series analysis. Beyond becoming a popular and successful technique, permutation entropy inspired a framework for map
ping time series into symbolic sequences that triggered the development of many other tools, including an approach for creating networks from time series known as ordinal networks. Despite the increasing popularity, the computational development of these methods is fragmented, and there were still no efforts focusing on creating a unified software package. Here we present ordpy, a simple and open-source Python module that implements permutation entropy and several of the principal methods related to Bandt and Pompes framework to analyze time series and two-dimensional data. In particular, ordpy implements permutation entropy, Tsallis and Renyi permutation entropies, complexity-entropy plane, complexity-entropy curves, missing ordinal patterns, ordinal networks, and missing ordinal transitions for one-dimensional (time series) and two-dimensional (images) data as well as their multiscale generalizations. We review some theoretical aspects of these tools and illustrate the use of ordpy by replicating several literature results.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
