Fundamental network science

formalized representations of the geometry of multi-dimensional networks

Foundational network science research includes: study of topological data analysis on graphs, reinforcement learning on complex networks, graph embedding and representation learning, scalable algorithms for mining graphs, and anomaly detection. We are also working on a collection of studies developing rigorous approaches to latent-geometric network models, maximum entropy ensembles of random graphs, and their navigability, with applications ranging from neuroscience to quantum gravity and cosmology.

Featured publications

Dynamic hidden-variable network models

Harrison Hartle, Fragkiskos Papadopoulos, and Dmitri Krioukov
Phys. Rev. E
May 13, 2021

A wealth of discovery built on the Human Genome Project — by the numbers

Alexander J. Gates, Deisy Morselli Gysi, Manolis Kellis & Albert-László Barabási
February 10, 2021

Network geometry

Marián Boguñá, Ivan Bonamassa, Manlio De Domenico, Shlomo Havlin, Dmitri Krioukov, M. Ángeles Serrano
Nature Reviews Physics
January 29, 2021

Recent publications

Exploring noise, degeneracy, and determinism in biological networks with the einet package

Brennan Klein, Anshuman Swain, Travis Byrum,Samuel V. Scarpino, William F. Fagan
British Ecological Society
January 19, 2022

pymdp: A Python library for active inference in discrete state spaces

Conor Heins, Beren Millidge, Daphne Demekas, Brennan Klein, Karl Friston, Iain Couzin, Alexander Tschantz
January 12, 2022

Dynamic hidden-variable network models

Harrison Hartle, Fragkiskos Papadopoulos, and Dmitri Krioukov
Phys. Rev. E
May 13, 2021

Nonbacktracking Eigenvalues under Node Removal: X-Centrality and Targeted Immunization

Leo Torres, Kevin S. Chan, Hanghang Tong, Tina Eliassi-Rad
May 13, 2021

Ollivier-Ricci curvature convergence in random geometric graphs

Pim van der Hoorn, William J. Cunningham, Gabor Lippner, Carlo Trugenberger, and Dmitri Krioukov
Physics Review Research
March 5, 2021
View more

Featured news coverage

Featured project

In our project on Scalable Graph Distances, we explore measurements of graph distance in metric spaces, which are required for many graph mining tasks (eg, clustering, anomaly detection). This project explores a formal mathematical foundation covering a family of graph distance measures that overcome common limitations, such as their inability to scale up to millions of nodes and reliance on heuristics. In another collection of studies on latent geometry, we rigorously establish conditions for a given (real) network to have latent geometry. This geometry can then be reliably used in applications ranging from explaining the structure of (optimal) information flows in the brain to providing new approaches to the dark energy problem in cosmology.

Major funders

NSF, Army Research Office