The following pages link to On the profile of random trees (Q4345362):
Displaying 40 items.
- Functional limit theorems for the decomposable branching process with two types of particles (Q314181) (← links)
- A Lamperti-type representation of continuous-state branching processes with immigration (Q373588) (← links)
- The shape of random pattern-avoiding permutations (Q401507) (← links)
- The degree profile of random Pólya trees (Q439063) (← links)
- The vertical profile of embedded trees (Q456391) (← links)
- Scale free properties of random \(k\)-trees (Q626908) (← links)
- The shape of unlabeled rooted random trees (Q710724) (← links)
- A functional limit theorem for decomposable branching processes with two particle types (Q722141) (← links)
- The density of the ISE and local limit laws for embedded trees (Q862221) (← links)
- The power of choice in growing trees (Q978747) (← links)
- A functional limit theorem for the profile of \(b\)-ary trees (Q988760) (← links)
- Applications of the theory of records in the study of random trees (Q1110339) (← links)
- Generalized covariances of multi-dimensional Brownian excursion local times. (Q1401308) (← links)
- The depth first processes of Galton-Watson trees converge to the same Brownian excursion (Q1431505) (← links)
- Strata of random mappings---a combinatorial approach (Q1613609) (← links)
- Profile of random exponential binary trees (Q1657805) (← links)
- Reflected Brownian bridge local time conditioned on its local time at the origin (Q1770063) (← links)
- The SDE solved by local times of a Brownian excursion or bridge derived from the height profile of a random tree or forest (Q1807204) (← links)
- Sub-Gaussian tail bounds for the width and height of conditioned Galton-Watson trees (Q1951700) (← links)
- Random real trees (Q2458943) (← links)
- Analytic combinatorics, proof-theoretic ordinals, and phase transitions for independence results (Q2566073) (← links)
- The Gorin-Shkolnikov identity and its random tree generalization (Q2664546) (← links)
- Profile of random exponential recursive trees (Q2671225) (← links)
- Limit theorems for subtree size profiles of increasing trees (Q2888869) (← links)
- Canonical Trees, Compact Prefix-Free Codes, and Sums of Unit Fractions: A Probabilistic Analysis (Q2944462) (← links)
- Branching random walks on binary search trees: convergence of the occupation measure (Q3085582) (← links)
- (Q3307083) (← links)
- On the Local Profiles of Trees (Q3466358) (← links)
- On the shape of the fringe of various types of random trees (Q3634637) (← links)
- Noncrossing trees are almost conditioned Galton–Watson trees (Q4534222) (← links)
- (Q4941949) (← links)
- Random walks with preferential relocations and fading memory: a study through random recursive trees (Q5131512) (← links)
- Analytical results for the in-degree and out-degree distributions of directed random networks that grow by node duplication (Q5132547) (← links)
- Distances between pairs of vertices and vertical profile in conditioned Galton–Watson trees (Q5198661) (← links)
- Shape Measures of Random Increasing <i>k</i>-trees (Q5366914) (← links)
- The distance profile of rooted and unrooted simply generated trees (Q5886326) (← links)
- On breadth‐first constructions of scaling limits of random graphs and random unicellular maps (Q6052477) (← links)
- Analytical results for the distribution of shortest path lengths in directed random networks that grow by node duplication (Q6108693) (← links)
- The GHP scaling limit of uniform spanning trees in high dimensions (Q6202910) (← links)
- Voronoi cells in random split trees (Q6584605) (← links)
