arXiv subjects

E. Caglioti

Publications and source records attributed to E. Caglioti.

13 recordsLinked to original sources

arXiv2010

Relative entropy via non-sequential recursive pair substitutions

The entropy of an ergodic source is the limit of properly rescaled 1-block entropies of sources obtained applying successive non-sequential recursive pairs substitutions (see P. Grassberger 2002 ArXiv:physics/0207023 and D. Benedetto, E. Caglioti and D. Gabrielli 2006 Jour. Stat. Mech. Theo. Exp. 09 doi:10.1088/1742.-5468/2006/09/P09011). In this paper we prove that the cross entropy and the Kullback-Leibler divergence can be obtained in a similar way.

cs.IT↗

arXiv2010

A Stochastic Local Search algorithm for distance-based phylogeny reconstruction

In many interesting cases the reconstruction of a correct phylogeny is blurred by high mutation rates and/or horizontal transfer events. As a consequence a divergence arises between the true evolutionary distances and the differences between pairs of taxa as inferred from available data, making the phylogenetic reconstruction a challenging problem. Mathematically this divergence translates in a loss of additivity of the actual distances between taxa. In distance-based reconstruction methods, two properties of additive distances were extensively exploited as antagonist criteria to drive phylogeny reconstruction: on the one hand a local property of quartets, i.e., sets of four taxa in a tree, the four-points condition; on the other hand a recently proposed formula that allows to write the tree length as a function of the distances between taxa, the Pauplin's formula. Here we introduce a new reconstruction scheme, that exploits in a unified framework both the four-points condition and the Pauplin's formula. We propose, in particular, a new general class of distance-based Stochastic Local Search algorithms, which reduces in a limit case to the minimization of the Pauplin's length. When tested on artificially generated phylogenies our Stochastic Big-Quartet Swapping algorithmic scheme significantly outperforms state-of-art distance-based algorithms in cases of deviation from additivity due to high rate of back mutations. A significant improvement is also observed with respect to the state-of-art algorithms in case of high rate of horizontal transfer.

q-bio.PE↗

arXiv2008

On a constrained 2-D Navier-Stokes equation

The planar Navier-Stokes equation exhibits, in absence of external forces, a trivial asymptotics in time. Nevertheless the appearence of coherent structures suggests non-trivial intermediate asymptotics which should be explained in terms of the equation itself. Motivated by the separation of the different time scales observed in the dynamics of the Navier-Stokes equation, we study the well-posedness and asymptotic behaviour of a constrained equation which neglects the variation of the energy and moment of inertia.

math.AP↗

arXiv2008

2-D constrained Navier-Stokes equation and intermediate asymptotics

We introduce a modified version of the two-dimensional Navier-Stokes equation, preserving energy and momentum of inertia, which is motivated by the occurrence of different dissipation time scales and related to the gradient flow structure of the 2-D Navier-Stokes equation. The hope is to understand intermediate asymptotics. The analysis we present here is purely formal. A rigorous study of this equation will be done in a forthcoming paper.

math-ph↗

arXiv2006

On the propagation of a perturbation in an anharmonic system

We give a not trivial upper bound on the velocity of disturbances in an infinitely extended anharmonic system at thermal equilibrium. The proof is achieved by combining a control on the non equilibrium dynamics with an explicit use of the state invariance with respect to the time evolution.

math-ph↗

arXiv2006

Sharp transition towards shared vocabularies in multi-agent systems

What processes can explain how very large populations are able to converge on the use of a particular word or grammatical construction without global coordination? Answering this question helps to understand why new language constructs usually propagate along an S-shaped curve with a rather sudden transition towards global agreement. It also helps to analyze and design new technologies that support or orchestrate self-organizing communication systems, such as recent social tagging systems for the web. The article introduces and studies a microscopic model of communicating autonomous agents performing language games without any central control. We show that the system undergoes a disorder/order transition, going trough a sharp symmetry breaking process to reach a shared set of conventions. Before the transition, the system builds up non-trivial scale-invariant correlations, for instance in the distribution of competing synonyms, which display a Zipf-like law. These correlations make the system ready for the transition towards shared conventions, which, observed on the time-scale of collective behaviors, becomes sharper and sharper with system size. This surprising result not only explains why human language can scale up to very large populations but also suggests ways to optimize artificial semiotic dynamics.

physics.soc-ph↗

arXiv2004

Dictionary based methods for information extraction

In this paper we present a general method for information extraction that exploits the features of data compression techniques. We first define and focus our attention on the so-called "dictionary" of a sequence. Dictionaries are intrinsically interesting and a study of their features can be of great usefulness to investigate the properties of the sequences they have been extracted from (e.g. DNA strings). We then describe a procedure of string comparison between dictionary-created sequences (or "artificial texts") that gives very good results in several contexts. We finally present some results on self-consistent classification problems.

cond-mat.stat-mech↗

arXiv2003

Stability of Solutions of Hydrodynamic Equations Describing the Scaling Limit of a Massive Piston in an Ideal gas

