Building uniformly random subtrees
From MaRDI portal
Publication:4739579
DOI10.1002/rsa.20011zbMath1050.60007OpenAlexW4243651582MaRDI QIDQ4739579
Peter M. Winkler, Malwina J. Luczak
Publication date: 6 August 2004
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.20011
Related Items (14)
Random infinite squarings of rectangles ⋮ Stochastic ordering of infinite geometric Galton-Watson trees ⋮ Growing uniform planar maps face by face ⋮ Limits of random tree-like discrete structures ⋮ The Foata-Fuchs proof of Cayley's formula, and its probabilistic uses ⋮ Models of random subtrees of a graph ⋮ Comparing Graphs of Different Sizes ⋮ Order-invariant measures on causal sets ⋮ Growth of the Number of Spanning Trees of the Erdős–Rényi Giant Component ⋮ Parking on a random rooted plane tree ⋮ The Evolution of the Cover Time ⋮ On the silhouette of binary search trees ⋮ Parking on a Random Tree ⋮ A non-increasing tree growth process for recursive trees and applications
Cites Work
This page was built for publication: Building uniformly random subtrees
