342 citations · 1.8k across the 65 of their papers we have counts for
7 papers · 1 filter
Edge crossings in random linear arrangements
Lluís Alemany-Puig, Ramon Ferrer-i-Cancho
In spatial networks vertices are arranged in some space and edges may cross. When arranging vertices in a 1-dimensional lattice edges may cross when drawn above the vertex sequence…
The distinct flavors of Zipf's law in the rank-size and in the size-distribution representations, and its maximum-likelihood fitting
Alvaro Corral, Isabel Serra, Ramon Ferrer-i-Cancho
In the last years, researchers have realized the difficulties of fitting power-law distributions properly. These difficulties are higher in Zipf's systems, due to the discreteness…
Memory limitations are hidden in grammar
Carlos Gómez-Rodríguez, Morten H. Christiansen, Ramon Ferrer-i-Cancho
The ability to produce and understand an unlimited number of different sentences is a hallmark of human language. Linguists have sought to define the essence of this generative cap…
Anti dependency distance minimization in short sequences. A graph theoretic approach
Ramon Ferrer-i-Cancho, Carlos Gómez-Rodríguez
Dependency distance minimization (DDm) is a word order principle favouring the placement of syntactically related words close to each other in sentences. Massive evidence of the pr…
Optimal coding and the origins of Zipfian laws
Ramon Ferrer-i-Cancho, Christian Bentz, Caio Seguin
The problem of compression in standard information theory consists of assigning codes as short as possible to numbers. Here we consider the problem of optimal coding -- under an ar…
The sum of edge lengths in random linear arrangements
Ramon Ferrer-i-Cancho
Spatial networks are networks where nodes are located in a space equipped with a metric. Typically, the space is two-dimensional and until recently and traditionally, the metric th…