Santa Fe
Institute
  • Research
    • Themes
    • Projects
    • SFI Press
    • Researchers
    • Publications
    • Library
    • Sponsored Research
    • Fellowships
    • Miller Scholarships
  • News + Events
    • News
    • Newsletters
    • Podcasts
    • SFI in the Media
    • Media Center
    • Events
    • Community
    • Journalism Fellowship
  • Education
    • Programs
    • Projects
    • Alumni
    • Complexity Explorer
    • Education FAQ
    • Postdoctoral Research
    • Education Supporters
  • People
    • Researchers
    • Fractal Faculty
    • Staff
    • Miller Scholars
    • Trustees
    • Governance
    • Resident Artists
    • Research Supporters
  • Applied Complexity
    • Office
    • Applied Projects
    • ACtioN
    • Applied Fellows
    • Studios
    • Applied Events
    • Login
  • Give
    • Give Now
    • Ways to Give
    • Contact
  • About
    • About SFI
    • Engage
    • Complex Systems
    • FAQ
    • Campuses
    • Jobs
    • Contact
    • Library
    • Employee Portal

Science for a Complex World

Events

Here's what's happening

Give

You make SFI possible

Subscribe

Sign up for research news

Connect

Follow us on social media

© 2026 Santa Fe Institute. All rights reserved. This site is supported by the Miller Omega Program.

Home / Research / Projects

Social networks, big data, and physics-powered inference

image: pixabay
Overview

We use physics-inspired methods to find structure within large datasets.

We are in an age of information, with nearly every scientific field awash in new data. Thus, making sense of large sets of real-world data stands as a preeminent challenge for modern science. Massive data sets, whether they record food web relationships, online friendships, or distributions of utilities like electricity, are often described by mathematical network models that give structure to the data – and help us better understand the relationships hidden within it.

Our project aims to use physics-inspired methods to find structure within large data sets and determine when these structures are statistically significant. We are developing elegant, flexible, and computationally efficient algorithms for investigating the underlying structures, dynamics, and attributes of real-world networks.These physics-based algorithms can point to hidden connections between spatially disparate nodes of a network. They can help us understand why a natural disaster in a given area might cause an electrical blackout hundreds of miles away. They can reveal similar relationships in different data sets, such as the keystone species in a modern food web and those from the Cambrian period. They can fill in missing data with intelligent guesses, predict missing links, and tell us the probability that a given node belongs to a given community. Moreover, these algorithms are scalable, allowing us to solve massive problems, once the domain of supercomputers, on an ordinary laptop.

As we seek out the structures, patterns and attributes of large data sets, we also pursue the broader question of how a network’s structure gives rise to its dynamics. In doing so, we hope to understand the similarities and differences between social networks, economies, power grids, and food webs.

Share
  • Sign Up For SFI News
  • Sponsors
  • DARPA
  • James S. McDonnell Foundation
  • John Templeton Foundation
  • National Science Foundation


  • Investigators
  • Aaron Clauset
  • Cristopher Moore
  • Mark Newman


  • Collaborators
  • Jennifer Dunne


  • News
  • Researchers play devil’s advocate to explore where algorithms can't
  • Applying mathematics takes ‘friendship paradox’ beyond averages
  • NM experts fight for transparency and fairness in housing algorithms
  • D'Souza wins Euler award for work in explosive percolation
  • Video: 2018 Ulam Lectures — The Limits of Computers in Science and Society
  • Parakeet pecking orders, basketball match-ups, and the tenure-track: How analyzing winners and losers can reveal rank within networks
  • Finding meaning in big data
Show more

  • Resources
  • Video: Physics-Inspired Algorithms and Phase Transitions in Community Detection
  • Video: Construction Dynamics Seminar Series - The Algorithmic Picture
  • Paper: Spectral redemption in clustering sparse networks Proceedings of the National Academy of Sciences 2013 vol.110 no.52
  • Paper: Scalable detection of statistically significant communities and hierarchies, using message passing for modularity Proceedings of the National Academy of Sciences 2014 vol.111 no.51