Efficient embedding of complex networks to hyperbolic space via their Laplacian.

PubWeight™: 0.78‹?›

🔗 View Article (PMID 27445157)

Published in Sci Rep on July 22, 2016

Authors

Gregorio Alanis-Lobato1, Pablo Mier1, Miguel A Andrade-Navarro1

Author Affiliations

1: Faculty of Biology, Johannes Gutenberg Universität, Institute of Molecular Biology, Ackermannweg 4, 55128 Mainz, Germany.

Articles citing this

Navigation by anomalous random walks on complex networks. Sci Rep (2016) 0.75

Articles cited by this

Emergence of scaling in random networks Science (1999) 89.38

A global geometric framework for nonlinear dimensionality reduction. Science (2000) 23.62

A new method to measure the semantic similarity of GO terms. Bioinformatics (2007) 5.91

Clustering and preferential attachment in growing networks. Phys Rev E Stat Nonlin Soft Matter Phys (2001) 3.28

Popularity versus similarity in growing networks. Nature (2012) 3.27

GOSemSim: an R package for measuring semantic similarity among GO terms and gene products. Bioinformatics (2010) 3.20

Guilt-by-association goes global. Nature (2000) 2.62

HIPPIE: Integrating protein interaction networks with experiment based quality scores. PLoS One (2012) 2.17

Using manifold embedding for assessing and predicting protein interactions from high-throughput experimental data. Bioinformatics (2010) 1.65

Self-similarity of complex networks and hidden metric spaces. Phys Rev Lett (2008) 1.54

Hyperbolic geometry of complex networks. Phys Rev E Stat Nonlin Soft Matter Phys (2010) 1.53

Skeleton and fractal scaling in complex networks. Phys Rev Lett (2006) 1.50

From link-prediction in brain connectomes and protein interactomes to the local-community-paradigm in complex networks. Sci Rep (2013) 1.49

Geometric de-noising of protein-protein interaction networks. PLoS Comput Biol (2009) 1.46

Increasing confidence of protein interactomes using network topological metrics. Bioinformatics (2006) 1.24

Minimum curvilinearity to enhance topological prediction of protein interactions by network embedding. Bioinformatics (2013) 1.13

Random geometric graphs. Phys Rev E Stat Nonlin Soft Matter Phys (2002) 1.13

FastaHerder2: Four Ways to Research Protein Function and Evolution with Clustering and Clustered Databases. J Comput Biol (2016) 0.92

Exploring complex networks via topological embedding on surfaces. Phys Rev E Stat Nonlin Soft Matter Phys (2012) 0.82

Network geometry inference using common neighbors. Phys Rev E Stat Nonlin Soft Matter Phys (2015) 0.81

Preferential attachment in growing spatial networks. Phys Rev E Stat Nonlin Soft Matter Phys (2011) 0.80

Generalized Communities in Networks. Phys Rev Lett (2015) 0.80