260 citations · 3k across the 65 of their papers we have counts for
7 papers · 1 filter
Similarity of symbol frequency distributions with heavy tails
Martin Gerlach, Francesc Font-Clos, Eduardo G. Altmann
Quantifying the similarity between symbolic sequences is a traditional problem in Information Theory which requires comparing the frequencies of symbols in different sequences. In…
Temporal-varying failures of nodes in networks
Georgie Knight, Giampaolo Cristadoro, Eduardo G. Altmann
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 w…
Sampling motif-constrained ensembles of networks
Rico Fischer, Jorge C. Leitao, Tiago P. Peixoto +1
The statistical significance of network properties is conditioned on null models which satisfy spec- ified properties but that are otherwise random. Exponential random graph models…
Characterizing Weak Chaos using Time Series of Lyapunov Exponents
R. M. da Silva, C. Manchein, M. W. Beims +1
We investigate chaos in mixed-phase-space Hamiltonian systems using time series of the finite- time Lyapunov exponents. The methodology we propose uses the number of Lyapunov expon…
Statistical laws in linguistics
Eduardo G. Altmann, Martin Gerlach
Zipf's law is just one out of many universal laws proposed to describe statistical regularities in language. Here we review and critically discuss how these laws can be statistical…
Chaotic Explosions
Eduardo G. Altmann, Jefferson S. E. Portela, Tamás Tél
We investigate chaotic dynamical systems for which the intensity of trajectories might grow unlimited in time. We show that (i) the intensity grows exponentially in time and is dis…