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
Helsing backer Plural raises $1.1B to fund Europe’s next moonshots
0TechCrunch
Building Mobile Connectivity in Afghanistan: A Look at Roshan
0dev.to
Your Tests Blocked System.exit With a SecurityManager and Java 25 Will Not Let You Install One
0dev.to
We autoscaled our Java pricing service on memory and it grew to twenty pods and stayed there
0dev.to
Nine small tools I stopped installing apps for
0dev.to
I built a small tool to capture website screenshots across devices
0dev.to Productivity