- Home
- Best Scientists - Mathematics
- Boris Pittel

Discipline name
D-index
D-index (Discipline H-index) only includes papers and citation values for an examined
discipline in contrast to General H-index which accounts for publications across all
disciplines.
Citations
Publications
World Ranking
National Ranking

Mathematics
D-index
31
Citations
5,166
119
World Ranking
2532
National Ranking
1062

Engineering and Technology
D-index
31
Citations
5,024
98
World Ranking
7317
National Ranking
2251

- 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.

- 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)

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.

- Combinatorics (94.33%)
- Discrete mathematics (48.23%)
- Random graph (19.86%)

- Combinatorics (94.33%)
- Expected value (11.35%)
- Stable marriage problem (9.22%)

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.

- 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)

- 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.

On spreading a rumor

Boris Pittel.

Siam Journal on Applied Mathematics **(1987)**

562 Citations

The birth of the giant component

Svante Janson;Donald E. Knuth;Tomasz Łuczak;Boris Pittel.

Random Structures and Algorithms **(1993)**

495 Citations

Sudden Emergence of a Giantk-Core in a Random Graph

Boris Pittel;Joel Spencer;Nicholas Wormald.

Journal of Combinatorial Theory, Series B **(1996)**

481 Citations

Note on the heights of random recursive trees and random m ‐ary search trees

Boris Pittel.

Random Structures and Algorithms **(1994)**

254 Citations

Bootstrap percolation on the random regular graph

József Balogh;Boris G. Pittel.

Random Structures and Algorithms **(2007)**

209 Citations

The structure of a random graph at the point of the phase transition

Tomasz Łuczak;Boris Pittel;John C. Wierman.

Transactions of the American Mathematical Society **(1994)**

173 Citations

Paths in a random digital tree: limiting distributions

Boris Pittel.

Advances in Applied Probability **(1986)**

173 Citations

Closed Exponential Networks of Queues with Saturation: The Jackson-Type Stationary Distribution and Its Asymptotic Analysis

B. Pittel.

Mathematics of Operations Research **(1979)**

172 Citations

On tree census and the giant component in sparse random graphs

Boris Pittel.

Random Structures and Algorithms **(1990)**

162 Citations

Maximum matchings in sparse random graphs: Karp-Sipser revisited

Jonathan Aronson;Alan Frieze;Boris G. Pittel.

Random Structures and Algorithms **(1998)**

156 Citations

If you think any of the details on this page are incorrect, let us know.

Contact us

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Monash University

Stanford University

Carnegie Mellon University

University of California, Berkeley

Microsoft (United States)

Adam Mickiewicz University in Poznań

University of Illinois at Urbana-Champaign

London School of Economics and Political Science

Rutgers, The State University of New Jersey

Institut des Hautes Études Scientifiques

French Institute for Research in Computer Science and Automation - INRIA

Publications: 26

Aalto University

University of Hong Kong

Max Planck Society

Universidade de São Paulo

RWTH Aachen University

North Carolina State University

Ruhr University Bochum

University of Liverpool

Memorial Sloan Kettering Cancer Center

Tottori University

University of Lethbridge

University of Queensland

University of Pennsylvania

University of Stirling

University of Colorado Denver

University of Zaragoza

Something went wrong. Please try again later.