activity
20112020
most citedDeciphering Network Community Structure by Surprise

115 citations · 670 across the 11 of their papers we have counts for

collaborators

11 papers

physics.soc-ph2020★ 16 cited

Random hyperbolic graphs in dimensions

Gabriel Budel, Maksim Kitsak, Rodrigo Aldecoa +2

We consider random hyperbolic graphs in hyperbolic spaces of any dimension . We present a rescaling of model parameters that casts the random hyperbolic graph model of a…

cs.NI2017★ 32 cited

Geohyperbolic Routing and Addressing Schemes

Ivan Voitalov, Rodrigo Aldecoa, Lan Wang +1

The key requirement to routing in any telecommunication network, and especially in Internet-of-Things (IoT) networks, is scalability. Routing must route packets between any source…

cs.NI2016★ 86 cited

An Experimental Investigation of Hyperbolic Routing with a Smart Forwarding Plane in NDN

Vince Lehman, Ashlesh Gawande, Beichuan Zhang +4

Routing in NDN networks must scale in terms of forwarding table size and routing protocol overhead. Hyperbolic routing (HR) presents a potential solution to address the routing sca…

physics.soc-ph2015★ 53 cited

Hyperbolic Graph Generator

Rodrigo Aldecoa, Chiara Orsini, Dmitri Krioukov

Networks representing many complex systems in nature and society share some common structural properties like heterogeneous degree distributions and strong clustering. Recent resea…

physics.soc-ph2015★ 113 cited

Detecting communities using asymptotical Surprise

V. A. Traag, R. Aldecoa, J-C. Delvenne

Nodes in real-world networks are repeatedly observed to form dense clusters, often referred to as communities. Methods to detect these groups of nodes usually maximize an objective…

q-bio.MN2013★ 22 cited

SurpriseMe: an integrated tool for network community structure characterization using Surprise maximization

Rodrigo Aldecoa, Ignacio Marín

Detecting communities, densely connected groups may contribute to unravel the underlying relationships among the units present in diverse biological networks (e.g., interactome, co…