activity
19942025
most citedIdentification of influential spreaders in complex networks

3.3k citations · 17.6k across the 141 of their papers we have counts for

collaborators
Showing cond-mat.dis-nnShow all

15 papers · 1 filter

cond-mat.dis-nn2019★ 43 cited

Symmetry group factorization reveals the structure-function relation in the neural connectome of Caenorhabditis elegans

Flaviano Morone, Hernan A. Makse

The neural connectome of the nematode Caenorhabditis elegans has been completely mapped, yet in spite of being one of the smallest connectomes (302 neurons), the design principles…

cond-mat.dis-nn2013

Cavity method for force transmission in jammed disordered packings of hard particles

Lin Bo, Romain Mari, Chaoming Song +1

The force distribution of jammed disordered packings has always been considered a central object in the physics of granular materials. However, many of its features are poorly unde…

cond-mat.dis-nn2010★ 61 cited

Model of random packings of different size balls

Maximilien Danisch, Yuliang Jin, Hernan A. Makse

We develop a model to describe the properties of random assemblies of polydisperse hard spheres. We show that the key features to describe the system are (i) the dependence between…

cond-mat.dis-nn2009★ 161 cited

Small world-Fractal Transition in Complex Networks: Renormalization Group Approach

Hernán D. Rozenfeld, Chaoming Song, Hernán A. Makse

We show that renormalization group (RG) theory applied to complex networks are useful to classify network topologies into universality classes in the space of configurations. The R…

cond-mat.dis-nn2007★ 216 cited

Scaling theory of transport in complex networks

Lazaros K. Gallos, Chaoming Song, Shlomo Havlin +1

Transport is an important function in many network systems and understanding its behavior on biological, social, and technological networks is crucial for a wide range of applicati…

cond-mat.dis-nn2007★ 355 cited

How to calculate the fractal dimension of a complex network: the box covering algorithm

Chaoming Song, Lazaros K. Gallos, Shlomo Havlin +1

Covering a network with the minimum possible number of boxes can reveal interesting features for the network structure, especially in terms of self-similar or fractal characteristi…