The general-graph extension of the estimation-error lower-bound lemma
Statement
Let satisfy the paper's general-graph regularity assumption, and let satisfy the candidate-set assumption. For each initial source , write for probability under source , let be the true source, let be the estimator at time , let be the observation history up to time , let be graph distance, and let denote the relevant graph-dependent time-scaling function. General-graph estimation-error conjecture. There are constants and such that
The claim is presented as an expected extension of the paper's lower-bound lemma from regular trees and lattices to suitable general graphs; the displayed text leaves the referenced graph and candidate-set assumptions unspecified, so its precise scope and eventual status require verification.
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.