The effect of small quenched noise on connectivity properties of random interlacements (Q388835): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / review text | |||
The authors study the effect of a small quenched noise on the connectivity properties of random interlacements (at level \(u\)) and vacant sets. In particular, given \(\varepsilon > 0\), each vertex of the random interlacement, considered as occupied, is allowed to become vacant with probability \(1- \varepsilon\), as well as each vacant vertex is allowed to become occupied with probability \(\varepsilon\), independently of the randomness of the interlacement and independently for different vertices. They prove that for any \(d \geq 3\) and \(u > 0\), the perturbed random interlacement percolates for sufficiently small values of the noise parameter \(\varepsilon\) almost surely, by proving the stronger statement that the Bernoulli percolation on the random interlacement graph has a non-trivial phase transition in wide enough slabs. Moreover, they show that any electric network with i.i.d. positive resistances on the interlacement graph is transient, strengthening their previous result on the transience of random interlacements. Furthermore, they show that, when the noise parameter is small enough, the vacant set at level \(u\) undergoes a non-trivial phase transition in \(u\) as in the non-random case (\(\varepsilon = 0\)), giving explicit upper and lower bounds for the critical threshold when \(\varepsilon\) tends to zero. | |||
Property / review text: The authors study the effect of a small quenched noise on the connectivity properties of random interlacements (at level \(u\)) and vacant sets. In particular, given \(\varepsilon > 0\), each vertex of the random interlacement, considered as occupied, is allowed to become vacant with probability \(1- \varepsilon\), as well as each vacant vertex is allowed to become occupied with probability \(\varepsilon\), independently of the randomness of the interlacement and independently for different vertices. They prove that for any \(d \geq 3\) and \(u > 0\), the perturbed random interlacement percolates for sufficiently small values of the noise parameter \(\varepsilon\) almost surely, by proving the stronger statement that the Bernoulli percolation on the random interlacement graph has a non-trivial phase transition in wide enough slabs. Moreover, they show that any electric network with i.i.d. positive resistances on the interlacement graph is transient, strengthening their previous result on the transience of random interlacements. Furthermore, they show that, when the noise parameter is small enough, the vacant set at level \(u\) undergoes a non-trivial phase transition in \(u\) as in the non-random case (\(\varepsilon = 0\)), giving explicit upper and lower bounds for the critical threshold when \(\varepsilon\) tends to zero. / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Michele Gianfelice / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 60K35 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 82B43 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6247173 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
random interlacements | |||
Property / zbMATH Keywords: random interlacements / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Bernoulli percolation | |||
Property / zbMATH Keywords: Bernoulli percolation / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
long-range connectivities | |||
Property / zbMATH Keywords: long-range connectivities / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
vacant sets | |||
Property / zbMATH Keywords: vacant sets / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
quenched noise | |||
Property / zbMATH Keywords: quenched noise / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
transience | |||
Property / zbMATH Keywords: transience / rank | |||
Normal rank |
Revision as of 14:34, 29 June 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The effect of small quenched noise on connectivity properties of random interlacements |
scientific article |
Statements
The effect of small quenched noise on connectivity properties of random interlacements (English)
0 references
17 January 2014
0 references
The authors study the effect of a small quenched noise on the connectivity properties of random interlacements (at level \(u\)) and vacant sets. In particular, given \(\varepsilon > 0\), each vertex of the random interlacement, considered as occupied, is allowed to become vacant with probability \(1- \varepsilon\), as well as each vacant vertex is allowed to become occupied with probability \(\varepsilon\), independently of the randomness of the interlacement and independently for different vertices. They prove that for any \(d \geq 3\) and \(u > 0\), the perturbed random interlacement percolates for sufficiently small values of the noise parameter \(\varepsilon\) almost surely, by proving the stronger statement that the Bernoulli percolation on the random interlacement graph has a non-trivial phase transition in wide enough slabs. Moreover, they show that any electric network with i.i.d. positive resistances on the interlacement graph is transient, strengthening their previous result on the transience of random interlacements. Furthermore, they show that, when the noise parameter is small enough, the vacant set at level \(u\) undergoes a non-trivial phase transition in \(u\) as in the non-random case (\(\varepsilon = 0\)), giving explicit upper and lower bounds for the critical threshold when \(\varepsilon\) tends to zero.
0 references
random interlacements
0 references
Bernoulli percolation
0 references
long-range connectivities
0 references
vacant sets
0 references
quenched noise
0 references
transience
0 references