Andrew Odlyzko

Source: Wikipedia, the free encyclopedia.
Andrzej Odłyżko (Andrew Odlyzko)
Poland
Alma materMassachusetts Institute of Technology (Ph.D., Mathematics, 1975)
California Institute of Technology (B.S., M.S., Mathematics) [1]
Known forOdlyzko–Schönhage algorithm
Scientific career
FieldsMathematics
InstitutionsBell Telephone Laboratories, AT&T Bell Labs, AT&T Labs, University of Minnesota
Doctoral advisorHarold Stark

Andrew Michael Odlyzko (Andrzej Odłyżko) (born 23 July 1949) is a

Bell Telephone Laboratories, where he stayed for 26 years before joining the University of Minnesota
in 2001.

Work in mathematics

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.[2]

In the field of mathematics he has published extensively on

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.[3][4]

Work on electronic communication

More recently, he has worked on

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.[5]

In the paper "Content is Not King", published in First Monday in January 2001,[6] he argues that

  1. the
    entertainment industry is a small industry compared with other industries, notably the telecommunications industry
    ;
  2. people are more interested in communication than entertainment;
  3. and therefore that entertainment "content" is not the
    killer app for the Internet
    .

In 2012, he became a fellow of the International Association for Cryptologic Research[7] and in 2013 of the American Mathematical Society.

Network value

In the 2006 paper "Metcalfe's Law is Wrong",

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).[8] Empirical tests, in part stimulated by this criticism, strongly support Metcalfe's law.[9]

Financial History

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.[10][11][12][13]

See also

References

  1. ^ "Profile: Andrew Odlyzko", TLI, University of Minnesota.
  2. ^ Andrew Odlyzko at the Mathematics Genealogy Project
  3. ^ Erdős number project.
  4. ^ Density of Odd Integers.
  5. ^ "The size and growth rate of the Internet," K. G. Coffman and A. M. Odlyzko, First Monday 3(10) (October 1998), http://firstmonday.org/htbin/cgiwrap/bin/ojs/index.php/fm/article/view/620/541 Archived 2012-04-12 at the Wayback Machine
  6. SSRN 235282
    .
  7. ^ "IACR Fellows".
  8. ^ a b "Metcalfe's Law is Wrong". Bob Briscoe, Andrew Odlyzko, and Benjamin Tilly, July 2006 IEEE Spectrum.
  9. S2CID 207288368
    .
  10. ^ An undertaking of great advantage, but nobody to know what it is: Bubbles and gullibility, A. Odlyzko. Financial History, no. 132, Winter 2020, pp. 16-19
  11. S2CID 225558487
    .
  12. .
  13. ^ "Financial History Magazine". Museum of American Finance. Retrieved August 14, 2022.

External links