We use a few cookies

Essential cookies keep the library working. With your permission, we'd also like to use analytics to see what's useful and improve the experience. Read our Privacy Policy or Cookie Policy.

Skip to main content
Home/e-Resources/Computer Science & Information Technology/A note on the fragmentation of a stable tree
PeriodicalsComputer Science & Information Technology

A note on the fragmentation of a stable tree

Checking your access to this record.

Abstract & Overview

We introduce a recursive algorithm generating random trees, which we identify as skeletons of a continuous, stable tree. We deduce a representation of a fragmentation process on these trees.

Cite this record

Philippe Marchal (2008). A note on the fragmentation of a stable tree. Discrete Mathematics & Theoretical Computer Science, DMTCS Proceedings vol. AI,...(Proceedings). https://doi.org/10.46298/dmtcs.3586

Copy in another style

Marchal, P. (2008). A note on the fragmentation of a stable tree. Discrete Mathematics & Theoretical Computer Science, DMTCS Proceedings vol. AI,...(Proceedings). https://doi.org/10.46298/dmtcs.3586
Author names are used as deposited, so check their order before you submit.

Metadata is harvested from open-access indexes and can be incomplete. Check a citation against the published version before relying on it — see our open access & attribution policy.