adjacent possible air traffic complexity complex_networks complex_systems creativity cuskley data_compression dynamical_systems evolutionary_dynamics gravino information_theory innovation_dynamics kreyon language_dynamics language_games local optimization loreto modeling monechi opinion_dynamics phylogeny relevant_literature servedio social_dynamics statistical_physics techno_social_systems transportation networks tria zippers
2006 |
Taloni, Alessandro; Cagliori, Emanuele; Loreto, Vittorio; Pietronero, Luciano Conformal approach to cylindrical DLA (Journal Article) JOURNAL OF STATISTICAL MECHANICS: THEORY AND EXPERIMENT, Art. n. P09004 , 2006. (Abstract | Links | BibTeX | Tags: loreto, statistical_physics) @article{b, title = {Conformal approach to cylindrical DLA}, author = {Alessandro Taloni and Emanuele Cagliori and Vittorio Loreto and Luciano Pietronero}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-37649026579&partnerID=65&md5=18e07a1e17966902ff4a2c6e9b9dadfc, http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=000241413300004&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=0c7ff228ccbaaa74236f48834a34396a}, year = {2006}, date = {2006-01-01}, journal = {JOURNAL OF STATISTICAL MECHANICS: THEORY AND EXPERIMENT}, volume = {Art. n. P09004}, abstract = {We extend the conformal mapping approach elaborated for the radial diffusion limited aggregation model (DLA) to cylindrical geometry. We introduce in particular a complex function which allows a cylindrical cluster to be grown using as an intermediate step a radial aggregate. The aggregate grown exhibits the same self-affine features as the original cylindrical DLA. The specific choice of the transformation allows us to study the relationship between the radial and the cylindrical geometry. In particular the cylindrical aggregate can be seen as a radial aggregate with particles of size increasing with the radius. On the other hand, the radial aggregate can be seen as a cylindrical aggregate with particles of size decreasing with the height. This framework, which shifts the point of view from the geometry to the size of the particles, can open the way to more quantitative studies on the relationship between radial and cylindrical DLA.}, keywords = {loreto, statistical_physics}, pubstate = {published}, tppubtype = {article} } We extend the conformal mapping approach elaborated for the radial diffusion limited aggregation model (DLA) to cylindrical geometry. We introduce in particular a complex function which allows a cylindrical cluster to be grown using as an intermediate step a radial aggregate. The aggregate grown exhibits the same self-affine features as the original cylindrical DLA. The specific choice of the transformation allows us to study the relationship between the radial and the cylindrical geometry. In particular the cylindrical aggregate can be seen as a radial aggregate with particles of size increasing with the radius. On the other hand, the radial aggregate can be seen as a cylindrical aggregate with particles of size decreasing with the height. This framework, which shifts the point of view from the geometry to the size of the particles, can open the way to more quantitative studies on the relationship between radial and cylindrical DLA. |
Baronchelli, Andrea; Dall'Asta, Luca; Barrat, Alain; Loreto, Vittorio Nonequilibrium dynamics of language games on complex networks (Journal Article) PHYSICAL REVIEW E, STATISTICAL, NONLINEAR, AND SOFT MATTER PHYSICS, 74 , pp. 036105:1–036105:13, 2006. (Links | BibTeX | Tags: language_dynamics, loreto) @article{b, title = {Nonequilibrium dynamics of language games on complex networks}, author = {Andrea Baronchelli and Luca Dall'Asta and Alain Barrat and Vittorio Loreto}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-33748696781&partnerID=65&md5=cc64be303c18646cd76a8fe460a36220 http://samarcanda.phys.uniroma1.it/vittorioloreto/PAPERS/2006/Dall%27Asta_PhysRevE_2006.pdf}, year = {2006}, date = {2006-01-01}, journal = {PHYSICAL REVIEW E, STATISTICAL, NONLINEAR, AND SOFT MATTER PHYSICS}, volume = {74}, pages = {036105:1--036105:13}, publisher = {pubblicata da: AMERICAN PHYSICAL SOC, ONE PHYSICS ELLIPSE, COLLEGE PK, USA, MD, 20740-3844}, keywords = {language_dynamics, loreto}, pubstate = {published}, tppubtype = {article} } |
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} } |
Baronchelli, Aandrea; Loreto, Vittorio Ring structures and mean field passage time in networks (Journal Article) PHYSICAL REVIEW E, STATISTICAL, NONLINEAR, AND SOFT MATTER PHYSICS, 73 , pp. 026103–026109, 2006. (Links | BibTeX | Tags: language_dynamics, loreto) @article{b, title = {Ring structures and mean field passage time in networks}, author = {Aandrea Baronchelli and Vittorio Loreto}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-33344457811&partnerID=65&md5=119cf3f6f09d56d4ce82928d108caf1f, http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=000235667700017&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=0c7ff228ccbaaa74236f48834a34396a}, year = {2006}, date = {2006-01-01}, journal = {PHYSICAL REVIEW E, STATISTICAL, NONLINEAR, AND SOFT MATTER PHYSICS}, volume = {73}, pages = {026103--026109}, publisher = {AMERICAN PHYSICAL SOC, ONE PHYSICS ELLIPSE, COLLEGE PK, USA, MD, 20740-3844}, keywords = {language_dynamics, loreto}, pubstate = {published}, tppubtype = {article} } |
Baronchelli, Andrea; Felici, Maddalena; Loreto, Vittorio; Caglioti, Emanuele; Steels, Luc Sharp transition towards shared vocabularies in multi-agent systems (Journal Article) JOURNAL OF STATISTICAL MECHANICS: THEORY AND EXPERIMENT, P06014 , pp. P06014–P06019, 2006. (Abstract | Links | BibTeX | Tags: language_dynamics, loreto) @article{b, title = {Sharp transition towards shared vocabularies in multi-agent systems}, author = {Andrea Baronchelli and Maddalena Felici and Vittorio Loreto and Emanuele Caglioti and Luc Steels}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-42749102031&partnerID=65&md5=0d19c9fc9b115fd59f34ab6aa076a560 http://samarcanda.phys.uniroma1.it/vittorioloreto/PAPERS/2006/Baronchelli_JourStatMech_2006.pdf}, year = {2006}, date = {2006-01-01}, journal = {JOURNAL OF STATISTICAL MECHANICS: THEORY AND EXPERIMENT}, volume = {P06014}, pages = {P06014--P06019}, abstract = {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 analyse 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 through 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 timescale of collective behaviours, 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.}, keywords = {language_dynamics, loreto}, pubstate = {published}, tppubtype = {article} } 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 analyse 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 through 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 timescale of collective behaviours, 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. |
Baronchelli, Andrea; Dall'Asta, Luca; Barrat, Alain; Loreto, Vittorio Topology induced coarsening in language games (Journal Article) PHYSICAL REVIEW E, STATISTICAL, NONLINEAR, AND SOFT MATTER PHYSICS, 73 , pp. 015102–015105, 2006. (Links | BibTeX | Tags: language_dynamics, loreto) @article{b, title = {Topology induced coarsening in language games}, author = {Andrea Baronchelli and Luca Dall'Asta and Alain Barrat and Vittorio Loreto}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-32844475670&partnerID=65&md5=1c3b97e4d519590a2e5dd017a0da5ea9 http://samarcanda.phys.uniroma1.it/vittorioloreto/PAPERS/2006/Baronchelli_PhysRevE_2006.pdf}, year = {2006}, date = {2006-01-01}, journal = {PHYSICAL REVIEW E, STATISTICAL, NONLINEAR, AND SOFT MATTER PHYSICS}, volume = {73}, pages = {015102--015105}, publisher = {AMERICAN PHYSICAL SOC, ONE PHYSICS ELLIPSE, COLLEGE PK, USA, MD, 20740-3844}, keywords = {language_dynamics, loreto}, pubstate = {published}, tppubtype = {article} } |
Canettieri, Paolo; Loreto, Vittorio; Rovetta, Marta; Santini, Giovanna Philology and information theory: towards an integrated approach (Incollection) Philippe Baret Andrea Bozzi, Caroline Mace'(Eds.) (Ed.): Textual criticism and genetics, 2006. (BibTeX | Tags: language_dynamics, loreto) @incollection{b, title = {Philology and information theory: towards an integrated approach}, author = {Paolo Canettieri and Vittorio Loreto and Marta Rovetta and Giovanna Santini}, editor = {Philippe Baret, Andrea Bozzi, Caroline Mace'(Eds.)}, year = {2006}, date = {2006-01-01}, booktitle = {Textual criticism and genetics}, keywords = {language_dynamics, loreto}, pubstate = {published}, tppubtype = {incollection} } |
Baronchelli, Andrea; Dall'Asta, Luca; Barrat, Alain; Loreto, Vittorio Strategies for fast convergence in semiotic dynamics (Inproceeding) et al., Rocha (Ed.): Proceeding of the Artificial Life X Conference, pp. 480–485, 2006. (BibTeX | Tags: language_dynamics, loreto) @inproceedings{Baronchelli2006, title = {Strategies for fast convergence in semiotic dynamics}, author = {Andrea Baronchelli and Luca Dall'Asta and Alain Barrat and Vittorio Loreto}, editor = {L. M. Rocha et al.}, year = {2006}, date = {2006-01-01}, booktitle = {Proceeding of the Artificial Life X Conference}, pages = {480--485}, keywords = {language_dynamics, loreto}, pubstate = {published}, tppubtype = {inproceedings} } |
Baronchelli, Andrea; Dall'Asta, Luca; Barrat, Alain; Loreto, Vittorio Bootstrapping communication in language games (Inproceeding) A. Cangelosi, Smith; Smith, (Ed.): Evolution of Language: Proceedings of the 6th International Conference (EVOLANG6), World Scientific Publishing Company, 2006. (BibTeX | Tags: language_dynamics, loreto) @inproceedings{Baronchelli2006bis, title = {Bootstrapping communication in language games}, author = {Andrea Baronchelli and Luca Dall'Asta and Alain Barrat and Vittorio Loreto}, editor = {A. Cangelosi, A. D. M. Smith and K. Smith}, year = {2006}, date = {2006-01-01}, booktitle = {Evolution of Language: Proceedings of the 6th International Conference (EVOLANG6)}, publisher = {World Scientific Publishing Company}, keywords = {language_dynamics, loreto}, pubstate = {published}, tppubtype = {inproceedings} } |
Baronchelli, Andrea; Caglioti, Emanuele; Loreto, Vittorio; Steels, Luc Complex systems approach to language games (Inproceeding) Proceedings of the Second European Conference on Complex Systems ECCS'0, 2006. (BibTeX | Tags: language_dynamics, loreto) @inproceedings{Baronchelli2006ter, title = {Complex systems approach to language games}, author = {Andrea Baronchelli and Emanuele Caglioti and Vittorio Loreto and Luc Steels}, year = {2006}, date = {2006-01-01}, booktitle = {Proceedings of the Second European Conference on Complex Systems ECCS'0}, keywords = {language_dynamics, loreto}, pubstate = {published}, tppubtype = {inproceedings} } |
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} } |
Castellano, Claudio; Loreto, Vittorio; Barrat, Alain; Cecconi, Federico; Parisi, Domenico Comparison of voter and Glauber ordering dynamics on networks (Journal Article) PHYSICAL REVIEW E, STATISTICAL, NONLINEAR, AND SOFT MATTER PHYSICS, 71 , pp. 066107–066114, 2005. (Links | BibTeX | Tags: loreto, opinion_dynamics, social_dynamics, statistical_physics) @article{b, title = {Comparison of voter and Glauber ordering dynamics on networks}, author = {Claudio Castellano and Vittorio Loreto and Alain Barrat and Federico Cecconi and Domenico Parisi}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-27944464161&partnerID=65&md5=e33dbf7e41cab953b8225aab3fc4c019, http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=000230275000023&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=0c7ff228ccbaaa74236f48834a34396a}, year = {2005}, date = {2005-01-01}, journal = {PHYSICAL REVIEW E, STATISTICAL, NONLINEAR, AND SOFT MATTER PHYSICS}, volume = {71}, pages = {066107--066114}, publisher = {AMERICAN PHYSICAL SOC, ONE PHYSICS ELLIPSE, COLLEGE PK, USA, MD, 20740-3844}, keywords = {loreto, opinion_dynamics, social_dynamics, statistical_physics}, 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} } |
Baronchelli, Andrea; Felici, Maddalena; Caglioti, Emanuele; Loreto, Vittorio; Steels, Luc Self-organizing communication in language games (Inproceeding) Proceedings of the First European Conference on Complex Systems ECCS'05, 2005. (BibTeX | Tags: language_dynamics, loreto) @inproceedings{Baronchelli2005, title = {Self-organizing communication in language games}, author = {Andrea Baronchelli and Maddalena Felici and Emanuele Caglioti and Vittorio Loreto and Luc Steels}, year = {2005}, date = {2005-01-01}, booktitle = {Proceedings of the First European Conference on Complex Systems ECCS'05}, keywords = {language_dynamics, loreto}, pubstate = {published}, tppubtype = {inproceedings} } |
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). |
Radicchi, Filippo; Castellano, Claudio; Cecconi, Federico; Loreto, Vittorio; Parisi, Domenico Defining and identifying communities in networks (Journal Article) PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 101 , pp. 2658–2663, 2004. (Abstract | Links | BibTeX | Tags: complex_networks, loreto, social_dynamics) @article{b, title = {Defining and identifying communities in networks}, author = {Filippo Radicchi and Claudio Castellano and Federico Cecconi and Vittorio Loreto and Domenico Parisi}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-1542357701&partnerID=65&md5=38349a61be5998bacd3283c61c6abce6, http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=000220065300004&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=0c7ff228ccbaaa74236f48834a34396a}, year = {2004}, date = {2004-01-01}, journal = {PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA}, volume = {101}, pages = {2658--2663}, publisher = {National Academy of Sciences:2101 Constitution Avenue Northwest:Washington, DC 20418:(877)314-2253, (615)377-3322, EMAIL: subspnas@nas.edu, INTERNET: http://www.pnas.org, Fax: (615)377-0525}, abstract = {The investigation of community structures in networks is an important issue in many domains and disciplines. This problem is relevant for social tasks (objective analysis of relationships on the web), biological inquiries (functional studies in metabolic and protein networks), or technological problems (optimization of large infrastructures). Several types of algorithms exist for revealing the community structure in networks, but a general and quantitative definition of community is not implemented in the algorithms, leading to an intrinsic difficulty in the interpretation of the results without any additional nontopological information. In this article we deal with this problem by showing how quantitative definitions of community are implemented in practice in the existing algorithms. In this way the algorithms for the identification of the community structure become fully self-contained. Furthermore, we propose a local algorithm to detect communities which outperforms the existing algorithms with respect to computational cost, keeping the same level of reliability. The algorithm is tested on artificial and real-world graphs. In particular, we show how the algorithm applies to a network of scientific collaborations, which, for its size, cannot be attacked with the usual methods. This type of local algorithm could open the way to applications to large-scale technological and biological systems.}, keywords = {complex_networks, loreto, social_dynamics}, pubstate = {published}, tppubtype = {article} } The investigation of community structures in networks is an important issue in many domains and disciplines. This problem is relevant for social tasks (objective analysis of relationships on the web), biological inquiries (functional studies in metabolic and protein networks), or technological problems (optimization of large infrastructures). Several types of algorithms exist for revealing the community structure in networks, but a general and quantitative definition of community is not implemented in the algorithms, leading to an intrinsic difficulty in the interpretation of the results without any additional nontopological information. In this article we deal with this problem by showing how quantitative definitions of community are implemented in practice in the existing algorithms. In this way the algorithms for the identification of the community structure become fully self-contained. Furthermore, we propose a local algorithm to detect communities which outperforms the existing algorithms with respect to computational cost, keeping the same level of reliability. The algorithm is tested on artificial and real-world graphs. In particular, we show how the algorithm applies to a network of scientific collaborations, which, for its size, cannot be attacked with the usual methods. This type of local algorithm could open the way to applications to large-scale technological and biological systems. |
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} } |
Castellano, Claudio; Federico cecconi,; Loreto, Vittorio; Parisi, Domenico; Radicchi, Filippo Self-contained algorithms to detect communities in networks (Journal Article) THE EUROPEAN PHYSICAL JOURNAL. B, CONDENSED MATTER PHYSICS, 38 , pp. 311–319, 2004. (Links | BibTeX | Tags: complex_networks, loreto, social_dynamics) @article{b, title = {Self-contained algorithms to detect communities in networks}, author = {Claudio Castellano and Federico cecconi, and Vittorio Loreto and Domenico Parisi and Filippo Radicchi}, url = {http://www.scopus.com/inward/record.url?eid=2-s2.0-2942534881&partnerID=65&md5=95c1d25779e19f22e6eacd483a47ec2b, http://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&KeyUT=000221447300024&DestLinkType=FullRecord&DestApp=ALL_WOS&UsrCustomerID=0c7ff228ccbaaa74236f48834a34396a}, year = {2004}, date = {2004-01-01}, journal = {THE EUROPEAN PHYSICAL JOURNAL. B, CONDENSED MATTER PHYSICS}, volume = {38}, pages = {311--319}, publisher = {EDP Sciences, Springer Verlag Germany}, keywords = {complex_networks, loreto, social_dynamics}, 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. |