Faculty

Institution

Unit

Venue

Alan Frieze

Professor

Carnegie Mellon University

Affiliations

Mellon College of Science

Mathematical Sciences

Alan Frieze is currently serving as a Mathematical Sciences Professor at Carnegie Mellon University.

Honors

Create free account to unlock more features

Experiences

Create free account to unlock more features

Education

Create free account to unlock more features

Alan Frieze

Carnegie Mellon University

Professor

You can click a keyword to filter the displayed items

graph theory applied mathematics computer science mathematics combinatorics random graphs combinatorial theory discrete mathematics combinatorial optimization discrete algorithms probabilistic graph theory theoretical computer science extremal graph theory computational complexity network science probability theory network analysis mathematical optimization mathematical programming global networks structural graph theory randomized algorithms computational optimization statistical physics optimization problems hypergraph theory numerical algorithms combinatorial problems data science scientific computing topological graph theory graph algorithms hamilton cycles discrete optimization graph matching graph sparsity algebraic graph theory geometric graph theory mathematical sciences graph analysis spectral theory combinatorial methods analysis of algorithms social simulation probabilistic analysis algorithmic information theory analytic combinatorics computational complexity theory directed graphs sparse random graphs probabilistic computations polyhedron network theory geometric topology cover time metric graph theory enumerative combinatorics combinatorial designs random regular graphs machine learning research algorithmic development stochastic optimization random walks perfect matchings scheduling problems complexity theory edge-disjoint paths minimum degree salesman problems maximum matchings random bipartite graphs hamiltonian cycles convex bodies web graphs giant component random subgraphs logic in computer science operations research descriptive statistics pure mathematics history of mathematics numerical computation philosophy of mathematics automated deduction numerical mathematics computational model theory statistical thinking mathematical logic numerical analysis computational mathematics mathematics education foundation of mathematics applied statistics theory of computation approximation theory statistical hypothesis test statistical theory general systems statistical software models of computation behavioral statistic numerical treatment

Notable Scholarly Works

Notable Federal Grants

Collaborators

Aspects of a Randomly Growing Cluster in Rd, D≥ 2. (2026)

statistical mechanicsgranular computingcluster sciencecomputational sciencescientific datarandom graphsglobal networksstatistical physicsquantitative science studiesclusteringdata sciencegraph theorydata and information visualizationcluster computingcluster developmentphysicsnetwork sciencecomplex systemsunsupervised machine learningnetwork analysiscluster technology

Random Walks on Edge Coloured Random Graphs. (2026)

network sciencerandom graphsnetwork analysisglobal networksstatistical physicsprobabilistic graph theorygraph theory

Aspects of a Randomly Growing Cluster in ℝ^2, D≥2. (2025)

applied mathematicsapplied probabilitystatistical physicsprobability theoryclusteringcritical phenomenastatistical mechanics

Building Hamiltonian Cycles in the Semi-Random Graph Process in Less Than 2N Rounds. (2025)

computer scienceprobabilistic graph theorystochastic partial differential equationsprobability theorystochastic geometrystatistical mechanicsstochastic processrandom graphsglobal networksmathematicsstatistical physicscombinatorial optimizationdiscrete mathematicsgraph theoryapplied probabilitydiscrete algorithmsapplied mathematicsergodic theorystructural graph theorycombinatorial theorycomputational physicsextremal graph theory

Building Hamiltonian Cycles in the Semi-Random Graph Process in Less Than 2 N Rounds. European Journal of Combinatorics (2025)

random graphsapplied mathematicssemi-random graph processcombinatorial optimizationstatistical physicsdiscrete mathematicsprobabilistic graph theorystructural graph theorymath xmlnsstatistical mechanicscombinatorial theorymathematicsdiscrete algorithmsextremal graph theorygraph theoryhamiltonian cycleshamiltonian system

Cover Time of Random Subgraphs of the Hypercube. arXiv (Cornell University) (2025)

probabilistic graph theorytopological graph theoryprobability theorystatistical mechanicscomputational sciencestatisticsrandom graphsscientific computinghypergraph theorystatistical physicsquantitative science studiesdiscrete mathematicssamplinggraph theoryapplied probabilitycomputational statisticsdiscrete algorithmsapplied mathematicscombinatoricscombinatorial theorymathematicsextremal graph theory

Hamilton Cycles in Random Digraphs With Minimum Degree at Least One. SIAM Journal on Discrete Mathematics (2025)

random graphsminimum degreecombinatoricsdiscrete mathematicsprobabilistic graph theorystructural graph theoryhamilton cyclesrandom digraphscombinatorial theoryextremal graph theorygraph theory

Karp's Patching Algorithm on Dense Digraph. (2025)

graph algorithmsapplied mathematicsstructural graph theorydiscrete mathematicsnumerical algorithmscomputational geometrymathematicsdiscrete algorithmsgraph theory

