## 2006 |

Canettieri, Paolo; Loreto, Vittorio; Rovetta, Marta; Santini, Giovanna Philology and Information Theory: towards an integrated approach (Journal Article) LINGUISTICA COMPUTAZIONALE, 6 , pp. 104–126, 2006. (BibTeX | Tags: complexity, information_theory, loreto, phylology) @article{b, title = {Philology and Information Theory: towards an integrated approach}, author = {Paolo Canettieri and Vittorio Loreto and Marta Rovetta and Giovanna Santini}, year = {2006}, date = {2006-01-01}, journal = {LINGUISTICA COMPUTAZIONALE}, volume = {6}, pages = {104--126}, keywords = {complexity, information_theory, loreto, phylology}, pubstate = {published}, tppubtype = {article} } |

## 2005 |

Baronchelli, Andrea; Caglioti, Emanuele; Loreto, Vittorio Artificial sequences and complexity measures (Journal Article) JOURNAL OF STATISTICAL MECHANICS: THEORY AND EXPERIMENT, P04002 , pp. P04002:1–P04002:10, 2005. (Links | BibTeX | Tags: complexity, information_theory, loreto, zippers) @article{b, title = {Artificial sequences and complexity measures}, author = {Andrea Baronchelli and Emanuele Caglioti and Vittorio Loreto}, url = {http://samarcanda.phys.uniroma1.it/vittorioloreto/PAPERS/2005/Baronchelli_JourStatMech_2005.pdf}, year = {2005}, date = {2005-01-01}, journal = {JOURNAL OF STATISTICAL MECHANICS: THEORY AND EXPERIMENT}, volume = {P04002}, pages = {P04002:1--P04002:10}, keywords = {complexity, information_theory, loreto, zippers}, pubstate = {published}, tppubtype = {article} } |

Baronchelli, Andrea; Caglioti, Emanuele; Loreto, Vittorio Measuring complexity with zippers (Journal Article) EUROPEAN JOURNAL OF PHYSICS, 26 , pp. S69–S77, 2005. (Links | BibTeX | Tags: complexity, information_theory, loreto, zippers) @article{b, title = {Measuring complexity with zippers}, author = {Andrea Baronchelli and Emanuele Caglioti and Vittorio Loreto}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-23844518349&partnerID=65&md5=c4ee268ca9d645082e80a458ee363027 http://samarcanda.phys.uniroma1.it/vittorioloreto/PAPERS/2005/Baronchelli_EurJourPhys_2005.pdf}, year = {2005}, date = {2005-01-01}, journal = {EUROPEAN JOURNAL OF PHYSICS}, volume = {26}, pages = {S69--S77}, keywords = {complexity, information_theory, loreto, zippers}, pubstate = {published}, tppubtype = {article} } |

## 2004 |

Alderduccio, Daniela; Bordoni, Luciana; Loreto, Vittorio A data compression approach to monolingual GIRT task: an agnostic point of view (Journal Article) LECTURE NOTES IN COMPUTER SCIENCE, 3237 , pp. 391–400, 2004. (Abstract | Links | BibTeX | Tags: complexity, data_compression, information_theory, loreto, zippers) @article{b, title = {A data compression approach to monolingual GIRT task: an agnostic point of view}, author = {Daniela Alderduccio and Luciana Bordoni and Vittorio Loreto}, url = {http://www.springerlink.com/content/rclr22d4636dgpb0/}, year = {2004}, date = {2004-01-01}, journal = {LECTURE NOTES IN COMPUTER SCIENCE}, volume = {3237}, pages = {391--400}, publisher = {C. Peters (Ed.) (Springer-Verlag)}, abstract = {In this paper we apply a data-compression IR method in the GIRT social science database, focusing on the monolingual task in German and English. For this purpose we use a recently proposed general scheme for context recognition and context classification of strings of characters (in particular texts) or other coded information. The key point of the method is the computation of a suitable measure of remoteness (or similarity) between two strings of characters. This measure of remoteness reflects the distance between the structures present in the two strings, i.e. between the two different distributions of elements of the compared sequences. The hypothesis is that the information-theory oriented measure of remoteness between two sequences could reflect their semantic distance. It is worth stressing the generality and versatility of our information-theoretic method which applies to any kind of corpora of character strings, whatever the type of coding used (i.e. language).}, keywords = {complexity, data_compression, information_theory, loreto, zippers}, pubstate = {published}, tppubtype = {article} } In this paper we apply a data-compression IR method in the GIRT social science database, focusing on the monolingual task in German and English. For this purpose we use a recently proposed general scheme for context recognition and context classification of strings of characters (in particular texts) or other coded information. The key point of the method is the computation of a suitable measure of remoteness (or similarity) between two strings of characters. This measure of remoteness reflects the distance between the structures present in the two strings, i.e. between the two different distributions of elements of the compared sequences. The hypothesis is that the information-theory oriented measure of remoteness between two sequences could reflect their semantic distance. It is worth stressing the generality and versatility of our information-theoretic method which applies to any kind of corpora of character strings, whatever the type of coding used (i.e. language). |

Baronchelli, Andrea; Caglioti, Emanuele; Loreto, Vittorio; Pizzi, Elisabetta Dictionary based methods for information extraction (Journal Article) PHYSICA A, 342 , pp. 294–300, 2004. (Links | BibTeX | Tags: complexity, data_compression, information_theory, loreto, zippers) @article{b, title = {Dictionary based methods for information extraction}, author = {Andrea Baronchelli and Emanuele Caglioti and Vittorio Loreto and Elisabetta Pizzi}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-4544274009&partnerID=65&md5=c82c34dcc720c2c1feb9b2ead36b2b37 http://samarcanda.phys.uniroma1.it/vittorioloreto/PAPERS/2004/Baronchelli_PhysicaA_2004.pdf}, year = {2004}, date = {2004-01-01}, journal = {PHYSICA A}, volume = {342}, pages = {294--300}, publisher = {Elsevier, Amsterdam}, keywords = {complexity, data_compression, information_theory, loreto, zippers}, pubstate = {published}, tppubtype = {article} } |

## 2003 |

Puglisi, Andrea; Benedetto, Dario; Caglioti, Emanuele; Loreto, Vittorio; Vulpiani, Angelo Data Compression and Learning in time sequences analysis (Journal Article) PHYSICA D-NONLINEAR PHENOMENA, 180/1-2 , pp. 92–107, 2003. (Links | BibTeX | Tags: complexity, data_compression, information_theory, loreto, zippers) @article{b, title = {Data Compression and Learning in time sequences analysis}, author = {Andrea Puglisi and Dario Benedetto and Emanuele Caglioti and Vittorio Loreto and Angelo Vulpiani}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-0038284954&partnerID=65&md5=52d923821bee5f92d9c470f8d4aee0fe http://samarcanda.phys.uniroma1.it/vittorioloreto/PAPERS/2003/Puglisi_PhysicaD_2003.pdf}, year = {2003}, date = {2003-01-01}, journal = {PHYSICA D-NONLINEAR PHENOMENA}, volume = {180/1-2}, pages = {92--107}, keywords = {complexity, data_compression, information_theory, loreto, zippers}, pubstate = {published}, tppubtype = {article} } |

Benedetto, Dario; Caglioti, Emanuele; Loreto, Vittorio Zipping out relevant information (Journal Article) COMPUTING IN SCIENCE & ENGINEERING, 5 (1) , pp. 80–85, 2003. (Links | BibTeX | Tags: complexity, data_compression, information_theory, loreto, zippers) @article{b, title = {Zipping out relevant information}, author = {Dario Benedetto and Emanuele Caglioti and Vittorio Loreto}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-0037235373&partnerID=65&md5=953371f02864768a9eb99b9b5cea5987, http://samarcanda.phys.uniroma1.it/vittorioloreto/PAPERS/2003/Benedetto_IEEE_CSE_2003.pdf}, year = {2003}, date = {2003-01-01}, journal = {COMPUTING IN SCIENCE & ENGINEERING}, volume = {5 (1)}, pages = {80--85}, keywords = {complexity, data_compression, information_theory, loreto, zippers}, pubstate = {published}, tppubtype = {article} } |

Falcon, Massimo; Loreto, Vittorio; Vulpiani, Angelo Entropie, Chaos et Complexite (Incollection) A.VULPIANI, R.LIVI ET (Ed.): L'heritage de Kolmogorov en physique, pp. 96–119, Belin, PARIS, 2003. (BibTeX | Tags: complexity, loreto, statistical_physics) @incollection{b, title = {Entropie, Chaos et Complexite}, author = {Massimo Falcon and Vittorio Loreto and Angelo Vulpiani}, editor = {R.LIVI ET A.VULPIANI}, year = {2003}, date = {2003-01-01}, booktitle = {L'heritage de Kolmogorov en physique}, pages = {96--119}, publisher = {Belin}, address = {PARIS}, keywords = {complexity, loreto, statistical_physics}, pubstate = {published}, tppubtype = {incollection} } |

Falcon, Massimo; Loreto, Vittorio; Vulpiani, Angelo Kolmogorov's Legacy about Entropy, Chaos and Complexity (Incollection) VULPIANI, LIVI; (Ed.): The Kolmogorov Legacy in Physics, LPN 636 , pp. 85–108, Springer-Verlag, BERLIN, 2003. (BibTeX | Tags: complexity, loreto, statistical_physics) @incollection{b, title = {Kolmogorov's Legacy about Entropy, Chaos and Complexity}, author = {Massimo Falcon and Vittorio Loreto and Angelo Vulpiani}, editor = {R. LIVI; A. VULPIANI}, year = {2003}, date = {2003-01-01}, booktitle = {The Kolmogorov Legacy in Physics}, volume = {LPN 636}, pages = {85--108}, publisher = {Springer-Verlag}, address = {BERLIN}, keywords = {complexity, loreto, statistical_physics}, pubstate = {published}, tppubtype = {incollection} } |

Bendetto, Dario; Caglioti, Emanuele; Loreto, Vittorio Reply to the comment on (Journal Article) PHYSICAL REVIEW LETTERS, 90 , pp. 089803–089804, 2003. (Links | BibTeX | Tags: complexity, information_theory, loreto, zippers) @article{b, title = {Reply to the comment on }, author = {Dario Bendetto and Emanuele Caglioti and Vittorio Loreto}, url = {http://samarcanda.phys.uniroma1.it/vittorioloreto/PAPERS/2003/Benedetto_PhysRevLett_2003.pdf }, year = {2003}, date = {2003-01-01}, journal = {PHYSICAL REVIEW LETTERS}, volume = {90}, pages = {089803--089804}, publisher = {American Institute of Physics:2 Huntington Quadrangle, Suite 1NO1:Melville, NY 11747:(800)344-6902, (631)576-2287, EMAIL: subs@aip.org, INTERNET: http://www.aip.org, Fax: (516)349-9704}, keywords = {complexity, information_theory, loreto, zippers}, pubstate = {published}, tppubtype = {article} } |

Puglisi, Andrea; Loreto, Vittorio Data compression approach to sequence analysis (Inproceeding) 7th Granada Lectures, pp. 184–187, 2003. (BibTeX | Tags: complexity, information_theory, loreto, zippers) @inproceedings{b, title = {Data compression approach to sequence analysis}, author = {Andrea Puglisi and Vittorio Loreto}, year = {2003}, date = {2003-01-01}, booktitle = {7th Granada Lectures}, volume = {661}, pages = {184--187}, keywords = {complexity, information_theory, loreto, zippers}, pubstate = {published}, tppubtype = {inproceedings} } |

## 2002 |

Benedetto, Dario; Caglioti, Emanuele; Vittorio Loreto, Language trees and zipping (Journal Article) Physical Review Letters, 88 , pp. 048702, 2002. (Abstract | Links | BibTeX | Tags: complexity, data_compression, information_theory, loreto, zippers) @article{bcl2002, title = {Language trees and zipping}, author = {Dario Benedetto and Emanuele Caglioti and Vittorio Loreto,}, url = {http://samarcanda.phys.uniroma1.it/vittorioloreto/PAPERS/2002/Benedetto_PhysRevLett_2002.pdf}, year = {2002}, date = {2002-01-01}, journal = {Physical Review Letters}, volume = {88}, pages = {048702}, abstract = {In this Letter we present a very general method for extracting information from a generic string of characters, e.g., a text, a DNA sequence, or a time series. Based on data-compression techniques, its key point is the computation of a suitable measure of the remoteness of two bodies of knowledge. We present the implementation of the method to linguistic motivated problems, featuring highly accurate results for language recognition, authorship attribution, and language classification.}, keywords = {complexity, data_compression, information_theory, loreto, zippers}, pubstate = {published}, tppubtype = {article} } In this Letter we present a very general method for extracting information from a generic string of characters, e.g., a text, a DNA sequence, or a time series. Based on data-compression techniques, its key point is the computation of a suitable measure of the remoteness of two bodies of knowledge. We present the implementation of the method to linguistic motivated problems, featuring highly accurate results for language recognition, authorship attribution, and language classification. |

## 1998 |

Loreto, Vittorio; Serva, Maurizio; Vulpiani, Angelo On the concept of complexity of random dynamical systems (Journal Article) INTERNATIONAL JOURNAL OF MODERN PHYSICS B, 12 (3) , pp. 225–243, 1998. (Abstract | Links | BibTeX | Tags: complexity, dynamical_systems, loreto) @article{b, title = {On the concept of complexity of random dynamical systems}, author = {Vittorio Loreto and Maurizio Serva and Angelo Vulpiani}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.50.1146}, year = {1998}, date = {1998-01-01}, journal = {INTERNATIONAL JOURNAL OF MODERN PHYSICS B}, volume = {12 (3)}, pages = {225--243}, publisher = {WORLD SCIENTIFIC, SINGAPORE}, address = {Singapore}, abstract = {We show how to introduce a characterization the "complexity" of random dynamical systems. More precisely we propose a suitable indicator of complexity in terms of the average number of bits per time unit necessary to specify the sequence generated by these systems. This indicator of complexity, which can be extracted from real experimental data, turns out to be very natural in the context of information theory. For dynamical systems with random perturbations, it coincides with the rate K of divergence of nearby trajectories evolving under two different noise realizations. In presence of strong dynamical intermittency, the value of K is very different from the standard Lyapunov exponent chi(sigma) computed through the consideration of two nearby trajectories evolving under the same realization of the random perturbation. However, the former is much more relevant than the latter from a physical point of view as illustrated by some numerical examples of noisy and random maps.}, keywords = {complexity, dynamical_systems, loreto}, pubstate = {published}, tppubtype = {article} } We show how to introduce a characterization the "complexity" of random dynamical systems. More precisely we propose a suitable indicator of complexity in terms of the average number of bits per time unit necessary to specify the sequence generated by these systems. This indicator of complexity, which can be extracted from real experimental data, turns out to be very natural in the context of information theory. For dynamical systems with random perturbations, it coincides with the rate K of divergence of nearby trajectories evolving under two different noise realizations. In presence of strong dynamical intermittency, the value of K is very different from the standard Lyapunov exponent chi(sigma) computed through the consideration of two nearby trajectories evolving under the same realization of the random perturbation. However, the former is much more relevant than the latter from a physical point of view as illustrated by some numerical examples of noisy and random maps. |

## 1996 |

Loreto, Vittorio; Paladin, Giovanni; Pasquini, Michele; Vulpiani, Angelo Characterization of chaos in random maps (Journal Article) PHYSICA. A, 232 , pp. 189–200, 1996. (Abstract | Links | BibTeX | Tags: complexity, dynamical_systems, loreto) @article{b, title = {Characterization of chaos in random maps}, author = {Vittorio Loreto and Giovanni Paladin and Michele Pasquini and Angelo Vulpiani}, url = {http://www.sciencedirect.com/science/article/pii/0378437196000878 http://samarcanda.phys.uniroma1.it/vittorioloreto/PAPERS/1996/Loreto_PhysicaA_1996.pdf}, year = {1996}, date = {1996-01-01}, journal = {PHYSICA. A}, volume = {232}, pages = {189--200}, publisher = {ELSEVIER SCIENCE, AMSTERDAM}, abstract = {We discuss the characterization of chaotic behaviors in random maps both in terms of the Lyapunov exponent and of the spectral properties of the Perron-Frobenius operator. In particular, we study a logistic map where the control parameter is extracted at random at each time step by considering finite-dimensional approximation of the Perron-Frobenius operator.}, keywords = {complexity, dynamical_systems, loreto}, pubstate = {published}, tppubtype = {article} } We discuss the characterization of chaotic behaviors in random maps both in terms of the Lyapunov exponent and of the spectral properties of the Perron-Frobenius operator. In particular, we study a logistic map where the control parameter is extracted at random at each time step by considering finite-dimensional approximation of the Perron-Frobenius operator. |

Loreto, Vittorio; Paladin, Giovanni; Vulpiani, Angelo Concept of complexity in random dynamical systems (Journal Article) PHYSICAL REVIEW E, 53 , pp. 2087–2098, 1996. (Abstract | Links | BibTeX | Tags: complexity, dynamical_systems, loreto, statistical_physics) @article{b, title = {Concept of complexity in random dynamical systems}, author = {Vittorio Loreto and Giovanni Paladin and Angelo Vulpiani}, url = {http://pre.aps.org/abstract/PRE/v53/i3/p2087_1 http://samarcanda.phys.uniroma1.it/vittorioloreto/PAPERS/1996/Loreto_PhysRevE_1996.pdf}, year = {1996}, date = {1996-01-01}, journal = {PHYSICAL REVIEW E}, volume = {53}, pages = {2087--2098}, publisher = {AMERICAN PHYSICAL SOC}, abstract = {We introduce a measure of complexity in terms of the average number of bits per time unit necessary to specify the sequence generated by the system. In dynamical systems with small random perturbations, this indicator coincides with the rate K of divergence of nearby trajectories evolving under two different noise realizations. The meaning of K is discussed in the context of the information theory, and it is shown that it can be determined from real experimental data. In the presence of strong dynamical intermittency, the value of K is very different from the standard Lyapunov exponent lambda(sigma) computed considering two nearby trajectories evolving under the same realization of the randomness. However, the former is much more relevant than the latter from a physical point of view, as illustrated by some numerical computations for noisy maps and sandpile models.}, keywords = {complexity, dynamical_systems, loreto, statistical_physics}, pubstate = {published}, tppubtype = {article} } We introduce a measure of complexity in terms of the average number of bits per time unit necessary to specify the sequence generated by the system. In dynamical systems with small random perturbations, this indicator coincides with the rate K of divergence of nearby trajectories evolving under two different noise realizations. The meaning of K is discussed in the context of the information theory, and it is shown that it can be determined from real experimental data. In the presence of strong dynamical intermittency, the value of K is very different from the standard Lyapunov exponent lambda(sigma) computed considering two nearby trajectories evolving under the same realization of the randomness. However, the former is much more relevant than the latter from a physical point of view, as illustrated by some numerical computations for noisy maps and sandpile models. |

# Publications

## 2006 |

Philology and Information Theory: towards an integrated approach (Journal Article) LINGUISTICA COMPUTAZIONALE, 6 , pp. 104–126, 2006. |

## 2005 |

Artificial sequences and complexity measures (Journal Article) JOURNAL OF STATISTICAL MECHANICS: THEORY AND EXPERIMENT, P04002 , pp. P04002:1–P04002:10, 2005. |

Measuring complexity with zippers (Journal Article) EUROPEAN JOURNAL OF PHYSICS, 26 , pp. S69–S77, 2005. |

## 2004 |

A data compression approach to monolingual GIRT task: an agnostic point of view (Journal Article) LECTURE NOTES IN COMPUTER SCIENCE, 3237 , pp. 391–400, 2004. |

Dictionary based methods for information extraction (Journal Article) PHYSICA A, 342 , pp. 294–300, 2004. |

## 2003 |

Data Compression and Learning in time sequences analysis (Journal Article) PHYSICA D-NONLINEAR PHENOMENA, 180/1-2 , pp. 92–107, 2003. |

Zipping out relevant information (Journal Article) COMPUTING IN SCIENCE & ENGINEERING, 5 (1) , pp. 80–85, 2003. |

Entropie, Chaos et Complexite (Incollection) A.VULPIANI, R.LIVI ET (Ed.): L'heritage de Kolmogorov en physique, pp. 96–119, Belin, PARIS, 2003. |

Kolmogorov's Legacy about Entropy, Chaos and Complexity (Incollection) VULPIANI, LIVI; (Ed.): The Kolmogorov Legacy in Physics, LPN 636 , pp. 85–108, Springer-Verlag, BERLIN, 2003. |

Reply to the comment on (Journal Article) PHYSICAL REVIEW LETTERS, 90 , pp. 089803–089804, 2003. |

Data compression approach to sequence analysis (Inproceeding) 7th Granada Lectures, pp. 184–187, 2003. |

## 2002 |

Language trees and zipping (Journal Article) Physical Review Letters, 88 , pp. 048702, 2002. |

## 1998 |

On the concept of complexity of random dynamical systems (Journal Article) INTERNATIONAL JOURNAL OF MODERN PHYSICS B, 12 (3) , pp. 225–243, 1998. |

## 1996 |

Characterization of chaos in random maps (Journal Article) PHYSICA. A, 232 , pp. 189–200, 1996. |

Concept of complexity in random dynamical systems (Journal Article) PHYSICAL REVIEW E, 53 , pp. 2087–2098, 1996. |