Cut-Set Sums and Tree Processes
type: Item
instance of: scholarly article
zbMATH Open document ID: 0636.90031
DOI: 10.2307/2046006
publication date: 1987-01-01T00:00:00Z
Mathematics Subject Classification ID: 90B15
Mathematics Subject Classification ID: 60G48
zbMATH DE Number: 4037573
zbMATH Keywords: infinite tree
zbMATH Keywords: cut-set sums
zbMATH Keywords: random fractals
zbMATH Keywords: flows in random networks
author: Kenneth J. Falconer
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.2307/2046006
OpenAlex ID: W4230121346
title: Cut-Set Sums and Tree Processes
cites work: Q4828418
cites work: Dimension and Dynamics for Fractal Recurrent Sets
cites work: Stopping Time Techniques for Analysts and Probabilists
cites work: Q3714302
cites work: Random fractals
cites work: Statistically self-similar fractals
cites work: Q3680586
cites work: Convergence of Martingales with a Directed Index Set
cites work: Random Recursive Constructions: Asymptotic Geometric and Topological Properties
Recommended article: The \(k\)-cut model in deterministic and random trees
Recommended article: Random cutting and records in deterministic and random trees
Recommended article: Cutting down \(\mathbf{p}\)-trees and inhomogeneous continuum random trees
Recommended article: A note on the probability of cutting a Galton-Watson tree
Recommended article: Q5874403
Recommended article: Q4389780
Recommended article: A limiting distribution for the number of cuts needed to isolate the root of a random recursive tree
Recommended article: Cutting Markovian trees
Recommended article: Q2973975
description: scientific article