The barrier-cone characterization of bounded cluster-growth directions

For p[0,1]p\in[0,1], let νp=pδ0+(1p)δ1\nu_p=p\delta_0+(1-p)\delta_1 be the passage-time law, let μp\mu_p be the associated semi-norm on Rd\mathbb{R}^d, and define

Ap={xRd:  μp(x)1}.A_p=\{x\in\mathbb{R}^d:\;\mu_p(x)\le 1\}.

The barrier cone of ApA_p is

Bar(Ap)={uRd:  supxApx,u<+},\operatorname{Bar}(A_p)=\{u\in\mathbb{R}^d:\;\sup_{x\in A_p}\langle x,u\rangle<+\infty\},

and, writing C+(0)C_+(0) for the oriented percolation cluster issued from 00, define

BG(p)={uRd:  Pp(supyC+(0)y,u=+)=0}.\mathrm{BG}(p)=\left\{u\in\mathbb{R}^d:\;\mathbb{P}_p\left(\sup_{y\in C_+(0)}\langle y,u\rangle=+\infty\right)=0\right\}.

Barrier-cone characterization conjecture. For every p[0,1]p\in[0,1],

Bar(Ap)=BG(p).\operatorname{Bar}(A_p)=\mathrm{BG}(p).

The set BG(p)\mathrm{BG}(p) consists of the directions in which the growth of the cluster issued from 00 is bounded, while the barrier cone describes the directions in which the associated convex set has bounded support. The conjecture proposes that these probabilistic bounded-growth directions are exactly characterized by the semi-norm μp\mu_p.

Sources & referencesView supporting material

Primary source

Olivier Garet and Régine Marchand, “Percolation and first-passage percolation on oriented graphs”, arXiv:1807.05736 (2021).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.