#### Filter Results:

#### Publication Year

2001

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

We present a detailed description of an algorithm tailored to detect external plagiarism in PAN-09 competition. The algorithm is divided into three steps: a first reduction of the size of the problem by a selection of ten suspicious plagiarists using a n-gram distance on properly recoded texts. A search for matches after T9-like recoding. A " joining… (More)

- Eduardo G. Altmann, Giampaolo Cristadoro, Mirko Degli Esposti
- Proceedings of the National Academy of Sciences…
- 2012

The complexity of human interactions with social and natural phenomena is mirrored in the way we describe our experiences through natural language. In order to retain and convey such a high dimensional information, the statistical properties of our linguistic output has to be highly correlated in time. An example are the robust observations, still largely… (More)

We establish a deterministic technique to investigate transport moments of arbitrary order. The theory is applied to the analysis of different kinds of intermittent one-dimensional maps and the Lorentz gas with infinite horizon: the typical appearance of phase transitions in the spectrum of transport exponents is explained. Periodic orbit theory of strongly… (More)

- Giulia Paci, Giampaolo Cristadoro, +4 authors Daniel Remondini
- Philosophical transactions. Series A…
- 2016

We perform a statistical study of the distances between successive occurrences of a given dinucleotide in the DNA sequence for a number of organisms of different complexity. Our analysis highlights peculiar features of the CG dinucleotide distribution in mammalian DNA, pointing towards a connection with the role of such dinucleotide in DNA methylation.… (More)

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 [7],[2]. In this paper we prove that the cross entropy and the Kullback-Leibler divergence can be obtained in a similar way.

- Giampaolo Cristadoro, Marco Lenci, Marcello Seri
- Chaos
- 2010

We consider the billiard dynamics in a striplike set that is tessellated by countably many translated copies of the same polygon. A random configuration of semidispersing scatterers is placed in each copy. The ensemble of dynamical systems thus defined, one for each global choice of scatterers, is called quenched random Lorentz tube. We prove that under… (More)

- G Cristadoro, D L Shepelyansky
- Physical review. E, Statistical, nonlinear, and…
- 2005

An ensemble of particles in thermal equilibrium at temperature T, modeled by Nosè-Hoover dynamics, moves on a triangular lattice of oriented semidisk elastic scatterers. Despite the scatterer asymmetry, a directed transport is clearly ruled out by the second law of thermodynamics. Introduction of a polarized zero mean monochromatic field creates a directed… (More)

Dynamical zeta functions provide a powerful method to analyze low dimensional dynamical systems when the underlying symbolic dynamics is under control. On the other hand even simple one dimensional maps can show an intricate structure of the grammar rules that may lead to a non smooth dependence of global observable on parameters changes. A paradigmatic… (More)

- Giacomo Cacciapaglia, Marco Cirelli, Giampaolo Cristadoro
- 2001

In an extension of the Standard Model with one extra dimension and N=1 super-symmetry compactified on R 1 /Z 2 × Z ′ 2 , we compute the Higgs boson decay width into two gluons, relevant to Higgs production in hadronic collisions. At one loop, the decay width is significantly suppressed with respect to the SM. For a compactification radius R = (370 ± 70 GeV)… (More)

- Georgie Knight, Giampaolo Cristadoro, Eduardo G. Altmann
- Physical review. E, Statistical, nonlinear, and…
- 2015

We consider networks in which random walkers are removed because of the failure of specific nodes. We interpret the rate of loss as a measure of the importance of nodes, a notion we denote as failure centrality. We show that the degree of the node is not sufficient to determine this measure and that, in a first approximation, the shortest loops through the… (More)