The asymptotic critical branching-rate conjecture for the general contact process
Statement
Let and let satisfy the model's stated assumption. For the process, write
for the critical branching rate, and let
Critical branching-rate conjecture. In the general model,
and hence
The theorem preceding the conjecture proves the matching lower bound in the liminf. The conjecture asserts that this lower bound is asymptotically sharp, determining the critical branching rate to first order as ; the corresponding upper bound is not established here.
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.