SOURCE-LINKED INTELLIGENCE

Fast Graph Laplacian Estimation using Effective Resistance

arXiv · AI, language, vision and robotics · article · Sep 20, 2026 · UTC

Inferring network topology from noisy node observations is a central problem in graph signal processing. In this paper, we consider Laplacian-constrained graph estimation for Gaussian Markov random fields, focusing on the underdetermined regime in which the number of samples is smaller than the number of graph nodes. Existing approaches often formulate the problem as a sparsity-regularized maximum-likelihood estimation problem. While effective, such methods typically require iterative optimization and are often computationally demanding, particularly under Laplacian constraints. Instead, we pr

Read original source ↗ Open in workspace

recordType

paper

region

Global