Loose Paths in Random Ordered Hypergraphs. arXiv (Cornell University) (2025)

random graphshypergraph theoryapplied mathematicscombinatoricsdiscrete mathematicscombinatorial theorymathematicsdiscrete algorithmsgraph theory

On Minimum Cost Rainbow Structures. (2025)

combinatorial design theoryapplied mathematicscombinatoricsgeometric algorithmsdiscrete mathematicspolyhedroncomputational geometrycombinatorial theorymathematics

1
2
3
4
5
77
10 / page

Alan Frieze

Professor

Carnegie Mellon University

Affiliations

Mellon College of Science

Mathematical Sciences

Alan Frieze is currently serving as a Mathematical Sciences Professor at Carnegie Mellon University.

Honors

Create free account to unlock more features

Experiences

Create free account to unlock more features

Education

Create free account to unlock more features

Alan Frieze

Carnegie Mellon University

Professor

You can click a keyword to filter the displayed items

Notable Scholarly Works

Notable Federal Grants

Collaborators

Aspects of a Randomly Growing Cluster in Rd, D≥ 2. (2026)

Random Walks on Edge Coloured Random Graphs. (2026)

network sciencerandom graphsnetwork analysisglobal networksstatistical physicsprobabilistic graph theorygraph theory

Aspects of a Randomly Growing Cluster in ℝ^2, D≥2. (2025)

applied mathematicsapplied probabilitystatistical physicsprobability theoryclusteringcritical phenomenastatistical mechanics

Building Hamiltonian Cycles in the Semi-Random Graph Process in Less Than 2N Rounds. (2025)

Building Hamiltonian Cycles in the Semi-Random Graph Process in Less Than 2 N Rounds. European Journal of Combinatorics (2025)

Cover Time of Random Subgraphs of the Hypercube. arXiv (Cornell University) (2025)

Hamilton Cycles in Random Digraphs With Minimum Degree at Least One. SIAM Journal on Discrete Mathematics (2025)

random graphsminimum degreecombinatoricsdiscrete mathematicsprobabilistic graph theorystructural graph theoryhamilton cyclesrandom digraphscombinatorial theoryextremal graph theorygraph theory

Karp's Patching Algorithm on Dense Digraph. (2025)

graph algorithmsapplied mathematicsstructural graph theorydiscrete mathematicsnumerical algorithmscomputational geometrymathematicsdiscrete algorithmsgraph theory

Loose Paths in Random Ordered Hypergraphs. arXiv (Cornell University) (2025)

random graphshypergraph theoryapplied mathematicscombinatoricsdiscrete mathematicscombinatorial theorymathematicsdiscrete algorithmsgraph theory

On Minimum Cost Rainbow Structures. (2025)

combinatorial design theoryapplied mathematicscombinatoricsgeometric algorithmsdiscrete mathematicspolyhedroncomputational geometrycombinatorial theorymathematics

1
2
3
4
5
77
10 / page

Similar Faculty Members

Prasad Tetali

Institution

Carnegie Mellon University

computational model theory

discrete algorithm

Po-Shen Loh

Institution

Carnegie Mellon University

data preparation

general systems

Tom Bohman

Institution

Carnegie Mellon University

discrete algorithm

random graph

David Aldous

Institution

University of California, Berkeley

probabilistic analysis

statistical science

Wesley Pegden

Institution

Carnegie Mellon University

general systems

mathematics education

Florian Frick

Institution

Carnegie Mellon University

numerical mathematics

general systems

Dejan Slepčev

Institution

Carnegie Mellon University

numerical mathematics

general systems

Joel H. Spencer

Institution

New York University

discrete algorithm

models of computation

Irene Fonseca

Institution

Carnegie Mellon University

numerical mathematics

general systems

James Cummings

Institution

Carnegie Mellon University

philosophical inquiry

philosophy of science

Similar Faculty Members

Prasad Tetali

Institution

Carnegie Mellon University

computational model theory

discrete algorithm

Po-Shen Loh

Institution

Carnegie Mellon University

data preparation

general systems

Tom Bohman

Institution

Carnegie Mellon University

discrete algorithm

random graph

David Aldous

Institution

University of California, Berkeley

probabilistic analysis

statistical science

Wesley Pegden

Institution

Carnegie Mellon University

general systems

mathematics education

Florian Frick

Institution

Carnegie Mellon University

numerical mathematics

general systems

Dejan Slepčev

Institution

Carnegie Mellon University

numerical mathematics

general systems

Joel H. Spencer

Institution

New York University

discrete algorithm

models of computation

Irene Fonseca

Institution

Carnegie Mellon University

numerical mathematics

general systems

James Cummings

Institution

Carnegie Mellon University

philosophical inquiry

philosophy of science