ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let G=(V,E)G=(V,E) and G′=(V,E′)G'=(V,E') be connected graphs with the same vertex set VV, where

E′=E∪{{x,y}}E'=E\cup\{\{x,y\}\}

for some x,y∈Vx,y\in V. Write λc(G)\lambda_c(G) for the critical infection rate of the contact process on GG. Pemantle–Stacey conjecture. The critical rates are equal:

λc(G)=λc(G′).\lambda_c(G)=\lambda_c(G').

The conjecture asserts that adding a single edge does not affect the survival–extinction threshold of the contact process. Proving it in full generality remains an open problem.

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.