Weighted Combinatorial Laplacian and Its Application to Dynamic Coverage Repair in Sensor Networks

The weighted combinatorial Laplacian can detect "almost holes" in a simplicial complex, even if there are no combinatorially defined holes. This allows for efficient gradient-based algorithms to dynamically repair coverage gaps in sensor networks.