Truncated Connectivities in a Highly Supercritical Anisotropic Percolation Model

We consider an anisotropic bond percolation model on $\mathbb{Z}^{2}$ , with p=(p _h ,p _v )∈[0,1]², p _v >p _h , and declare each horizontal (respectively vertical) edge of $\mathbb{Z}^{2}$ to be open with probability p _h (respectively p _v ), and otherwise closed, independently of all other edges. Let $x=(x_{1},x_{2}) \in\mathbb{Z}^{2}$ with 0<x ₁<x ₂, and $x'=(x_{2},x_{1})\in\mathbb{Z}^{2}$ . It is natural to ask how the two point connectivity function $\mathbb{P}_{\mathbf{p}}(\{0\leftrightarrow x\})$ behaves, and whether anisotropy in percolation probabilities implies the strict inequality $\mathbb{P}_{\mathbf{p}}(\{0\leftrightarrow x\})>\mathbb{P}_{\mathbf {p}}(\{0\leftrightarrow x'\})$ . In this note we give an affirmative answer in the highly supercritical regime.     

Random Walk on the Incipient Infinite Cluster for Oriented Percolation in High Dimensions

We consider simple random walk on the incipient infinite cluster for the spread-out model of oriented percolation on . In dimensions d > 6, we obtain bounds on exit times, transition probabilities, and the range of the random walk, which establish that the spectral dimension of the incipient infinite cluster is , and thereby prove a version of the Alexander–Orbach conjecture in this setting. The proof divides into two parts. One part establishes general estimates for simple random walk on an arbitrary infinite random graph, given suitable bounds on volume and effective resistance for the random graph. A second part then provides these bounds on volume and effective resistance for the incipient infinite cluster in dimensions d > 6, by extending results about critical oriented percolation obtained previously via the lace expansion.     

Existence of a Non-Averaging Regime for the Self-Avoiding Walk on a High-Dimensional Infinite Percolation Cluster

Let $Z_N$ be the number of self-avoiding paths of length $N$ starting from the origin on the infinite cluster obtained after performing Bernoulli percolation on ${\mathbb Z} ^d$ with parameter $p>p_c({\mathbb Z} ^d)$ . The object of this paper is to study the connective constant of the dilute lattice $\limsup _{N\rightarrow \infty } Z_N^{1/N}$ , which is a non-random quantity. We want to investigate if the inequality $\limsup _{N\rightarrow \infty } (Z_N)^{1/N} \le \lim _{N\rightarrow \infty } {\mathbb E} [Z_N]^{1/N}$ obtained with the Borel–Cantelli Lemma is strict or not. In other words, we want to know if the quenched and annealed versions of the connective constant are equal. On a heuristic level, this indicates whether or not localization of the trajectories occurs. We prove that when $d$ is sufficiently large there exists $p^{(2)}_c>p_c$ such that the inequality is strict for $p\in (p_c,p^{(2)}_c)$ .     

On Large Isolated Regions in Supercritical Percolation

We consider supercritical vertex percolation in ^d with any non-degenerate uniform oriented pattern of connection. In particular, our results apply to the more special unoriented case. We estimate the probability that a large region is isolated from . In particular, pancakes with a radius r and constant thickness, parallel to a constant linear subspace L, are isolated with probability, whose logarithm grows asymptotically as r ^dim(L) if percolation is possible across L and as r ^dim(L)–1 otherwise. Also we estimate probabilities of large deviations in invariant measures of some cellular automata.     

A Note on Anisotropic Percolation

We consider an anisotropic independent bond percolation model on , i.e. we suppose that the vertical edges of are open with probability p and closed with probability 1–p, while the horizontal edges of are open with probability p and closed with probability 1– p, with 0 < p, < 1. Let , with x₁ < x₂, and . It is natural to ask how the two point connectivity function P_p,({0 x}) behaves, and whether anisotropy in percolation probabilities implies the strict inequality P_p,({0 x})> P_p,({0 x}). In this note we give affirmative answer at least for some regions of the parameters involved.Mathematics Subject Classifications (2000). 82B20, 82B41, 82B43.     

Scaling Argument of Anisotropic Random Walk

In this paper, we analytically discuss the scaling properties of the average square end-to-end distance 〈R²〉for anisotropic random walk in D-dimensional space (D≥2), and the returning probability P_n( r₀) for the walker into a certain neighborhood of the origin. We will not only give the calculating formula for 〈R²〉and P_n(r₀), but also point out that if there is a symmetric axis for the distribution of the probability density of a single step displacement, we always obtain 〈R²_⊥n〉～n, where ⊥ refers to the projections of the displacement perpendicular to each symmetric axes of the walk; in D-dimensional space with D symmetric axes perpendicular to each other, we always have 〈R_n²〉～n and the random walk will be like a purely random motion; if the number of inter-perpendicular symmetric axis is smaller than the dimensions of the space, we must have 〈R_n²〉～n² for very large n and the walk will be like a ballistic motion. It is worth while to point out that unlike the isotropic random walk in one and two dimensions, which is certain to return into the neighborhood of the origin, generally there is only a nonzero probability for the anisotropic random walker in two dimensions to return to the neighborhood.     

