On the incipient cluster of the binary tree (Q1340190): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf01196678 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2077518662 / rank | |||
Normal rank | |||
Latest revision as of 09:10, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the incipient cluster of the binary tree |
scientific article |
Statements
On the incipient cluster of the binary tree (English)
0 references
28 February 1995
0 references
We consider the subcritical percolation process on a binary tree and prove the existence of a probability measure \(\nu_ p\) such that \(\nu_ p\)-almost surely the open cluster of the root of the binary tree is infinite. At the percolation threshold it looks like a single thread having a lot of finite branches.
0 references
subcritical percolation process
0 references
binary tree
0 references
percolation threshold
0 references
