29 citations · 107 across the 37 of their papers we have counts for
48 papers
Counting records in a random, non-uniform, permutation
Boris Pittel
Counting permutations of by the number of records, i.e. left-to-right maxima, is a classic problem in combinatorial enumeration. In the first volume of ``The Art of Computer…
Counting pairs of cycles whose product is a permutation with restricted cycle lengths
Miklos Bona, Boris Pittel
We find exact and asymptotic formulas for the number of pairs of -cycles such that the all cycles of the product have lengths from a given integer set. We the…
On constrained matchings, stable under random preferences
Boris Pittel
Colloquially, there are two groups, men and women, each man (woman) ranking women (men) as potential marriage partners. A complete matching is called stable if no unmatched…
The likely maximum size of twin subtrees in a large random tree
Miklos Bona, Ovidiu Costin, Boris Pittel
We call a pair of vertex-disjoint, induced subtrees of a rooted trees twins if they have the same counts of vertices by out-degrees. The likely maximum size of twins in a uniformly…
Counting subtrees of the branching process tree by the number of leaves
Boris Pittel
We study the distribution of the number of leaves of the subtree chosen uniformly at random among all the subtrees of the critical branching process tree at extinction.
The Critical Beta-splitting Random Tree: Heights and Related Results
David Aldous, Boris Pittel
In the critical beta-splitting model of a random -leaf binary tree, leaf-sets are recursively split into subsets, and a set of leaves is split into subsets containing an…