Live briefing
Everything about Edgar Gilbert
American mathematician (1923–2013)
Edgar Nelson Gilbert was an American mathematician and coding theorist, a longtime researcher at Bell Laboratories. His accomplishments include the Gilbert–Varshamov bound in coding theory, the Gilbert–Elliott model of bursty errors in signal transmission, the Erdős–Rényi–Gilbert model for random graphs, the Gilbert disk model of random geometric graphs, the Gilbert–Shannon–Reeds model of card shuffling, Gilbert tessellations, and the formulation of the Gilbert–Pollak conjecture on the Steiner ratio. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Edgar GilbertA 5-minute orientation
- Pick up a classic book: The Man Who Was ThursdayThe most-reprinted book on the subject
- Read the landmark paper: The Audubon Illustrated Handbook of American Birds Edgar M. Reilly, Jr. Olin Sewall Pettingill, Jr. Albert Earl GilbertCited 0 times
- Go sideways: Random graphA closely related topic
- Go sideways: Erdős–Rényi modelA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
đź“š Books worth reading
The Man Who Was ThursdayGilbert Keith Chesterton · 1908
The Innocence of Father Brown (Father Brown Mystery)Gilbert Keith Chesterton · 1583
The Man Who Knew Too MuchGilbert Keith Chesterton · 1922
OrthodoxyGilbert Keith Chesterton · 1874
HereticsGilbert Keith Chesterton · 1905
Saint Francis of AssisiGilbert Keith Chesterton · 1923
The Club of Queer TradesGilbert Keith Chesterton · 1900
Eugenics and Other EvilsGilbert Keith Chesterton · 1922
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- Random graph In mathematics, random graph is the general term to refer to probability distributions over graphs. Random graphs may be described simply by a probability…
- Erdős–Rényi model In the mathematical field of graph theory, the Erdős–Rényi models are two closely related models for generating random graphs and the evolution of a random…
- Giant component In network theory, a giant component is a connected component of a given random graph that contains a significant fraction of the entire graph's vertices…
- Percolation theory In statistical physics and mathematics, percolation theory describes the behavior of a network when nodes or links are added. This is a geometric type…
- Spatial network A spatial network (sometimes also geometric graph) is a graph in which the vertices or edges are spatial elements associated with geometric objects, i…
- The Strange Logic of Random Graphs The Strange Logic of Random Graphs is a book on zero-one laws for random graphs. It was written by Joel Spencer and published in 2001 by Springer-Verlag…
- Gilbert–Varshamov bound for linear codes The Gilbert–Varshamov bound for linear codes is related to the general Gilbert–Varshamov bound, which gives a lower bound on the maximal number of elements…
- Graph theory In mathematics and computer science, graph theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects…