Time constant in a recursive series-parallel first-passage model
Statement
Let be the source-to-sink first-passage distance in the recursively substituted hierarchical graph whose distances satisfy , with i.i.d. edge-weight law . Compute in terms of and decide whether , the corresponding branching-random-walk constant.
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.