Erdős number

The Erdős number (IPA2|ɛrdøːʃ), honoring the late Hungarian mathematician Paul Erdős, is a way of describing the "collaborative distance" between a person and Erdős, as measured by authorship of mathematical papers.

It was created by friends as a humorous tribute to the enormous output of Erdős, one of the most prolific modern writers of mathematical papers, and has become well-known in scientific circles as a tongue-in-cheek measurement of mathematical prominence.

Definition

In order to be assigned an Erdős number, an author must co-write a mathematical paper with an author with a finite Erdős number. Paul Erdős is the one person having an Erdős number of zero. If the lowest Erdős number of a coauthor is "k", then the author's Erdős number is "k" + 1.

Erdős wrote around 1,500 mathematical articles in his lifetime, mostly co-written. He had 511 direct collaborators [ [http://www.oakland.edu/enp/Erdos0 Erdős Number Project] ] ; these are the people with Erdős number 1. The people who have collaborated with them (but not with Erdős himself) have an Erdős number of 2 (8,162 people as of 2007), those who have collaborated with people who have an Erdős number of 2 (but not with Erdős or anyone with an Erdős number of 1) have an Erdős number of 3, and so forth. A person with no such coauthorship chain connecting to Erdős has no Erdős number (or an undefined one).

There is room for ambiguity over what constitutes a link between two authors; the Erdős Number Project Web site says "Our criterion for inclusion of an edge between vertices u and v is some research collaboration between them resulting in a published work. Any number of additional co-authors is permitted," but they do not include non-research publications such as elementary textbooks, joint editorships, obituaries, and the like. The “Erdős number of the second kind” restricts assignment of Erdős numbers to papers with only two collaborators. [Grossman "et al." “Erdös numbers of the second kind,” in " Facts about Erdös Numbers and the Collaboration Graph". Erdös Number Project, [http://www.oakland.edu/enp/trivia.html#en2k] , retrieved January 9, 2008.]

The Erdős number was most likely first defined in print by Casper Goffman, an analyst whose own Erdős number is 1. [ [http://www.math.purdue.edu/about/purview/fall96/paul-erdos.html Erdős' obituary by Michael Golomb's] ] Goffman published his observations about Erdős's prolific collaboration in a 1969 article entitled "And what is your Erdős number?" [cite journal|author=Goffman, Casper|title=And what is your Erdős number?|journal=American Mathematical Monthly|volume=76|year=1969|doi=10.2307/2317868|pages=791]

The AMS collaboration distance calculator allows an online calculation of an individual's Erdős number.

Impact

Erdős numbers have been a part of the folklore of mathematicians throughout the world for many years. Amongst all working mathematicians at the turn of the millennium who have a finite Erdős number, the numbers range up to 15, the median is 5, the average Erdős number is 4.65; [ [http://www.oakland.edu/enp/ Erdős Number Project] ] and almost everyone with a finite Erdős number has a number less than 8. Due to the very high frequency of interdisciplinary collaboration in science today, very large numbers of non-mathematicians in many other fields of science also have finite Erdős numbers. For example, political scientist Steven Brams has an Erdős number 2. In biomedical research, it is common for statisticians to be among the authors of publications,and many statisticians can be linked via John Tukey, who has Erdős number 2, to Erdős. Similarly, the prominent geneticist Eric Lander and the mathematician Daniel Kleitman have collaborated on papers, [ [http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?db=pubmed&cmd=search&term=lander+kleitman A dictionary-based approach for gene annotation. [J Comput Biol. 1999 Fall-Winter - PubMed Result ] ] [ [http://www-math.mit.edu/~djk/list.html Prof. Daniel Kleitman's Publications Since 1980 more or less] ] and since Kleitman has an Erdős number of 1, [cite journal | last = Erdős | first = Paul | authorlink = Paul Erdős | coauthors = Daniel Kleitman | title = On Collections of Subsets Containing No 4-Member Boolean Algebra | journal = Proceedings of the American Mathematical Society | volume = 28 | issue = 1 | pages = 87–90 |date=April 1971 | doi = 10.2307/2037762] a large fraction of the genetics and genomics community can be linked via Lander and his numerous collaborators. According to Alex Lopez-Ortiz, all the
Fields and Nevanlinna prize winners during the three cycles in 1986 to 1994 have Erdős number at most 9. Similarly, many linguists have finite Erdős numbers, many due to chains of collaboration with Noam Chomsky, whose number is 4. [ [http://semantics-online.org/2004/01/my-erds-number-is-8 My Erdös Number is 8 < Semantics etc ] ]

Tompa [cite journal|author=Tompa, Martin|title=Figures of merit|journal=ACM SIGACT News|volume=20|issue=1|pages=62–71|year=1989|doi=10.1145/65780.65782 cite journal|author=Tompa, Martin|title=Figures of merit: the sequel|journal=ACM SIGACT News|volume=21|issue=4|pages=78–81|year=1990|doi=10.1145/101371.101376] proposed a directed graph version of the Erdős number problem, by orienting edges of the collaboration graph from the alphabetically earlier author to the alphabetically later author and defining the "monotone Erdős number" of an author to be the length of a "longest" path from Erdős to the author in this directed graph. He finds a path of this type of length 12.

Also, Michael Barr suggests "rational Erdős numbers", generalizing the idea that a person who has written p joint papers with Erdős should be assigned Erdős number 1/p. From the collaboration multigraph of the second kind (although he also has a way to deal with the case of the first kind) — with one edge between two mathematicians for "each" joint paper they have produced — form an electrical network with a one-ohm resistor on each edge. The total resistance between two nodes tells how "close" these two nodes are.

Earlier mathematicians published fewer papers than modern ones, and more rarely published jointly-written papers. The earliest person known to have a finite positive Erdős number is either Richard Dedekind (born 1831, Erdős number 7) or Georg Frobenius (born 1849, Erdős number 3), depending on the standard of publication eligibility [ [http://www.oakland.edu/enp/erdpaths.html Erdős Number Project - Paths to Erdős] ] . It seems that older historic figures such as Leonhard Euler do not have finite Erdős numbers.

Effect of Erdős' death on the Erdős number

Given that Erdős died in 1996 and no works of his remain to be published, it is no longer possible for a person to be newly assigned an Erdős number of 1. Likewise, once everyone with an Erdős number of 1 has died and have no work remaining to be published, it will be impossible for a new person to obtain an Erdős number of 2, and so on.

Outside mathematics

Bacon number

The Bacon number (as in the game Six Degrees of Kevin Bacon) is an application of the same idea to the movie industry, connecting actors that appeared in a film together to the actor Kevin Bacon.

A small number of people are connected to both Erdős and Bacon and thus have an Erdős-Bacon number. One example is the actress Danica McKellar, best known for playing Winnie Cooper on the TV series, "The Wonder Years". Her Erdős number is 4 and her Bacon number is 2. The lowest known
Erdős-Bacon number is three for Daniel Kleitman, a mathematics professor at MIT; his Erdős number is 1 and his Bacon number is 2.

Kibo number

The surrealist Usenet personality Kibo has had a similar number applied to people in contact with him. A Kibo number of one is defined as someone who has at minimum received e-mail from Kibo. Mail from someone with a Kibo number will make the recipient's number the sender's Kibo number plus one. [cite book
url=http://books.google.com/books?id=71jirhtZCCUC
title=Advanced Learner's Dictionary of Computers
publisher=Anmol Publications
isbn=8126104740
]

tringfield number

The Stringfield number is an application of the same idea to the field of Ufology, connecting those who co-investigated or co-researched UFO cases with the late Leonard H. Stringfield. [ [http://www.anomalyresponse.org/stringfieldnumber.php Stringfield Number Project] ]

eBay auctions

On April 20, 2004, [http://williamtozier.com/slurry Bill Tozier] , a researcher with an Erdős number of 4, offered the chance for collaboration to attain an Erdős number of 5 in an auction on eBay. The final bid was $1,031, though apparently the winning bidder had no intention to pay. [ [http://www.zephoria.org/thoughts/archives/2004/04/21/decrease_your_erdos_number.html Decrease Your Erdős Number] ] The winner (who already had an Erdős number of 3) considered it a "mockery", and said "papers have to be worked and earned, not sold, auctioned or bought".

Another eBay auction offered an Erdős number of 2 for a prospective paper to be submitted for publication to "Chance" (a magazine of the American Statistical Association) about skill in the World Series of Poker and the World Poker Tour. It closed on 22 July 2004 with a winning bid of $127.40. This is noteworthy because with the exception of a few co-written articles to be published posthumously, 2 is the lowest number that can now be achieved.

Cultural anecdotes

It is jokingly said that the famous American baseball player Hank Aaron has an Erdős number of 1 because he autographed a baseball with Erdős when Emory University awarded them both honorary degrees on the same day.

As of June 2007, the University of Memphis mathematical sciences faculty has the most faculty members with Erdős number 1 of any mathematics department. The Erdős-1 mathematicians are Béla Bollobás, Ralph Faudree, Jeno Lehel, Cecil C. Rousseau, and Richard Schelp. Three of these faculty members are among the top ten most frequent co-authors with Erdős. [http://www.oakland.edu/enp/Erdos0] [http://www.msci.memphis.edu/faculty.html]

ee also


* List of people by Erdős number
* Shusaku number
* Hirsch number
* Six degrees of separation
* Small-world network
* Small world phenomenon

References

Further reading

*cite journal | author = Goffman, Casper | title = And What Is Your Erdös Number? | journal = American Mathematical Monthly | volume = 76 | issue = 7 | year = 1969 | pages = 791 | doi = 10.2307/2317868
*cite journal | title = Famous Trails to Paul Erdős | author = De Castro, Rodrigo; Grossman, Jerrold W. | journal = The Mathematical Intelligencer | volume = 21 | issue = 3 | year = 1999 | pages = 51–63 | url = http://www.oakland.edu/enp/trails.ps | id = MathSciNet | id = 1709679 Original Spanish version in "Rev. Acad. Colombiana Cienc. Exact. Fís. Natur." 23 (89) 563–582, 1999, MathSciNet | id = 1744115.

External links

* Jerry Grossman, [http://www.oakland.edu/enp The Erdös Number Project] . Contains statistics and a complete list of all mathematicians with an Erdős number less than or equal to 2.
* [http://www.oakland.edu/enp/collab.pdf "On a Portion of the Well-Known Collaboration Graph"] , Jerrold W. Grossman and Patrick D. F. Ion.
* [http://vlado.fmf.uni-lj.si/pub/networks/doc/erdos/erdos.pdf "Some Analyses of Erdős Collaboration Graph"] , Vladimir Batagelj and Andrej Mrvar.
* American Mathematical Society, [http://www.ams.org/mathscinet/collaborationDistance.html MR Collaboration Distance] . A search engine for Erdős numbers and collaboration distance between other authors. Special access required.
* [http://www.sciencenews.org/articles/20040612/bob8.asp "Theorems for Sale"] (From Science News, Vol. 165, No. 24, June 12, 2004)


Wikimedia Foundation. 2010.

Look at other dictionaries:

  • Erdős number — noun A number describing the degree of collaboration between a mathematician and Paul Erdős, defined such that a mathematician who has written a paper with Erdős has an Erdős number of 1, a mathematician who has written a paper with somebody… …   Wiktionary

  • List of people by Erdős number — Paul Erdős was one of the most prolific writers of mathematical papers. He collaborated a great deal, having 511 joint authors, a number of whom also have many collaborators. The Erdős number measures the collaborative distance between an author… …   Wikipedia

  • Erdős–Bacon number — A person s Erdős–Bacon number is the sum of one s Erdős number mdash;which measures the collaborative distance in authoring mathematical papers between that individual and Hungarian mathematician Paul Erdős mdash;and one s Bacon number… …   Wikipedia

  • Erdos, Paul — ▪ 1997       Hungarian mathematician (b. March 26, 1913, Budapest, Hung. d. Sept. 20, 1996, Warsaw, Pol.), pioneered the fields of number theory and combinatorics and was regarded as one of the century s greatest mathematicians. At the age of 20… …   Universalium

  • Erdős-Zahl — Alice kollaboriert mit Erdős und erhält so die Erdős Zahl 1. Wenn Bob nie mit Erdős, aber mit Alice kollaboriert hat, dann erhält er die Erdős Zahl 2. Die Erdős Zahl beschreibt die Distanz im Graphen der Koautorenschaft bezogen auf den… …   Deutsch Wikipedia

  • Erdos-Zahl — Die Erdős Zahl beschreibt die Distanz im Graphen der Koautorenschaft bezogen auf den Mathematiker Paul Erdős. Im Graphen werden die publizistisch verwandten Autoren als Knoten repräsentiert, zwischen denen jeweils dann eine Kante existiert, wenn… …   Deutsch Wikipedia

  • Erdös-Zahl — Die Erdős Zahl beschreibt die Distanz im Graphen der Koautorenschaft bezogen auf den Mathematiker Paul Erdős. Im Graphen werden die publizistisch verwandten Autoren als Knoten repräsentiert, zwischen denen jeweils dann eine Kante existiert, wenn… …   Deutsch Wikipedia

  • Erdos — Paul Erdős Paul Erdős, 1992 Paul Erdős (Erdős Pál …   Wikipédia en Français

  • Erdös — Paul Erdős Paul Erdős, 1992 Paul Erdős (Erdős Pál …   Wikipédia en Français

  • Erdős conjecture on arithmetic progressions — Erdős conjecture on arithmetic progressions, often incorrectly referred to as the Erdős–Turán conjecture, is a conjecture in additive combinatorics due to Paul Erdős. It states that if the sum of the reciprocals of the members of a set A of… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”