The disjoint-path comparison conjecture for graded graphs
Statement
Let be a graded graph with root , levels , and IID vertex labels with common distribution . For an event of label sequences, let be the probability that some graded path in has its label sequence in . Let be the number of distinct graded paths in , and let consist of paths of length that are disjoint except at . Disjoint-path comparison conjecture.
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 .
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.