ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graded graph with root ρ\rho, levels V0,…,VNV_0,\ldots,V_N, and IID vertex labels with common distribution μ\mu. For an event BB of label sequences, let P(G;B)P(G;B) be the probability that some graded path in GG has its label sequence in BB. Let MM be the number of distinct graded paths in GG, and let G′G' consist of MM paths of length NN that are disjoint except at ρ\rho. Disjoint-path comparison conjecture.

P(G;B)≤P(G′;B).P(G;B)\leq P(G';B).

The comparison is known for graded graphs arising from trees, while the source reports only special cases for general graded graphs, including certain cases with N=2N=2.

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.