| Andrzej Odłyżko (Andrew Odlyzko) | |
| Birth Place: | Tarnów, Poland |
| Fields: | Mathematics |
| Workplaces: | Bell Telephone Laboratories, AT&T Bell Labs, AT&T Labs, University of Minnesota |
| Alma Mater: | Massachusetts Institute of Technology (Ph.D., Mathematics, 1975) California Institute of Technology (B.S., M.S., Mathematics) [1] |
| Doctoral Advisor: | Harold Stark |
| Known For: | Odlyzko–Schönhage algorithm |
Andrew Michael Odlyzko (Andrzej Odłyżko) (born 23 July 1949) is a Polish-American mathematician and a former head of the University of Minnesota's Digital Technology Center and of the Minnesota Supercomputing Institute. He began his career in 1975 at Bell Telephone Laboratories, where he stayed for 26 years before joining the University of Minnesota in 2001.
Odlyzko received his B.S. and M.S. in mathematics from the California Institute of Technology and his Ph.D. from the Massachusetts Institute of Technology in 1975.
In the field of mathematics he has published extensively on analytic number theory, computational number theory, cryptography, algorithms and computational complexity, combinatorics, probability, and error-correcting codes. In the early 1970s, he was a co-author (with D. Kahaner and Gian-Carlo Rota) of one of the founding papers of the modern umbral calculus. In 1985 he and Herman te Riele disproved the Mertens conjecture. In mathematics, he is probably known best for his work on the Riemann zeta function, which led to the invention of improved algorithms, including the Odlyzko–Schönhage algorithm, and large-scale computations, which stimulated extensive research on connections between the zeta function and random matrix theory.
As a direct collaborator of Paul Erdős, he has Erdős number 1.[2] [3]
More recently, he has worked on communication networks, electronic publishing, economics of security and electronic commerce.
In 1998, he and Kerry Coffman were the first to show that one of the great inspirations for the Internet bubble, the myth of "Internet traffic doubling every 100 days," was false.[4]
In the paper "Content is Not King", published in First Monday in January 2001,[5] he argues that
In 2012, he became a fellow of the International Association for Cryptologic Research[6] and in 2013 of the American Mathematical Society.
In the 2006 paper "Metcalfe's Law is Wrong",[7] Andrew Odlyzko and coauthors argue that the incremental value of adding one person to a network of n people is approximately the nth harmonic number, so the total value of the network is approximately n * log(n). Since this curves upward (unlike Sarnoff's law), it implies that Metcalfe's conclusion – that there is a critical mass in networks, leading to a network effect – is qualitatively correct. But since this linearithmic function does not grow as rapidly as Metcalfe's law, it implies that many of the quantitative expectations based on Metcalfe's law were excessively optimistic.
For example, by Metcalfe, if a hypothetical network of 100,000 members has a value of $1M, doubling its membership would increase its value fourfold (200,0002/100,0002). However Odlyzko predicts its value would only slightly more than double: 200,000*log(200,000)/(100,000*log(100,000). Empirical tests, in part stimulated by this criticism, strongly support Metcalfe's law.[8]
In recent years, Odlyzko has published multiple papers on the financial history of bubbles, particularly the South Sea Bubble and the English Railway Mania of the eighteenth and nineteenth centuries, respectively.[9] [10] [11] [12]