Boris G. Pittel - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 13 from 13

2023

Random plane increasing trees: Asymptotic enumeration of vertices by distance from leavesMiklós Bóna, Boris G. Pittel. rsa, 63(1):102-129, August 2023. [doi]

Expected Number of Induced Subtrees Shared by Two Independent Copies of a Random TreeBoris G. Pittel. siamdm, 37(1):1-16, March 2023. [doi]

2022

Giant descendant trees, matchings, and independent sets in age-biased attachment graphsHüseyin Acan, Alan M. Frieze, Boris G. Pittel. jap, 59(2):299-324, 2022. [doi]

2021

On sparsity of the solution to a random quadratic optimization problemXin Chen 0026, Boris G. Pittel. mp, 186(1):309-336, 2021. [doi]

On Bollobás-Riordan random pairing model of preferential attachment graphBoris G. Pittel. rsa, 58(4):691-725, 2021. [doi]

One-sided version of Gale-Shapley proposal algorithm and its likely behavior under random preferencesBoris G. Pittel. DAM, 292:1-18, 2021. [doi]

2020

On connectivity, conductance and bootstrap percolation for a random k-out, age-biased graphHüseyin Acan, Boris G. Pittel. rsa, 56(1):37-62, 2020. [doi]

On a perfect matching in a random digraph with average out-degree below twoMichal Karonski, Ed Overman 0001, Boris G. Pittel. jctb, 143:226-258, 2020. [doi]

On random stable matchings: Cyclic ones with strict preferences and two-sided ones with partially ordered preferencesBoris G. Pittel. aam, 120:102061, 2020. [doi]

2017

2)-core in the random digraphBoris G. Pittel, Daniel J. Poole. aam, 86:132-174, 2017. [doi]

2016

On a surface formed by randomly gluing together polygonal discsSergei Chmutov, Boris G. Pittel. aam, 73:23-42, 2016. [doi]

2007

Limit shapes for random square Young tableauxBoris G. Pittel, Dan Romik. aam, 38(2):164-209, 2007. [doi]

2002

On the distribution of the number of Young tableaux for a uniformly random diagramBoris G. Pittel. aam, 29(2):184-214, 2002. [doi]

Sign in or sign up to see more results.

runs on WebDSL