activity
20172020
most citedNavigability evaluation of complex networks by greedy routing efficiency

35 citations · 79 across the 6 of their papers we have counts for

collaborators

9 papers

cs.SI20201 cited

Geometrical congruence and efficient greedy navigability of complex networks

Carlo Vittorio Cannistraci, Alessandro Muscoloni

Hyperbolic networks are supposed to be congruent with their underlying latent geometry and following geodesics in the hyperbolic space is believed equivalent to navigate through to…

physics.soc-ph2020

Modular gateway-ness connectivity and structural core organization in maritime network science

Mengqiao Xu, Qian Pan, Alessandro Muscoloni +2

Around 80% of global trade by volume is transported by sea, and thus the maritime transportation system is fundamental to the world economy. To better exploit new international shi…

q-bio.QM202015 cited

Cell Mechanics Based Computational Classification of Red Blood Cells Via Machine Intelligence Applied to Morpho-Rheological Markers

Yan Ge, Philipp Rosendahl, Claudio Durán +4

Despite fluorescent cell-labelling being widely employed in biomedical studies, some of its drawbacks are inevitable, with unsuitable fluorescent probes or probes inducing a functi…

cs.LG20192 cited

Measuring group-separability in geometrical space for evaluation of pattern recognition and embedding algorithms

A. Acevedo, S. Ciucci, MJ. Kuo +2

Evaluating data separation in a geometrical space is fundamental for pattern recognition. A plethora of dimensionality reduction (DR) algorithms have been developed in order to rev…

cs.LG20193 cited

Angular separability of data clusters or network communities in geometrical space and its relevance to hyperbolic embedding

Alessandro Muscoloni, Carlo Vittorio Cannistraci

Analysis of 'big data' characterized by high-dimensionality such as word vectors and complex networks requires often their representation in a geometrical space by embedding. Recen…

physics.soc-ph201935 cited

Navigability evaluation of complex networks by greedy routing efficiency

Alessandro Muscoloni, Carlo Vittorio Cannistraci

Network navigability is a key feature of complex networked systems. For a network embedded in a geometrical space, maximization of greedy routing (GR) measures based on the node ge…