What is he best known for?
The fields of study he is best known for:
- Combinatorics
- Algebra
- Discrete mathematics
Boris Pittel mostly deals with Combinatorics, Discrete mathematics, Random graph, Giant component and Vertex.
His study in the fields of Binary logarithm and Ramanujan's sum under the domain of Combinatorics overlaps with other disciplines such as High probability, Poisson distribution and Probability distribution.
His work deals with themes such as Binary tree and Degree, which intersect with Discrete mathematics.
His Random graph research is multidisciplinary, relying on both Matching, Simple and Constant.
His Giant component research includes elements of Pseudoforest and Domination analysis.
He combines subjects such as Almost surely, Neighbourhood and Path graph with his study of Vertex.
His most cited work include:
- Sudden Emergence of a Giantk-Core in a Random Graph (375 citations)
- On spreading a rumor (366 citations)
- The birth of the giant component (352 citations)
What are the main themes of his work throughout his whole career to date?
Boris Pittel spends much of his time researching Combinatorics, Discrete mathematics, Random graph, Partition and Expected value.
Boris Pittel integrates many fields in his works, including Combinatorics and Random regular graph.
Many of his research projects under Discrete mathematics are closely connected to Joint probability distribution with Joint probability distribution, tying the diverse disciplines of science together.
His research integrates issues of Connected component and Vertex in his study of Random graph.
His Vertex research focuses on Almost surely and how it connects with Digraph.
He interconnects Asymptotic formula, Order and Chordal graph in the investigation of issues within Degree.
He most often published in these fields:
- Combinatorics (94.33%)
- Discrete mathematics (48.23%)
- Random graph (19.86%)
What were the highlights of his more recent work (between 2016-2021)?
- Combinatorics (94.33%)
- Expected value (11.35%)
- Stable marriage problem (9.22%)
In recent papers he was focusing on the following fields of study:
His primary scientific interests are in Combinatorics, Expected value, Stable marriage problem, Vertex and Bipartite graph.
His biological study spans a wide range of topics, including Matching and Distribution.
His study focuses on the intersection of Stable marriage problem and fields such as Preference list with connections in the field of Permutation and Algorithm.
His Vertex study necessitates a more in-depth grasp of Graph.
His Partition research is multidisciplinary, incorporating elements of Partially ordered set and Simple graph.
His Random graph research is multidisciplinary, incorporating perspectives in Conductance and Vertex.
Between 2016 and 2021, his most popular works were:
- On Likely Solutions of the Stable Matching Problem with Unequal Numbers of Men and Women (15 citations)
- On random stable partitions (9 citations)
- Asymptotic joint distribution of the extremities of a random Young diagram and enumeration of graphical partitions (9 citations)
In his most recent research, the most cited papers focused on:
- Combinatorics
- Algebra
- Discrete mathematics
His scientific interests lie mostly in Combinatorics, Vertex, Stable marriage problem, Almost surely and Partition.
His Combinatorics study incorporates themes from Discrete mathematics and Exponential function.
Boris Pittel has included themes like Recursive tree and Graph in his Exponential function study.
His work on Stable roommates problem as part of his general Stable marriage problem study is frequently connected to Standard deviation and Limiting, thereby bridging the divide between different branches of science.
The Almost surely study combines topics in areas such as Matching, Giant component, Binary logarithm and Bipartite graph.
His Partition research incorporates themes from Simple graph and Enumeration.
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.
