scientific article
From MaRDI portal
Publication:2959886
zbMath1355.05239MaRDI QIDQ2959886
Publication date: 10 February 2017
Full work available at URL: http://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/view/dmAI0133
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Trees (05C05) Random graphs (graph-theoretic aspects) (05C80) Interacting random processes; statistical mechanics type models; percolation theory (60K35) Combinatorial probability (60C05) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (14)
Zooming in at the root of the stable tree ⋮ The stable trees are nested ⋮ Occupancy problems related to the generalized Stirling numbers ⋮ Growing random graphs with a preferential attachment structure ⋮ Stable graphs: distributions and line-breaking construction ⋮ A binary embedding of the stable line-breaking construction ⋮ Scaling Limits of Markov-Branching Trees and Applications ⋮ A recursive distributional equation for the stable tree ⋮ Universal limits of substitution-closed permutation classes ⋮ Continuum tree asymptotics of discrete fragmentations and applications to phylogenetic mod\-els ⋮ Scaling limits for some random trees constructed inhomogeneously ⋮ Random-Bit Optimal Uniform Sampling for Rooted Planar Trees with Given Sequence of Degrees and Applications ⋮ Recursive construction of continuum random trees ⋮ Geometry of weighted recursive and affine preferential attachment trees
This page was built for publication:
