ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let G=(Gn)n≥1\mathcal G=(G_n)_{n\geq1} be a sequence of configuration-model graphs, and let DD be the independent degree distribution. Assume

0<E[D(D−2)]<∞.0<E[D(D-2)]<\infty.

Define

a=E[D2]E[D]−1,a=\frac{E[D^2]}{E[D]}-1,

and

Λ=Λ(a)=2a−1−2a2−a,\Lambda=\Lambda(a)=2a-1-2\sqrt{a^2-a},

with Λ(∞)=0\Lambda(\infty)=0. Let λc(G)\lambda_c(\mathcal G) be the critical value defined by

λc(G)=sup⁡{λ:inf⁡δ>0lim sup⁡n→∞Pλ(∣Rn∣>δn)=0}.\lambda_c(\mathcal G)=\sup\left\{\lambda:\inf_{\delta>0}\limsup_{n\to\infty}\mathbf P_\lambda(|\mathcal R_n|>\delta n)=0\right\}.

Configuration-model critical-value conjecture. If G\mathcal G is sampled from the configuration model with an independent DD-distributed degree sequence satisfying the displayed condition, then

λc(G)=Λ.\lambda_c(\mathcal G)=\Lambda.

The quantity Λ\Lambda matches the critical value for chase-escape on an infinite tree with branching number aa. The paper presents equality with this value as a conjecture; no resolution is supplied.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.