Backend
Wireless Node Ranking via Fourier-Driven Maximum-Likelihood Estimation (extended version)
arXiv math.IT0 views
arXiv:2611.17973v1 Announce Type: new Abstract: We apply non-abelian Fourier theory to the problem of maximum-likelihood estimation of the order of a line topology, based on signal strength measurements under shadowing only. This yields up to a 60-fold speedup over standard methods for uncorrelated shadowing. Moreover, for correlated Gaussian shadowing with a singular covariance (e.g. the joint path-loss model), maximum-likelihood recovery is exact and independent of the shadowing variance (an infinite Le Cam threshold), which our implementation confirms for $\sigma/\alpha$ as high as 7.0. The key object is the covariance's null space. Its dimension is fixed by the topology; its orientation depends on the correlation function only through the per-link variances. Although the mechanism formally requires an exact line, it is robust to small perturbations of the formation: an approximate kernel recovers as well as the exact one. We explore the dependence on the perturbation in detail for five nodes.
Source:https://arxiv.org/abs/2611.17973PreviousToward the Minimal Set of Information Inequalities in Regenerating Codes: An Algebraic ApproachNextRate Optimal Streaming Codes Under an Extended Delay Profile for Three-Node Relay Networks
Related posts
Designing the Order Flow for a Custom Children’s Book
0dev.to
I Caught a Pricing Page Change That Would Have Cost Us a Client
0dev.to
The agent said $62,421.60. The records said $50,075.93.
0dev.to
ENISA’s 2026 CRA Conference Signals the Practical Phase of EU Product Cybersecurity
0dev.to
It's always DNS, so why are we running our own?
0Hacker News

Apple Seeks 200,000 People for AI Health Study
0MacRumors