The foundations of statistical mechanics from entanglement: Individual states vs. averages

We consider an alternative approach to the foundations of statistical mechanics, in which subjective randomness, ensemble-averaging or time-averaging are not required. Instead, the universe (i.e. the system together with a sufficiently large environment) is in a quantum pure state subject to a global constraint, and thermalisation results from entanglement between system and environment. We formulate and prove a "General Canonical Principle", which states that the system will be thermalised for almost all pure states of the universe, and provide rigorous quantitative bounds using Levy's Lemma.Comment: 12 pages, v3 title changed, v2 minor change

A Novel Estimator for the Rate of Information Transfer by Continuous Signals

The information transfer rate provides an objective and rigorous way to quantify how much information is being transmitted through a communications channel whose input and output consist of time-varying signals. However, current estimators of information content in continuous signals are typically based on assumptions about the system's linearity and signal statistics, or they require prohibitive amounts of data. Here we present a novel information rate estimator without these limitations that is also optimized for computational efficiency. We validate the method with a simulated Gaussian information channel and demonstrate its performance with two example applications. Information transfer between the input and output signals of a nonlinear system is analyzed using a sensory receptor neuron as the model system. Then, a climate data set is analyzed to demonstrate that the method can be applied to a system based on two outputs generated by interrelated random processes. These analyses also demonstrate that the new method offers consistent performance in situations where classical methods fail. In addition to these examples, the method is applicable to a wide range of continuous time series commonly observed in the natural sciences, economics and engineering

Inference of gene regulatory networks from time series by Tsallis entropy

Background: The inference of gene regulatory networks (GRNs) from large-scale expression profiles is one of the most challenging problems of Systems Biology nowadays. Many techniques and models have been proposed for this task. However, it is not generally possible to recover the original topology with great accuracy, mainly due to the short time series data in face of the high complexity of the networks and the intrinsic noise of the expression measurements. In order to improve the accuracy of GRNs inference methods based on entropy (mutual information), a new criterion function is here proposed. Results: In this paper we introduce the use of generalized entropy proposed by Tsallis, for the inference of GRNs from time series expression profiles. The inference process is based on a feature selection approach and the conditional entropy is applied as criterion function. In order to assess the proposed methodology, the algorithm is applied to recover the network topology from temporal expressions generated by an artificial gene network (AGN) model as well as from the DREAM challenge. The adopted AGN is based on theoretical models of complex networks and its gene transference function is obtained from random drawing on the set of possible Boolean functions, thus creating its dynamics. On the other hand, DREAM time series data presents variation of network size and its topologies are based on real networks. The dynamics are generated by continuous differential equations with noise and perturbation. By adopting both data sources, it is possible to estimate the average quality of the inference with respect to different network topologies, transfer functions and network sizes. Conclusions: A remarkable improvement of accuracy was observed in the experimental results by reducing the number of false connections in the inferred topology by the non-Shannon entropy. The obtained best free parameter of the Tsallis entropy was on average in the range 2.5 <= q <= 3.5 (hence, subextensive entropy), which opens new perspectives for GRNs inference methods based on information theory and for investigation of the nonextensivity of such networks. The inference algorithm and criterion function proposed here were implemented and included in the DimReduction software, which is freely available at http://sourceforge.net/projects/dimreduction and http://code.google.com/p/dimreduction/.Fundacao de Amparo e Amparo a Pesquisa do Estado de Sao Paulo (FAPESP)Coordenacao de Aperfeicofamento de Pessoal de Nivel Superior (CAPES)Conselho Nacional de Desenvolvimento Cientifico e Tecnologico (CNPq

Informational entropy : a failure tolerance and reliability surrogate for water distribution networks

Evolutionary algorithms are used widely in optimization studies on water distribution networks. The optimization algorithms use simulation models that analyse the networks under various operating conditions. The solution process typically involves cost minimization along with reliability constraints that ensure reasonably satisfactory performance under abnormal operating conditions also. Flow entropy has been employed previously as a surrogate reliability measure. While a body of work exists for a single operating condition under steady state conditions, the effectiveness of flow entropy for systems with multiple operating conditions has received very little attention. This paper describes a multi-objective genetic algorithm that maximizes the flow entropy under multiple operating conditions for any given network. The new methodology proposed is consistent with the maximum entropy formalism that requires active consideration of all the relevant information. Furthermore, an alternative but equivalent flow entropy model that emphasizes the relative uniformity of the nodal demands is described. The flow entropy of water distribution networks under multiple operating conditions is discussed with reference to the joint entropy of multiple probability spaces, which provides the theoretical foundation for the optimization methodology proposed. Besides the rationale, results are included that show that the most robust or failure-tolerant solutions are achieved by maximizing the sum of the entropies

Integer and Fractional Order Entropy Analysis of Earthquake Data-series

This paper studies the statistical distributions of worldwide earthquakes from year 1963 up to year 2012. A Cartesian grid, dividing Earth into geographic regions, is considered. Entropy and the Jensen–Shannon divergence are used to analyze and compare real-world data. Hierarchical clustering and multi-dimensional scaling techniques are adopted for data visualization. Entropy-based indices have the advantage of leading to a single parameter expressing the relationships between the seismic data. Classical and generalized (fractional) entropy and Jensen–Shannon divergence are tested. The generalized measures lead to a clear identification of patterns embedded in the data and contribute to better understand earthquake distributions

Собрание узаконений и распоряжений правительства, издаваемое при Правительствующем Сенате. 1884. Первое полугодие. № 020. Ст. 166-168

We address the question whether there is an explanation for the fact that as Fodor put it the micro-level “converges on stable macro-level properties”, and whether there are lessons from this explanation for other issues in the vicinity. We argue that stability in large systems can be understood in terms of statistical limit theorems. In the thermodynamic limit of infinite system size N → ∞ systems will have strictly stable macroscopic properties in the sense that transitions between different macroscopic phases of matter (if there are any) will not occur in finite time. Indeed stability in this sense is a consequence of the absence of fluctuations, as (large) fluctuations would be required to induce such macroscopic transformations. These properties can be understood in terms of coarse-grained descriptions, and the statistical limit theorems for independent or weakly dependent random variable describing the behaviour averages and the statistics of fluctuations in the large system limit. We argue that RNG analyses applied to off-critical systems can provide a rationalization for the applicability of these limit theorems. Furthermore we discuss some related issues as, for example, the role of the infinite-system idealization