ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let PMP_{\mathcal{M}} be a stationary distribution with entropy HH, let HNH_N denote the LAWS hit rate after NN total queries, and let Nmin⁡N_{\min} be the per-node visit threshold. Phase transition in LAWS convergence. There exists N∗=Θ(Nmin⁡⋅2H)N^*=\Theta(N_{\min}\cdot2^H) such that HN≈0H_N\approx0 for N≪N∗N\ll N^* and HN≈H∞H_N\approx H_\infty for N≫N∗N\gg N^*, with transition width O(N∗/H)O(N^*/\sqrt{H}).

The heuristic compares the process with coupon collection over 2H2^H 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 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.