Recursive limit-law conjecture for fringe patterns in ranked tree-child networks
Statement
A fringe pattern is a connected substructure of a ranked tree-child network that has entirely evolved from a fixed set of lineages by consecutively adding branching and reticulation events. Let be a fringe pattern. Denote by , respectively and , the patterns obtained from it by removing the last event; the second case occurs only if the last event is a reticulation event and removing it disconnects the pattern.
Recursive limit-law conjecture. The limit law of is determined recursively as follows. If is a normal pattern, then is a Poisson pattern; in all other cases for , is a degenerate pattern. If and are both normal patterns, then is also a normal pattern; if one of and is normal and the other is Poisson, then is a Poisson pattern; in all remaining cases, is a degenerate pattern.
The conjecture extends the paper's classification of limit laws for patterns of heights one and two. It predicts that every fringe pattern has one of three asymptotic behaviors—normal, Poisson, or degenerate—determined by recursively analyzing the event that created it.
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.