On the public citation graph

Properties of Random Triangulations and Trees

https://doi.org/10.1007/pl00009444
0 signed · 36 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-1-4613-8643-8openalex-snapshot
Non-Uniform Random Variate Generation
inferredcites →https://doi.org/10.1007/bf02915448openalex-snapshot
Applications of the theory of records in the study of random trees
inferredcites →https://doi.org/10.1016/0012-365x(94)00331-copenalex-snapshot
Ears of triangulations and Catalan numbers
inferredcites →https://doi.org/10.1016/0020-0190(92)90075-7openalex-snapshot
Generating binary trees at random
inferredcites →https://doi.org/10.1016/0022-0000(82)90004-6openalex-snapshot
The average height of binary trees and other simple trees
inferredcites →https://doi.org/10.1016/0022-247x(84)90141-0openalex-snapshot
On growing random binary trees
inferredcites →https://doi.org/10.1016/0166-218x(89)90003-6openalex-snapshot
Patterns in trees
inferredcites →https://doi.org/10.1090/s0894-0347-1988-0928904-4openalex-snapshot
Rotation distance, triangulations, and hyperbolic geometry
inferredcites →https://doi.org/10.1145/12130.12143openalex-snapshot
Rotation distance, triangulations, and hyperbolic geometry
inferredcites →https://doi.org/10.1145/237218.237409openalex-snapshot
The graph of triangulations of a convex polygon
inferredcites →https://doi.org/10.1145/5925.5930openalex-snapshot
A note on the height of binary search trees
inferredcites →https://doi.org/10.1201/9780429246593openalex-snapshot
An Introduction to the Bootstrap
inferredcites →https://doi.org/10.2307/1990951openalex-snapshot
Rotation Distance, Triangulations, and Hyperbolic Geometry
inferredcites →https://doi.org/10.4153/cjm-1978-085-0openalex-snapshot
On the Altitude of Nodes in Random Trees

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/rsa.20481openalex-snapshot
Random non‐crossing plane configurations: A conditioned Galton‐Watson tree approach
inferred← citeshttps://doi.org/10.1002/rsa.20554openalex-snapshot
The CRT is the scaling limit of random dissections
inferred← citeshttps://doi.org/10.1006/jcta.1999.3006openalex-snapshot
The Distribution of the Maximum Vertex Degree in Random Planar Maps
inferred← citeshttps://doi.org/10.1006/jctb.1998.1870openalex-snapshot
A Pattern of Asymptotic Vertex Valency Distributions in Planar Maps
inferred← citeshttps://doi.org/10.1007/11533719_48openalex-snapshot
Randomly Generating Triangulations of a Simple Polygon
inferred← citeshttps://doi.org/10.1007/978-3-662-04166-6_65openalex-snapshot
New Statistics on Non-crossing Trees
inferred← citeshttps://doi.org/10.1007/s00493-003-0028-xopenalex-snapshot
Sharp Concentration of the Number of Submaps in Random Planar Triangulations
inferred← citeshttps://doi.org/10.1016/j.aam.2013.12.004openalex-snapshot
The shape of random pattern-avoiding permutations
inferred← citeshttps://doi.org/10.1016/j.disc.2014.03.016openalex-snapshot
Extremal statistics on non-crossing configurations
inferred← citeshttps://doi.org/10.1016/s0012-365x(01)00280-1openalex-snapshot
On centroid branches of trees from certain families
inferred← citeshttps://doi.org/10.1017/s0963548305007303openalex-snapshot
Generating Outerplanar Graphs Uniformly at Random
inferred← citeshttps://doi.org/10.1017/s0963548317000050openalex-snapshot
Simply Generated Non-Crossing Partitions
inferred← citeshttps://doi.org/10.1051/proc/201444007openalex-snapshot
Dissecting the circle, at random
inferred← citeshttps://doi.org/10.1214/10-aop608openalex-snapshot
Random recursive triangulations of the disk via fragmentation theory
inferred← citeshttps://doi.org/10.1214/16-ejp4559openalex-snapshot
Triangulating stable laminations
inferred← citeshttps://doi.org/10.21533/scjournal.v2i2.26openalex-snapshot
JAVA Implementation for Triangulation of Convex Polygon Based on Lukasiewicz’s Algorithm and Binary Trees
inferred← citeshttps://doi.org/10.30757/alea.v14-29openalex-snapshot
A study of large fringe and non-fringe subtrees in conditional Galton-Watson trees
inferred← citeshttps://doi.org/10.3390/sym15081526openalex-snapshot
Convex Polygon Triangulation Based on Symmetry
inferred← citeshttps://doi.org/10.4310/joc.2021.v12.n3.a2openalex-snapshot
On typical triangulations of a convex $n$-gon
inferred← citeshttps://doi.org/10.46298/dmtcs.3069openalex-snapshot
Extremal Statistics on Non-Crossing Configurations
inferred← citeshttps://doi.org/10.46298/dmtcs.3552openalex-snapshot
Properties of Random Graphs via Boltzmann Samplers
inferred← citeshttps://doi.org/10.48550/arxiv.1803.03945openalex-snapshot
Exact uniform sampling over catalan structures
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.