54 citations · 105 across the 3 of their papers we have counts for
3 papers
Clustering coefficient without degree correlations biases
Sara Nadiv Soffer, Alexei Vazquez
The clustering coefficient quantifies how well connected are the neighbors of a vertex in a graph. In real networks it decreases with the vertex degree, which has been taken as a s…
A statistical approach to the traceroute-like exploration of networks: theory and simulations
Luca Dall'Asta, Ignacio Alvarez-Hamelin, Alain Barrat +2
Mapping the Internet generally consists in sampling the network from a limited set of sources by using "traceroute"-like probes. This methodology, akin to the merging of different…
Distance-d covering problems in scale-free networks with degree correlations
Pablo Echenique, Jesus Gomez-Gardenes, Yamir Moreno +1
A number of problems in communication systems demand the distributed allocation of network resources in order to provide better services, sampling and distribution methods. The sol…