Two badly behaved percolation processes on a nonunimodular graph (Q2636935): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10959-011-0397-9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2058719109 / rank | |||
Normal rank | |||
Revision as of 02:50, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two badly behaved percolation processes on a nonunimodular graph |
scientific article |
Statements
Two badly behaved percolation processes on a nonunimodular graph (English)
0 references
18 February 2014
0 references
The author discusses the point of view in accordance of which the unimodularity distinction is of paramount importance in percolation, by considering some known properties of automorphism invariant percolation on unimodular graphs on the one hand, and using counterexamples to these properties for a special nonunimodular graph refereed to as Trofimov's graph on the other hand. In particular, he considers the number of so-called encounter points in infinite clusters, and simple random walk on an infinite cluster of automorphism invariant percolation.
0 references
percolation
0 references
random walk
0 references
encounter points
0 references
unimodularity
0 references
mass transport
0 references
