Powerlessness conjecture for late changepoint detection below the square-root scale
Consider the preferential attachment model with changepoint time for and , and let denote the degree of vertex in the final network and the final network snapshot. A test is powerful if its power tends to one while its type-I error tends to zero.
Powerlessness conjecture. When , all tests based on the vertex degrees are powerless, and all tests based on are powerless.
The second assertion is stronger because it rules out using higher-level information in the edge structure of . The question is formally open; the conjecture is motivated by the fact that degree-count mean shifts are of order , below their fluctuation scale when , and by asymptotic normality results suggesting that the corresponding distributions have vanishing total variation distance.
References
- Gianmarco Bet, Kay Bogerd, Rui M. Castro and Remco van der Hofstad, “Detecting a late changepoint in the preferential attachment model”, arXiv:2310.02603 (2023).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.