ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Tn(1,2)T_n(1,2) be the passage time between vertices 11 and 22 in the critical random graph model, and suppose the edge passage time has distribution

te=dpcδ0+(1−pc)δ1.t_e\overset{d}{=}p_c\delta_0+(1-p_c)\delta_1.

Thus each edge has passage time 00 with probability pcp_c and 11 otherwise. Logarithmic passage-time conjecture.

Tn(1,2)log⁡log⁡n⟶P2log⁡(2).\frac{T_n(1,2)}{\log\log n}\stackrel{\mathrm{P}}{\longrightarrow}\frac{2}{\log(2)}.

The source relates this question to work of Baroni and gives divergence of Tn(1,2)T_n(1,2) in distribution for this two-point law, but the proposed asymptotic constant remains conjectural.

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.