On the Localized Phase of a Copolymer in an Emulsion: Supercritical Percolation Regime

In this paper we study a two-dimensional directed self-avoiding walk model of a random copolymer in a random emulsion. The copolymer is a random concatenation of monomers of two types, A and B, each occurring with density . The emulsion is a random mixture of liquids of two types, A and B, organised in large square blocks occurring with density p and 1 − p, respectively, where p ϵ (0, 1). The copolymer in the emulsion has an energy that is minus α times the number of AA-matches minus β times the number of BB-matches, where without loss of generality the interaction parameters can be taken from the cone . To make the model mathematically tractable, we assume that the copolymer is directed and can only enter and exit a pair of neighbouring blocks at diagonally opposite corners. In [7], a variational expression was derived for the quenched free energy per monomer in the limit as the length n of the copolymer tends to infinity and the blocks in the emulsion have size L _n such that L _n → ∞ and L _n /n → 0. Under this restriction, the free energy is self-averaging with respect to both types of randomness. It was found that in the supercritical percolation regime p ≥ p _c , with p _c the critical probability for directed bond percolation on the square lattice, the free energy has a phase transition along a curve in the cone that is independent of p. At this critical curve, there is a transition from a phase where the copolymer is fully delocalized into the A-blocks to a phase where it is partially localized near the AB-interface. In the present paper we prove three theorems that complete the analysis of the phase diagram : (1) the critical curve is strictly increasing; (2) the phase transition is second order; (3) the free energy is infinitely differentiable throughout the partially localized phase. In the subcritical percolation regime p < p _c , the phase diagram is much more complex. This regime will be treated in a forthcoming paper.     

Metastability Thresholds for Anisotropic Bootstrap Percolation in Three Dimensions

In this paper we analyze several anisotropic bootstrap percolation models in three dimensions. We present the order of magnitude for the metastability thresholds for a fairly general class of models. In our proofs, we use an adaptation of the technique of dimensional reduction. We find that the order of the metastability threshold is generally determined by the ‘easiest growth direction’ in the model. In contrast to anisotropic bootstrap percolation in two dimensions, in three dimensions the order of the metastability threshold for anisotropic bootstrap percolation can be equal to that of isotropic bootstrap percolation.     

Finite-Size Effects for Anisotropic Bootstrap Percolation: Logarithmic Corrections

In this note we analyse an anisotropic, two-dimensional bootstrap percolation model introduced by Gravner and Griffeath. We present upper and lower bounds on the finite-size effects. We discuss the similarities with the semi-oriented model introduced by Duarte.     

Regularity of the Speed of Biased Random Walk in a One-Dimensional Percolation Model

We consider biased random walks on the infinite cluster of a conditional bond percolation model on the infinite ladder graph. Axelson-Fisk and Häggström established for this model a phase transition for the asymptotic linear speed \(\overline{\hbox {v}}\) of the walk. Namely, there exists some critical value \(\lambda _{\hbox {c}}>0\) such that \(\overline{\hbox {v}}>0\) if \(\lambda \in (0,\lambda _{\hbox {c}})\) and \(\overline{\hbox {v}}=0\) if \(\lambda \ge \lambda _{\hbox {c}}\). We show that the speed \(\overline{\hbox {v}}\) is continuous in \(\lambda \) on \((0,\infty )\) and differentiable on \((0,\lambda _{\hbox {c}}/2)\). Moreover, we characterize the derivative as a covariance. For the proof of the differentiability of \(\overline{\hbox {v}}\) on \((0,\lambda _{\hbox {c}}/2)\), we require and prove a central limit theorem for the biased random walk. Additionally, we prove that the central limit theorem fails to hold for \(\lambda \ge \lambda _{\hbox {c}}/2\).     

The Incipient Infinite Cluster for High-Dimensional Unoriented Percolation

We consider bond percolation on $\mathbb{Z}^d$ at the critical occupation density p _c for d>6 in two different models. The first is the nearest-neighbor model in dimension d?6. The second model is a “spread-out” model having long range parameterized by L in dimension d>6. In the spread-out case, we show that the cluster of the origin conditioned to contain the site x weakly converges to an infinite cluster as |x|→∞ when d>6 and L is sufficiently large. We also give a general criterion for this convergence to hold, which is satisfied in the case d?6 in the nearest-neighbor model by work of Hara.⁽¹²⁾ We further give a second construction, by taking p<p _c , defining a measure $\mathbb{Q}^p $ and taking its limit as p↗p ^? _c . The limiting object is the high-dimensional analogue of Kesten's incipient infinite cluster (IIC) in d=2. We also investigate properties of the IIC such as bounds on the growth rate of the cluster that show its four-dimensional nature. The proofs of both the existence and of the claimed properties of the IIC use the lace expansion. Finally, we give heuristics connecting the incipient infinite cluster to invasion percolation, and use this connection to support the well-known conjecture that for d>6 the probability for invasion percolation to reach a site x is asymptotic to c|x|^?(d?4) as |x|→∞.     