We analyze the stability of stationary solutions of a singular Vlasov type hydrodynamic equation (HE). This equation was derived (under suitable assumptions) as the hydrodynamical scaling limit of the Hamiltonian evolution of a system consisting of a massive piston immersed in an ideal gas of point particles in a box. We find explicit criteria for global stability as well as a class of solutions which are linearly unstable for a dense set of parameter values. We present evidence (but no proof) that when the mechanical system has initial conditions ``close'' to stationary stable solutions of the HE then it stays close to these solutions for a time which is long compared to that for which the equations have been derived. On the other hand if the initial state of the particle system is close to an unstable stationary solutions of the HE the mechanical motion follows for an extended time a perturbed solution of that equation: we find such approximate periodic solutions that are linearly stable.

cond-mat.stat-mech↗

arXiv2002

Vertex-cover in random graphs with small connectivity: an exact solution

This paper has been withdrawn by the author, due to the fact that the main result in it has already been obtained in [1] for any c < e, see also [2] and [3]. Moreover the formula which gives the minimal vertex-cover in a tree (see the abstract) has already been derived in [4]. I thank M. Bauer, O. Golinelli, F. Ricci-Tersenghi, G. Semerjian and M. Weigt for having brought to my attention [1] and M.B. and O.G. for [4]. [1] M. Bauer and O. Golinelli, Eur. Phys. J. B 24, 339-352 (2001); [2] R. M. Karp and M. Sipser, Proc. 22nd IEEE Symposium on Foundations of Computing,(1981), 364-375; [3] J. Aronson, A. Frieze, and B.G. Pittel, Random Structures and Algorithms 12 (1998) 111-177; [4] M. Bauer, O. Golinelli, Journal of Integer Sequences, Vol 3, (2000).

cond-mat.stat-mech↗

arXiv2002

Data compression and learning in time sequences analysis

Motivated by the problem of the definition of a distance between two sequences of characters, we investigate the so-called learning process of typical sequential data compression schemes. We focus on the problem of how a compression algorithm optimizes its features at the interface between two different sequences $A$ and $B$ while zipping the sequence $A+B$ obtained by simply appending $B$ after $A$. We show the existence of a universal scaling function (the so-called learning function) which rules the way in which the compression algorithm learns a sequence $B$ after having compressed a sequence $A$. In particular it turns out that it exists a crossover length for the sequence $B$, which depends on the relative entropy between $A$ and $B$, below which the compression algorithm does not learn the sequence $B$ (measuring in this way the relative entropy between $A$ and $B$) and above which it starts learning $B$, i.e. optimizing the compression using the specific features of $B$. We check the scaling function on three main classes of systems: Bernoulli schemes, Markovian sequences and the symbolic dynamic generated by a non trivial chaotic system (the Lozi map). As a last application of the method we present the results of a recognition experiment, namely recognize which dynamical systems produced a given time sequence. We finally point out the potentiality of these results for segmentation purposes, i.e. the identification of homogeneous sub-sequences in heterogeneous sequences (with applications in various fields from genetic to time-series analysis).

cond-mat.stat-mech↗

arXiv2002

On J. Goodman's comment to "Language Trees and Zipping"

Motivated by the recent submission to cond-mat archives by J. Goodman (cond-mat/0202383) whose results apparently discredit the approach we have proposed in a recent paper (Phys. Rev. Lett., 88, 048702 (2002), cond-mat/0108530), we report the results of the same experiment performed by Goodman using three different data compression schemes. As a matter of fact the three zippers display the same efficiency Goodman obtained using Naive Bayesian Methods and not, as Goodman claimed, an efficiency three times smaller. We point out the question of the extreme generality of approaches based on data compression techniques and we list a large range of potential applications, including those of interest for the physics community.

cond-mat.stat-mech↗

arXiv1999

Entropy for relaxation dynamics in granular media

We investigate the role of entropic concepts for the relaxation dynamics in granular systems. In these systems the existence of a geometrical frustration induces a drastic modification of the allowed phase space, which in its turn induces a dynamic behavior characterized by hierarchical relaxation phenomena with several time scales associated. In particular we show how, in the framework of a mean-field model introduced for the compaction phenomenon, there exists a free-energy-like functional which decreases along the trajectories of the dynamics and which allows to account for the asymptotic behavior: e.g. density profile, segregation phenomena. Also we are able to perform the continuous limit of the above mentioned model which turns out to be a diffusive limit. In this framework one can single out two separate physical ingredients: the free-energy-like functional that defines the phase-space and the asymptotic states and a diffusion coefficient $D(ρ)$ accounting for the velocity of approach to the asymptotic stationary states.

cond-mat.stat-mech↗

arXiv1997

A ``Tetris''-like model for the Compaction of Dry Granular Media

We propose a two-dimensional geometrical model, based on the concept of geometrical frustration, conceived for the study of compaction in granular media. The dynamics exhibits an interesting inverse logarithmic law that is well known from real experiments. Moreover we present a simple dynamical model of $N$ planes exchanging particles with excluded volume problems, which allows to clarify the origin of the logarithmic relaxations and the stationary density distribution. A simple mapping allows us to cast this Tetris-like model in the form of an Ising-like spin systems with vacancies.

cond-mat↗