Phase transition in LAWS convergence
Statement
Let be a stationary distribution with entropy , let denote the LAWS hit rate after total queries, and let be the per-node visit threshold. Phase transition in LAWS convergence. There exists such that for and for , with transition width .
The heuristic compares the process with coupon collection over heavy nodes, while noting that trie dependencies may accelerate coverage. A formal proof via the trie heavy-node occupancy process remains open.
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.