ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a base bb, let Gb′G_b' be the finite graph constructed from comma-sequence danger intervals, and let PP be a uniformly randomly chosen path in Gb′G_b'. Write ∣P∣|P| for the number of vertices in PP, and let E[∣P∣]\mathbb{E}[|P|] and Var(∣P∣)Var(|P|) denote its mean and variance. Path-length conjecture. As b→∞b\to\infty, the path length ∣P∣|P| is approximately exponentially distributed with rate close to (b/2+1)−1(b/2+1)^{-1}. In particular, E[∣P∣]≈b/2+1\mathbb{E}[|P|]\approx b/2+1 and Var(∣P∣)≈(b/2+1)2Var(|P|)\approx (b/2+1)^2. This is an empirical model intended to estimate comma-sequence behavior; the source supplies no resolution beyond the reported empirical testing.

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.