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.
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.
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.
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
Siam Journal on Applied Mathematics (1987)
The birth of the giant component
Svante Janson;Donald E. Knuth;Tomasz Łuczak;Boris Pittel.
Random Structures and Algorithms (1993)
Sudden Emergence of a Giantk-Core in a Random Graph
Boris Pittel;Joel Spencer;Nicholas Wormald.
Journal of Combinatorial Theory, Series B (1996)
Note on the heights of random recursive trees and random m ‐ary search trees
Random Structures and Algorithms (1994)
Bootstrap percolation on the random regular graph
József Balogh;Boris G. Pittel.
Random Structures and Algorithms (2007)
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)
Paths in a random digital tree: limiting distributions
Advances in Applied Probability (1986)
Closed Exponential Networks of Queues with Saturation: The Jackson-Type Stationary Distribution and Its Asymptotic Analysis
Mathematics of Operations Research (1979)
On tree census and the giant component in sparse random graphs
Random Structures and Algorithms (1990)
Maximum matchings in sparse random graphs: Karp-Sipser revisited
Jonathan Aronson;Alan Frieze;Boris G. Pittel.
Random Structures and Algorithms (1998)
If you think any of the details on this page are incorrect, let us know.
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: