Boris Pittel
Mathematics · The Ohio State University
Publications
200
Citations
5,114
Est. group size
—
Recurring co-author estimate
Active years
58
Publishing since 1969
Boris Pittel works in probability theory and combinatorics, focusing on the mathematical analysis of random structures such as random trees, random permutations, random matchings, and random graphs. Much of the work develops precise probabilistic estimates and asymptotic formulas describing how these structures behave as they grow large, including applications to stable matching problems (like matching preferences between two groups) and voting theory. This research is theoretical, aimed at proving rigorous mathematical results about randomness in discrete structures.
Publication output has declined somewhat from about 7-8 papers per year a decade ago to roughly 3 per year in recent years, though 2025 shows an uptick.
Generated by claude-sonnet-5 from public bibliographic data · Jul 20, 2026
- Perfect partitions of a random set of integers
Journal of Applied Probability · 2026
- The critical beta-splitting random tree I: Heights and related results
The Annals of Applied Probability · 2025
- On likelihood of a Condorcet winner for uniformly random and independent voter preferences
arXiv (Cornell University) · 2025
- Permutations with restricted cycle lengths
Algebraic Combinatorics · 2025
- On increasing sequences formed by points from a random finite subset of a hypercube
arXiv (Cornell University) · 2025
- Stable matchings with switching costs
arXiv (Cornell University) · 2025
- On constrained matchings, stable under random preferences
arXiv (Cornell University) · 2024
- Counting pairs of cycles whose product is a permutation with restricted cycle lengths
arXiv (Cornell University) · 2024
- Expected Number of Induced Subtrees Shared by Two Independent Copies of a Random Tree
SIAM Journal on Discrete Mathematics · 2023
- Counting subtrees of the branching process tree by the number of leaves
arXiv (Cornell University) · 2023
- Random plane increasing trees: Asymptotic enumeration of vertices by distance from leaves
Random Structures and Algorithms · 2022
- On a random search tree: asymptotic enumeration of vertices by distance from leaves – CORRIGENDUM
Advances in Applied Probability · 2022
- Giant descendant trees, matchings, and independent sets in age-biased attachment graphs
Journal of Applied Probability · 2022
- One-sided version of Gale–Shapley proposal algorithm and its likely behavior under random preferences
Discrete Applied Mathematics · 2021
- Expected number of induced subtrees shared by two independent copies of the terminal tree in a critical branching process
arXiv (Cornell University) · 2021
- arXiv (Cornell University)×24
- Random Structures and Algorithms×4
- Advances in Applied Mathematics×2
- Journal of Combinatorial Theory Series B×2
- Advances in Applied Probability×2
- David Sivakoff
Mathematics · The Ohio State University
- Christopher Janjigian
Mathematics · Purdue University West Lafayette
- Russell Lyons
Mathematics · Indiana University
- Jonathon Peterson
Mathematics · Purdue University West Lafayette
- Otávio Menezes
Mathematics · Purdue University West Lafayette
This profile was generated automatically from public scholarly data (OpenAlex). Group size and activity levels are estimates derived from co-authorship patterns.
Last updated Jul 19, 2026.
Claim or correct this profile