activity
20122015
most citedQuantifying randomness in real networks

191 citations · 268 across the 3 of their papers we have counts for

collaborators

5 papers

cond-mat.dis-nn2015★ 8 cited

Emergence of coexisting percolating clusters in networks

Ali Faqeeh, Sergey Melnik, Pol Colomer-de-Simón +1

It is commonly assumed in percolation theories that at most one percolating cluster can exist in a network. We introduce sausage-like networks (SLNs), an ensemble of synthetic modu…

physics.soc-ph2015★ 191 cited

Quantifying randomness in real networks

Chiara Orsini, Marija Mitrović Dankulov, Almerima Jamakovic +9

Represented as graphs, real networks are intricate combinations of order and disorder. Fixing some of the structural properties of network models to their values observed in real n…

physics.soc-ph2014

Double percolation phase transition in clustered complex networks

Pol Colomer-de-Simon, Marian Boguna

The internal organization of complex networks often has striking consequences on either their response to external perturbations or on their dynamical properties. In addition to sm…

physics.soc-ph2013★ 69 cited

Deciphering the global organization of clustering in real complex networks

Pol Colomer-de-Simon, M. Angeles Serrano, Mariano G. Beiro +2

We uncover the global organization of clustering in real complex networks. As it happens with other fundamental properties of networks such as the degree distribution, we find that…

cond-mat.dis-nn2012

Clustering of random scale-free networks

Pol Colomer-de-Simon, Marian Boguna

We derive the finite size dependence of the clustering coefficient of scale-free random graphs generated by the configuration model with degree distribution exponent . Degre…