- Home
- Best Scientists - Mathematics
- Alan Frieze

Mathematics

USA

2023

Discipline name
D-index
D-index (Discipline H-index) only includes papers and citation values for an examined
discipline in contrast to General H-index which accounts for publications across all
disciplines.
Citations
Publications
World Ranking
National Ranking

Mathematics
D-index
77
Citations
22,681
608
World Ranking
114
National Ranking
65

Computer Science
D-index
77
Citations
22,726
607
World Ranking
752
National Ranking
451

2023 - 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

- Combinatorics
- Discrete mathematics
- Algorithm

Alan Frieze mainly focuses on Combinatorics, Discrete mathematics, Random graph, Random regular graph and Random walk. Alan Frieze interconnects Algorithm and Simple in the investigation of issues within Combinatorics. His work in Discrete mathematics is not limited to one particular discipline; it also encompasses Matrix.

His studies in Random graph integrate themes in fields like Indifference graph, Hopcroft–Karp algorithm, Graph product, Constant and struct. His Random regular graph research is multidisciplinary, incorporating perspectives in Expected value, Bound graph and Degree. His study on Random walk also encompasses disciplines like

- Isoperimetric inequality which intersects with area such as Correctness,
- Regular graph which intersects with area such as Stationary distribution.

- Min-Wise Independent Permutations (753 citations)
- A random polynomial-time algorithm for approximating the volume of convex bodies (591 citations)
- Quick Approximation to Matrices and Applications (443 citations)

Alan Frieze mainly investigates Combinatorics, Discrete mathematics, Random graph, Graph and Random regular graph. Vertex, Hamiltonian path, Binary logarithm, Vertex and Hypergraph are the core of his Combinatorics study. His study connects Random walk and Discrete mathematics.

In his research, Matching is intimately related to Bipartite graph, which falls under the overarching field of Random graph. The various areas that Alan Frieze examines in his Random regular graph study include Pancyclic graph and Graph power, Factor-critical graph, Regular graph. The subject of his Time complexity research is within the realm of Algorithm.

- Combinatorics (84.47%)
- Discrete mathematics (51.94%)
- Random graph (36.25%)

- Combinatorics (84.47%)
- Random graph (36.25%)
- Graph (16.83%)

Combinatorics, Random graph, Graph, Vertex and Random walk are his primary areas of study. His studies deal with areas such as Discrete mathematics and Constant as well as Combinatorics. In general Random graph study, his work on Giant component often relates to the realm of High probability, thereby connecting several areas of interest.

His research in the fields of Bipartite graph overlaps with other disciplines such as Sigma and Omega. His Vertex study combines topics in areas such as Upper and lower bounds and Cubic graph. His work focuses on many connections between Random walk and other disciplines, such as Hash function, that overlap with his field of interest in Bin.

- Assessing significance in a Markov chain without mixing. (45 citations)
- Hamilton Cycles in Random Graphs: a bibliography (15 citations)
- Embedding the Erdős–Rényi hypergraph into the random regular hypergraph and Hamiltonicity (13 citations)

- Combinatorics
- Algorithm
- Statistics

His main research concerns Combinatorics, Random graph, Hamiltonian path, Graph and Vertex. His work carried out in the field of Combinatorics brings together such families of science as Discrete mathematics and Constant. His research integrates issues of Voter model, Bounded function and Asynchronous communication in his study of Discrete mathematics.

Alan Frieze focuses mostly in the field of Random graph, narrowing it down to matters related to Longest path problem and, in some cases, Polynomial and Polynomial. His Hamiltonian path study incorporates themes from Hypergraph, Embedding, Set and Random regular graph. His work on Giant component as part of general Graph study is frequently connected to Omega, therefore bridging the gap between diverse disciplines of science and establishing a new relationship between them.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Min-Wise Independent Permutations

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

symposium on the theory of computing **(2000)**

1385 Citations

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

Martin Dyer;Alan Frieze;Ravi Kannan.

Journal of the ACM **(1991)**

931 Citations

Fast monte-carlo algorithms for finding low-rank approximations

Alan Frieze;Ravi Kannan;Santosh Vempala.

Journal of the ACM **(2004)**

856 Citations

Clustering Large Graphs via the Singular Value Decomposition

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

Machine Learning **(2004)**

638 Citations

Quick Approximation to Matrices and Applications

Alan M. Frieze;Ravi Kannan.

Combinatorica **(1999)**

533 Citations

Introduction to random graphs

Alan Frieze;Michał Karoński.

**(2016)**

507 Citations

A general model of web graphs

Colin Cooper;Alan Frieze.

Random Structures and Algorithms **(2003)**

497 Citations

Improved approximation algorithms for MAX k-CUT and MAX BISECTION

Alan M. Frieze;Mark Jerrum.

Algorithmica **(1997)**

491 Citations

Min-wise independent permutations (extended abstract)

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

symposium on the theory of computing **(1998)**

439 Citations

On the complexity of computing the volume of a polyhedron

M. E. Dyer;A. M. Frieze.

SIAM Journal on Computing **(1988)**

390 Citations

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

Contact us

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:

University of Leeds

Tel Aviv University

Brown University

Google (United States)

Microsoft (United States)

Queen Mary University of London

Georgia Institute of Technology

University of Memphis

University of Toronto

London School of Economics and Political Science

Brigham Young University

Uppsala University

New York University Abu Dhabi

Universität Hamburg

Aristotle University of Thessaloniki

Max Planck Society

University of Tokyo

University of Erlangen-Nuremberg

University of California, Davis

Universidad Publica De Navarra

Henry M. Jackson Foundation

Ben-Gurion University of the Negev

Tufts University

Brigham and Women's Hospital

Lancaster University

Aarhus University

Something went wrong. Please try again later.