Invasion Percolation and the Incipient Infinite Cluster in 2D

 We establish two links between two-dimensional invasion percolation and Kesten's incipient infinite cluster (IIC). We first prove that the k ^th moment of the number of invaded sites within the box [−n, n]×[−n, n] is of order (n ²π _n ) ^k , for k≥1, where π _n is the probability that the origin in critical percolation is connected to the boundary of a box of radius n. This improves a result of Y. Zhang. We show that the size of the invaded region, when scaled by n ²π _n , is tight. Secondly, we prove that the invasion cluster looks asymptotically like the IIC, when viewed from an invaded site v, in the limit |v|→∞. We also establish this when an invaded site v is chosen at random from a box of radius n, and n→∞. Received: 3 December 2000 / Accepted: 3 December 2002 Published online: 18 February 2003 RID="⋆" ID="⋆" Present address: CWI, PNA 3, P.O. Box 94079, 1090 GB Amsterdam, The Netherlands. E-mail:jarai@cwi.nl Communicated by M. Aizenman     

Anisotropic Spin Cluster as a Qubit

We study an anisotropic spin cluster of 3 spin S=1/2 particles with antiferromagnetic exchange interaction with non-uniform coupling constants. A time-dependent magnetic field is applied to control the time evolution of the cluster. It is well known that for an odd number of sites a spin cluster qubit can be defined in terms of the ground state doublet. The universal one-qubit logic gate can be constructed from the time evolution operator of the non-autonomous many-body system, and the six basic one-qubit gates can be realized by adjusting the applied time-dependent magnetic field.     

Anisotropic Spin Cluster as a Qubit

We study an anisotropic spin cluster of 3 spin S=1/2 particles with antiferromagnetic exchange interaction with non-uniform coupling constants. A time-dependent magnetic field is applied to control the time evolution of the cluster. It is well known that for an odd number og sites a spin cluster qubit can be defined in terms of the ground state doublet. The universal one-qubit logic gate can be constructed from the time evolution operator of the non-autonomous many-body system, and the six basic one-qubit gates can be realized by adjusting the applied time-dependent magnetic field.     

Four Types of Percolation Transitions in the Cluster Aggregation Network Model

We study the percolation transition in a one-species cluster aggregation network model, in which the parameter α describes the suppression on the cluster sizes. It is found that the model can exhibit four types of percolation transitions, two continuous percolation transitions and two discontinuous ones. Continuous and discontinuous percolation transitions can be distinguished from each other by the largest single jump. Two types of continuous percolation transitions show different behaviors in the time gap. Two types of discontinuous percolation transitions are different in the time evolution of the cluster size distribution. Moreover, we also find that the time gap may also be a measure to distinguish different discontinuous percolations in this model.     

Diffusion on the Scaling Limit of the Critical Percolation Cluster in the Diamond Hierarchical Lattice

We construct critical percolation clusters on the diamond hierarchical lattice and show that the scaling limit is a graph directed random recursive fractal. A Dirichlet form can be constructed on the limit set and we consider the properties of the associated Laplace operator and diffusion process. In particular we contrast and compare the behaviour of the high frequency asymptotics of the spectrum and the short time behaviour of the on-diagonal heat kernel for the percolation clusters and for the underlying lattice. In this setting a number of features of the lattice are inherited by the critical cluster.     

On AB Bond Percolation on the Square Lattice and AB Site Percolation on Its Line Graph

We prove that AB site percolation occurs on the line graph of the square lattice when $p \in (1 - \sqrt {1 - p_c } ,\sqrt {1 - p_c } )$ , where p _c is the critical probability for site percolation in $\mathbb{Z}^2$ . Also, we prove that AB bond percolation does not occur on $\mathbb{Z}^2$ for p = $\frac{1}{2}$ .     

On the Study of Jamming Percolation

We investigate kinetically constrained models of glassy transitions, and determine which model characteristics are crucial in allowing a rigorous proof that such models have discontinuous transitions with faster than power law diverging length and time scales. The models we investigate have constraints similar to that of the knights model, introduced by Toninelli, Biroli, and Fisher (TBF), but differing neighbor relations. We find that such knights-like models, otherwise known as models of jamming percolation, need a “No Parallel Crossing” rule for the TBF proof of a glassy transition to be valid. Furthermore, most knights-like models fail a “No Perpendicular Crossing” requirement, and thus need modification to be made rigorous. We also show how the “No Parallel Crossing” requirement can be used to evaluate the provable glassiness of other correlated percolation models, by looking at models with more stable directions than the knights model. Finally, we show that the TBF proof does not generalize in any straightforward fashion for three-dimensional versions of the knights-like models.