The Brownian cactus. I: Scaling limits of discrete cactuses (Q1951501): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 16:17, 1 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The Brownian cactus. I: Scaling limits of discrete cactuses |
scientific article |
Statements
The Brownian cactus. I: Scaling limits of discrete cactuses (English)
0 references
6 June 2013
0 references
The authors associate with every pointed graph a discrete tree called the cactus of the graph. Assuming that the pointed graph is chosen at random in a certain class of planar maps with a given number of vertices, and letting this number tend to infinity, they show that modulo a suitable rescaling, the associated cactus converges to a universal object, which they call Brownian cactus. Moreover, the Brownian cactus can be interpreted as the continuous cactus of the so-called Brownian map.
0 references
random planar maps
0 references
scaling limit
0 references
Brownian map
0 references
Brownian cactus
0 references
Hausdorff dimension
0 references