World's Best Scientists 2026 revealed!
Award Badge
Mathematics
USA
2026

D-Index & Metrics

Computer Science

D-Index
84
Citations
25964
World Ranking
861
National Ranking
469

Mathematics

D-Index
84
Citations
26119
World Ranking
115
National Ranking
66

Research.com Recognitions

  • 2026 - Research.com Mathematics in United States Leader Award
  • 2025 - Research.com Mathematics in United States Leader Award
  • 2013 - Fellow of the American Mathematical Society
  • 2011 - SIAM Fellow For pioneering work on random graphs and probabilistic analysis of combinatorial algorithms.
  • 1997 - Fellow of John Simon Guggenheim Memorial Foundation

Overview

Alan Frieze is affiliated with Carnegie Mellon University in the United States. Their research primarily spans the disciplines of Mathematics and Computer Science, with a significant focus on subfields such as Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Mathematical Physics, Geometry and Topology, and Statistics and Probability.

Their work addresses a variety of topics including Limits and Structures in Graph Theory, Advanced Graph Theory Research, Stochastic Processes and Statistical Mechanics, Graph Theory and Applications, Topological and Geometric Data Analysis, Markov Chains and Monte Carlo Methods, and Complexity and Algorithms in Graphs.

Frieze has published extensively in several academic venues with notable frequency. These venues include:

  • arXiv (Cornell University)
  • SIAM Journal on Discrete Mathematics
  • Random Structures and Algorithms
  • The Electronic Journal of Combinatorics
  • Discrete Applied Mathematics

Their recent papers, illustrating a range of topics and collaborations, are:

  • "A scaling limit for the length of the longest cycle in a sparse random digraph" (2021), published in Random Structures and Algorithms
  • "Rainbow Thresholds" (2024), published in SIAM Journal on Discrete Mathematics
  • "Localization game for random graphs" (2021), published in Discrete Applied Mathematics
  • "A scaling limit for the length of the longest cycle in a sparse random graph" (2021), published in Journal of Combinatorial Theory Series B
  • "Hamilton cycles in a semi-random graph model" (2022), published on arXiv (Cornell University)

Their frequent collaborators include Wesley Pegden, Patrick Bennett, Tomasz Tkocz, Tolson Bell, and Paweł Prałat.

Among their book publications, they have contributed to a volume by Cambridge University Press titled "Random Graphs and Networks: A First Course" published in 2023.

Throughout their career, Alan Frieze has received recognition including being named a Fellow of the American Mathematical Society in 2013, a SIAM Fellow in 2011 for pioneering work on random graphs and probabilistic analysis of combinatorial algorithms, and a Fellow of the John Simon Guggenheim Memorial Foundation in 1997.

Best Publications

  • Min-Wise Independent Permutations

    Andrei Z Broder;Moses Charikar;Alan M Frieze;Michael Mitzenmacher

  • A random polynomial-time algorithm for approximating the volume of convex bodies

    Martin Dyer;Alan Frieze;Ravi Kannan

  • Fast monte-carlo algorithms for finding low-rank approximations

    Alan Frieze;Ravi Kannan;Santosh Vempala

  • Introduction to random graphs

    Alan Frieze;Michał Karoński

  • Clustering Large Graphs via the Singular Value Decomposition

    P. Drineas;A. Frieze;R. Kannan;S. Vempala

  • Quick Approximation to Matrices and Applications

    Alan M. Frieze;Ravi Kannan

  • Improved approximation algorithms for MAX k-CUT and MAX BISECTION

    Alan M. Frieze;Mark Jerrum

  • A general model of web graphs

    Colin Cooper;Alan Frieze

  • Min-wise independent permutations (extended abstract)

    Andrei Z. Broder;Moses Charikar;Alan M. Frieze;Michael Mitzenmacher

  • On the complexity of computing the volume of a polyhedron

    M. E. Dyer;A. M. Frieze

  • THE SHORTEST-PATH PROBLEM FOR GRAPHS WITH RANDOM ARC-LENGTHS

    Alan M. Frieze;Geoffrey R. Grimmett

  • On the worst-case performance of some algorithms for the asymmetric traveling salesman problem

    Alan M. Frieze;Giulia Galbiati;Francesco Maffioli

  • On the value of a random minimum spanning tree problem

    Alan M. Frieze

  • Analysis of Two Simple Heuristics on a Random Instance ofk-sat

    Alan Frieze;Stephen Suen

  • On the independence number of random graphs

    A. M. Frieze

  • Clustering in large graphs and matrices

    P. Drineas;Alan Frieze;Ravi Kannan;Santosh Vempala

  • A simple heuristic for the p-centre problem

    M.E Dyer;A.M Frieze

  • The regularity lemma and approximation schemes for dense problems

    A. Frieze;R. Kannan

  • Approximation algorithms for the m-dimensional 0–1 knapsack problem: Worst-case and probabilistic analyses

    A.M. Frieze;M.R.B. Clarke

  • The solution of some random NP-hard problems in polynomial expected time

    M. E. Dyer;A. M. Frieze

  • ON THE QUADRATIC ASSIGNMENT PROBLEM

    Alan M. Frieze;J. Yadegar

  • A random polynomial time algorithm for approximating the volume of convex bodies

    M. Dyer;A. Frieze

  • Random graphs

    Alan Frieze

Frequent Co-Authors

Colin Cooper
Colin Cooper University of East Anglia
Martin Dyer
Martin Dyer University of Leeds
Michael Krivelevich
Michael Krivelevich Tel Aviv University
Eli Upfal
Eli Upfal Brown University
Andrei Z. Broder
Andrei Z. Broder Google (United States)
Ravi Kannan
Ravi Kannan Microsoft (United States)
Mark Jerrum
Mark Jerrum Queen Mary University of London
Santosh Vempala
Santosh Vempala Georgia Institute of Technology
Béla Bollobás
Béla Bollobás University of Memphis
Bruce Reed
Bruce Reed McGill University

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Pursuing a Mathematics degree in the USA can open doors to various advanced career options, often complemented by specialized online programs. For professionals aiming to enhance leadership skills, exploring the fastest online mba programs offers a time-efficient way to gain business acumen alongside analytical expertise.

Those interested in combining quantitative analysis with financial knowledge may consider affordable options like the cheapest online masters in finance. This degree provides essential skills for roles in financial modeling, risk management, and investment analysis.

For individuals aiming for senior executive roles or entrepreneurship in analytical fields, the best 1 year dba program online offers a streamlined path to doctoral credentials focused on business administration.

Marketing professionals with a quantitative mindset can boost their career potential with a master's degree in marketing, blending data-driven decision making with market strategy insights. Exploring these related online degrees can provide versatile pathways tailored to evolving career goals.

Best Scientists Citing Alan Frieze

Trending Scientists