1 citations · 1 across the 1 of their papers we have counts for
6 papers
The first digit frequencies of primes and Riemann zeta zeros tend to uniformity following a size-dependent generalized Benford's law
Bartolo Luque, Lucas Lacasa
Prime numbers seem to distribute among the natural numbers with no other law than that of chance, however its global distribution presents a quite remarkable smoothness. Such inter…
From time series to complex networks: the visibility graph
Lucas Lacasa, Bartolo Luque, Fernando Ballesteros +2
In this work we present a simple and fast computational method, the visibility algorithm, that converts a time series into a graph. The constructed graph inherits several propertie…
Number theoretic example of scale-free topology inducing self-organized criticality
Bartolo Luque, Octavio Miramontes, Lucas Lacasa
In this work we present a general mechanism by which simple dynamics running on networks become self-organized critical for scale free topologies. We illustrate this mechanism with…
Phase transition and computational complexity in a stochastic prime number generator
Lucas Lacasa, Bartolo Luque, Octavio Miramontes
We introduce a prime number generator in the form of a stochastic algorithm. The character of such algorithm gives rise to a continuous phase transition which distinguishes a phase…
Phase transition in a stochastic prime number generator
Bartolo Luque, Lucas Lacasa, Octavio Miramontes
We introduce a stochastic algorithm that acts as a prime number generator. The dynamics of such algorithm gives rise to a continuous phase transition which separates a phase where…
Bonabeau hierarchy models revisited
Lucas Lacasa, Bartolo Luque
What basic processes generate hierarchy in a collective? The Bonabeau model provides us a simple mechanism based on randomness which develops self-organization through both winner/…