Amir Dembo
Stanford University, CA·Mathematics & Statistics
Networks are everywhere, including social networks, transportation systems and biological systems. They are made of objects, called nodes, connected by links that can have different weights.
- Fields
Mathematics & Statistics
Computer Science
- Topics
probability theory
random graphs
Erdős–Rényi graph
- Grants
- 1 known grant, through Jul 2029
What they work on
- Characterize the limiting behavior of large sparse random graphs, such as Erdős–Rényi graphs, through explicit variational formulas that do not depend on model details.
- Analyze Gibbs measures on sparse random graphs whose ground states solve combinatorial optimization problems linked to statistical inference tasks.
- Study random walks and other stochastic dynamics on large random graphs to understand the structure of the Gibbs measures they leave invariant.
More about the research
Analyzing one specific large network is notoriously hard. For many models of large random networks, however, most likely instances behave the same way. This shared limiting behavior often does not depend on the fine details of the model and can be captured by an explicit variational formula. This project aims to deepen basic understanding of probabilistic modeling by exploring these large-scale descriptions and drawing algorithmic and statistical inference insights from them.
Why it matters
This is basic research in probability theory. It aims to explain why large random networks behave predictably and how simple formulas describe them. The results could eventually inform algorithms and statistical inference methods for analyzing large networks of the kind that model social, transportation and biological systems.
Known grants
From NIH and NSF research grants. Labs often have other funding we can't see.
Closest labs
Xuan Wu
University of Illinois Urbana-Champaign, IL·Mathematics & Statistics
Establish connections between the KPZ equation, a model of random interface growth, and the KPZ line ensemble, a family of interacting random curves, using their shared Gibbs properties.
Jacob Fox
Stanford University, CA·Mathematics & Statistics
Determine how the number of colors and the structure of hypergraphs, networks whose edges can join more than two points, govern the off-diagonal growth of hypergraph Ramsey numbers.
Huy Pham
California Institute of Technology, CA·Mathematics & Statistics·Early-career
Develop new toolkits for first moment obstructions, where counting expected copies of a structure rules it out, to close gaps in the theory of threshold phenomena in random discrete systems.
The school
Stanford University: 87 labs on PI Pages, $1.6B a year on research, 739 research doctorates a year.
Reach out
A start for your email. Fill in the brackets.