# Alan M. Frieze

Template:EngvarB {{ safesubst:#invoke:Unsubst||$N=Use dmy dates |date=__DATE__ |$B= }} Alan M. Frieze (born 25 October 1945 in London, England) is a professor in the Department of Mathematical Sciences at Carnegie Mellon University, Pittsburgh, United States. He graduated from the University of Oxford in 1966, and obtained his PhD from the University of London in 1975. His research interests lie in combinatorics, discrete optimisation and theoretical computer science. Currently, he focuses on the probabilistic aspects of these areas; in particular, the study of the asymptotic properties of random graphs, the average case analysis of algorithms, and randomised algorithms. His recent work has included approximate counting and volume computation via random walks; finding edge disjoint paths in expander graphs, and exploring anti-Ramsey theory and the stability of routing algorithms.

## Key contributions

Two key contributions made by Alan Frieze are:

(1) polynomial time algorithm for approximating the volume of convex bodies

(2) algorithmic version for Szemerédi regularity lemma

Both these algorithms will be described briefly here.

### Polynomial time algorithm for approximating the volume of convex bodies

The paper [1] is a joint work by Martin Dyer, Alan Frieze and Ravindran Kannan.

The main result of the paper is a randomised algorithm for finding an ${\displaystyle \epsilon }$ approximation to the volume of a convex body ${\displaystyle K}$ in ${\displaystyle n}$-dimensional Euclidean space by assume the existence of a membership oracle. The algorithm takes time bounded by a polynomial in ${\displaystyle n}$, the dimension of ${\displaystyle K}$ and ${\displaystyle 1/\epsilon }$.

The algorithm is a sophisticated usage of the so-called Markov Chain Monte Carlo (MCMC) method. The basic scheme of the algorithm is a nearly uniform sampling from within ${\displaystyle K}$ by placing a grid consisting n-dimensional cubes and doing a random walk over these cubes. By using the theory of rapidly mixing Markov chains, they show that it takes a polynomial time for the random walk to settle down to being a nearly uniform distribution.

### Algorithmic version for Szemerédi regularity partition

This paper [2] is a combined work by Alan Frieze and Ravindran Kannan. They use two lemmas to derive the algorithmic version of the Szemerédi regularity lemma to find an ${\displaystyle \epsilon }$-regular partition.

Lemma 1:
Fix k and ${\displaystyle \gamma }$ and let ${\displaystyle G=(V,E)}$ be a graph with ${\displaystyle n}$ vertices. Let ${\displaystyle P}$ be an equitable partition of ${\displaystyle V}$ in classes ${\displaystyle V_{0},V_{1},\ldots ,V_{k}}$. Assume ${\displaystyle |V_{1}|>4^{2k}}$ and ${\displaystyle 4^{k}>600\gamma ^{2}}$. Given proofs that more than ${\displaystyle \gamma k^{2}}$ pairs ${\displaystyle (V_{r},V_{s})}$ are not ${\displaystyle \gamma }$-regular, it is possible to find in O(n) time an equitable partition ${\displaystyle P'}$ (which is a refinement of ${\displaystyle P}$) into ${\displaystyle 1+k4^{k}}$ classes, with an exceptional class of cardinality at most ${\displaystyle |V_{0}|+n/4^{k}}$ and such that ${\displaystyle \operatorname {ind} (P')\geq \operatorname {ind} (P)+\gamma ^{5}/20}$

These two lemmas are combined in the following algorithmic construction of the Szemerédi regularity lemma.