◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

R. Ferrer-i-Cancho

66 papers hereh-index 333.7k citations118 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author17
  • first author17
  • middle author6
  • last author24

Across the 64 of 66 papers where every author was matched, so the position is known.

fields
  • cs.CL38
  • physics.soc-ph5
  • q-bio.NC5
  • cs.DS4
  • cs.DM3
  • physics.data-an3
same name
  • R. Ferrer-i-Cancho — 3 papers, h 2

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20092023
most citedNetworks in Cognitive Science

342 citations · 1.8k across the 65 of their papers we have counts for

collaborators
Showing 2020Show all

4 papers · 1 filter

cs.CL2020★ 28 cited

The optimality of syntactic dependency distances

Ramon Ferrer-i-Cancho, Carlos Gómez-Rodríguez, Juan Luis Esteban +1

It is often stated that human languages, as other biological systems, are shaped by cost-cutting pressures but, to what extent? Attempts to quantify the degree of optimality of lan…

cs.DM2020★ 6 cited

Bounds of the sum of edge lengths in linear arrangements of trees

Ramon Ferrer-i-Cancho, Carlos Gómez-Rodríguez, Juan Luis Esteban

A fundamental problem in network science is the normalization of the topological or physical distance between vertices, that requires understanding the range of variation of the un…

cs.DM2020

Reappraising the distribution of the number of edge crossings of graphs on a sphere

Lluís Alemany-Puig, Mercè Mora, Ramon Ferrer-i-Cancho

Many real transportation and mobility networks have their vertices placed on the surface of the Earth. In such embeddings, the edges laid on that surface may cross. In his pioneeri…

stat.CO2020

Fast calculation of the variance of edge crossings in random arrangements

Lluís Alemany-Puig, Ramon Ferrer-i-Cancho

The crossing number of a graph G, cr(G), is the minimum number of edge crossings arising when drawing a graph on a certain surface. Determining cr(G) is a p…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.