Pages that link to "Item:Q1658748"
From MaRDI portal
The following pages link to Random enriched trees with applications to random graphs (Q1658748):
Displaying 13 items.
- A decorated tree approach to random permutations in substitution-closed classes (Q782811) (← links)
- Rerooting multi-type branching trees: the infinite spine case (Q2135184) (← links)
- Limits of random tree-like discrete structures (Q2192232) (← links)
- Asymptotic properties of random unlabelled block-weighted graphs (Q2665972) (← links)
- Simply Generated Unrooted Plane Trees (Q4626549) (← links)
- Graph limits of random unlabelled <i>k</i>-trees (Q4987257) (← links)
- Speeding up non-Markovian first-passage percolation with a few extra edges (Q5215028) (← links)
- Graph limits of random graphs from a subset of connected <i>k</i>‐trees (Q5236927) (← links)
- A branching process approach to level‐<i>k</i> phylogenetic networks (Q6052469) (← links)
- Exact-Size Sampling of Enriched Trees in Linear Time (Q6057780) (← links)
- Graphon convergence of random cographs (Q6074665) (← links)
- Scaling Limits of Markov-Branching Trees and Applications (Q6173302) (← links)
- Decorated stable trees (Q6177566) (← links)