Mean Li-Yorke chaos in Banach spaces

We investigate the notion of mean Li-Yorke chaos for operators on Banach spaces. We show that it differs from the notion of distributional chaos of type 2, contrary to what happens in the context of topological dynamics on compact metric spaces. We prove that an operator is mean Li-Yorke chaotic if and only if it has an absolutely mean irregular vector. As a consequence, absolutely Ces\`aro bounded operators are never mean Li-Yorke chaotic. Dense mean Li-Yorke chaos is shown to be equivalent to the existence of a dense (or residual) set of absolutely mean irregular vectors. As a consequence, every mean Li-Yorke chaotic operator is densely mean Li-Yorke chaotic on some infinite-dimensional closed invariant subspace. A (Dense) Mean Li-Yorke Chaos Criterion and a sufficient condition for the existence of a dense absolutely mean irregular manifold are also obtained. Moreover, we construct an example of an invertible hypercyclic operator $T$ such that every nonzero vector is absolutely mean irregular for both $T$ and $T^{-1}$. Several other examples are also presented. Finally, mean Li-Yorke chaos is also investigated for $C_0$-semigroups of operators on Banach spaces.Comment: 26 page

Election results and the Sznajd model on Barabasi network

The network of Barabasi and Albert, a preferential growth model where a new node is linked to the old ones with a probability proportional to their connectivity, is applied to Brazilian election results. The application of the Sznajd rule, that only agreeing pairs of people can convince their neighbours, gives a vote distribution in good agreement with reality.Comment: 7 pages including two figures, for Eur. Phys. J.

The Sznajd Consensus Model with Continuous Opinions

In the consensus model of Sznajd, opinions are integers and a randomly chosen pair of neighbouring agents with the same opinion forces all their neighbours to share that opinion. We propose a simple extension of the model to continuous opinions, based on the criterion of bounded confidence which is at the basis of other popular consensus models. Here the opinion s is a real number between 0 and 1, and a parameter \epsilon is introduced such that two agents are compatible if their opinions differ from each other by less than \epsilon. If two neighbouring agents are compatible, they take the mean s_m of their opinions and try to impose this value to their neighbours. We find that if all neighbours take the average opinion s_m the system reaches complete consensus for any value of the confidence bound \epsilon. We propose as well a weaker prescription for the dynamics and discuss the corresponding results.Comment: 11 pages, 4 figures. To appear in International Journal of Modern Physics

On the Consensus Threshold for the Opinion Dynamics of Krause-Hegselmann

In the consensus model of Krause-Hegselmann, opinions are real numbers between 0 and 1 and two agents are compatible if the difference of their opinions is smaller than the confidence bound parameter \epsilon. A randomly chosen agent takes the average of the opinions of all neighbouring agents which are compatible with it. We propose a conjecture, based on numerical evidence, on the value of the consensus threshold \epsilon_c of this model. We claim that \epsilon_c can take only two possible values, depending on the behaviour of the average degree d of the graph representing the social relationships, when the population N goes to infinity: if d diverges when N goes to infinity, \epsilon_c equals the consensus threshold \epsilon_i ~ 0.2 on the complete graph; if instead d stays finite when N goes to infinity, \epsilon_c=1/2 as for the model of Deffuant et al.Comment: 15 pages, 7 figures, to appear in International Journal of Modern Physics C 16, issue 2 (2005

The Krause-Hegselmann Consensus Model with Discrete Opinions

The consensus model of Krause and Hegselmann can be naturally extended to the case in which opinions are integer instead of real numbers. Our algorithm is much faster than the original version and thus more suitable for applications. For the case of a society in which everybody can talk to everybody else, we find that the chance to reach consensus is much higher as compared to other models; if the number of possible opinions Q<=7, in fact, consensus is always reached, which might explain the stability of political coalitions with more than three or four parties. For Q>7 the number S of surviving opinions is approximately the same independently of the size N of the population, as long as Q<N. We considered as well the more realistic case of a society structured like a Barabasi-Albert network; here the consensus threshold depends on the outdegree of the nodes and we find a simple scaling law for S, as observed for the discretized Deffuant model.Comment: 12 pages, 6 figure

Recent results on femtoscopic correlations with the CMS experiment

The study of femtoscopic correlations in high-energy collisions is a powerful tool to investigate the space-time structure of the particle emitting region formed in such collisions, as well as to probe interactions that the involved particles may undergo after being emitted. An overview of the recent results from the CMS experiment at the LHC on the two-particle femtoscopic correlations measurements using charged particles and identified hadrons in pp and PbPb collisions is presented. In general, the femtoscopic parameters are obtained assuming a Gaussian or an exponential shape to describe the emitting source distribution. In some cases, however, the generalized Gaussian, i.e., the symmetric alpha-stable L\'evy distribution, is favored to describe the source. Some of the measurements allow to extract the parameters of the strong interaction felt by hadrons using their femtoscopic correlations. The studies are performed in a wide range of the pair average transverse momentum (or average transverse mass) and charged particle multiplicities. In addition, prospects for future physics results using the CMS experiment are also discussed.Comment: 6 pages, 6 figures, Proceedings ICHEP202

Probing quantum fluctuation theorems in engineered reservoirs

Fluctuation Theorems are central in stochastic thermodynamics, as they allow for quantifying the irreversibility of single trajectories. Although they have been experimentally checked in the classical regime, a practical demonstration in the framework of quantum open systems is still to come. Here we propose a realistic platform to probe fluctuation theorems in the quantum regime. It is based on an effective two-level system coupled to an engineered reservoir, that enables the detection of the photons emitted and absorbed by the system. When the system is coherently driven, a measurable quantum component in the entropy production is evidenced. We quantify the error due to photon detection inefficiency, and show that the missing information can be efficiently corrected, based solely on the detected events. Our findings provide new insights into how the quantum character of a physical system impacts its thermodynamic evolution.Comment: 9 pages, 4 figure

The Spread of Opinions and Proportional Voting

Election results are determined by numerous social factors that affect the formation of opinion of the voters, including the network of interactions between them and the dynamics of opinion influence. In this work we study the result of proportional elections using an opinion dynamics model similar to simple opinion spreading over a complex network. Erdos-Renyi, Barabasi-Albert, regular lattices and randomly augmented lattices are considered as models of the underlying social networks. The model reproduces the power law behavior of number of candidates with a given number of votes found in real elections with the correct slope, a cutoff for larger number of votes and a plateau for small number of votes. It is found that the small world property of the underlying network is fundamental for the emergence of the power law regime.Comment: 10 pages, 7 figure

Emergence of Hierarchy on a Network of Complementary Agents

Complementarity is one of the main features underlying the interactions in biological and biochemical systems. Inspired by those systems we propose a model for the dynamical evolution of a system composed by agents that interact due to their complementary attributes rather than their similarities. Each agent is represented by a bit-string and has an activity associated to it; the coupling among complementary peers depends on their activity. The connectivity of the system changes in time respecting the constraint of complementarity. We observe the formation of a network of active agents whose stability depends on the rate at which activity diffuses in the system. The model exhibits a non-equilibrium phase transition between the ordered phase, where a stable network is generated, and a disordered phase characterized by the absence of correlation among the agents. The ordered phase exhibits multi-modal distributions of connectivity and activity, indicating a hierarchy of interaction among different populations characterized by different degrees of activity. This model may be used to study the hierarchy observed in social organizations as well as in business and other networks.Comment: 13 pages, 4 figures, submitte

Plurality Voting: the statistical laws of democracy in Brazil

We explore the statistical laws behind the plurality voting system by investigating the election results for mayor held in Brazil in 2004. Our analysis indicate that the vote partition among mayor candidates of the same city tends to be "polarized" between two candidates, a phenomenon that can be closely described by means of a simple fragmentation model. Complex concepts like "government continuity" and "useful vote" can be identified and even statistically quantified through our approach.Comment: 4 pages, 4 figure