What is he best known for?
The fields of study he is best known for:
- Combinatorics
- Discrete mathematics
- Algebra
The scientist’s investigation covers issues in Combinatorics, Discrete mathematics, Random graph, Random regular graph and Vertex.
His Combinatorics study incorporates themes from Simple, Upper and lower bounds and Exponential function.
Discrete mathematics is often connected to Partition in his work.
His work carried out in the field of Random regular graph brings together such families of science as Quartic graph, Path graph, Graph center, Wheel graph and Complement graph.
His Discrepancy theory research is multidisciplinary, incorporating elements of Mathematical proof, Mathematical economics, Mathematical optimization, Family of sets and Randomness.
In his research on the topic of Randomness, Probabilistic method is strongly related with Lovász local lemma.
His most cited work include:
- The Probabilistic Method (4726 citations)
- The degree sequence of a scale-free random graph process (707 citations)
- Probabilistic Methods in Combinatorics (492 citations)
What are the main themes of his work throughout his whole career to date?
His primary areas of study are Combinatorics, Discrete mathematics, Random graph, Graph and Random walk.
His Combinatorics study frequently draws connections between related disciplines such as Expected value.
Joel Spencer combines Expected value and Router in his research.
Joel Spencer performs multidisciplinary study in Router and Vertex in his work.
His biological study spans a wide range of topics, including Almost surely and Upper and lower bounds.
His Random graph study frequently links to other fields, such as Probabilistic method.
He most often published in these fields:
- Combinatorics (66.67%)
- Discrete mathematics (48.48%)
- Random graph (18.86%)
What were the highlights of his more recent work (between 2009-2020)?
- Combinatorics (66.67%)
- Discrete mathematics (48.48%)
- Random graph (18.86%)
In recent papers he was focusing on the following fields of study:
His scientific interests lie mostly in Combinatorics, Discrete mathematics, Random graph, Random walk and Giant component.
His study in Combinatorics focuses on Graph in particular.
His Discrete mathematics research is multidisciplinary, incorporating perspectives in Function, Tree and Minification.
His Random graph research includes elements of Spectral line, Mathematical problem and Connected component.
His Random walk course of study focuses on Mathematical analysis and Scaling and Calculus.
His Giant component research is multidisciplinary, relying on both Graph, Geometric graph theory, Renormalization group, Astronomy and Null graph.
Between 2009 and 2020, his most popular works were:
- Finite Model Theory and Its Applications (134 citations)
- Finite model theory and its applications. Texts in Theoretical Computer Science (35 citations)
- The giant component: The golden anniversary (28 citations)
In his most recent research, the most cited papers focused on:
- Combinatorics
- Algebra
- Real number
Joel Spencer spends much of his time researching Combinatorics, Discrete mathematics, Giant component, Random walk and Random graph.
The various areas that Joel Spencer examines in his Combinatorics study include Lambda, Queueing theory and Duality.
His Discrete mathematics research includes themes of Standard deviation, Semidefinite programming, Expected value, Theory of computation and Entropy.
Joel Spencer has included themes like Random minimum spanning tree, Complete graph, Edge and Minimum spanning tree in his Expected value study.
Joel Spencer has researched Giant component in several fields, including Graph, Renormalization group and Astronomy.
His Random graph research incorporates themes from Artificial neural network, Net, Attractor, Exponential function and Function.
This overview was generated by a machine learning system which analysed the scientist’s
body of work. If you have any feedback, you can
contact us
here.
