Sparse Recovery with Graph Constraints: Fundamental Limits and Measurement Construction

Details Sparse Recovery with Graph Constraints: Fundamental Limits and Measurement Construction Sparse Recovery with Graph Constraints: Fundamental Limits and Measurement Construction

2011-08-01

arxiv.org/abs/1108.0443v1

Computer Science

Information Theory

Scientific paper

This paper addresses the problem of sparse recovery with graph constraints in the sense that we can take additive measurements over nodes only if they induce a connected subgraph. We provide explicit measurement constructions for several special graphs. A general measurement construction algorithm is also proposed and evaluated. For any given graph $G$ with $n$ nodes, we derive order optimal upper bounds of the minimum number of measurements needed to recover any $k$-sparse vector over $G$ ($M^G_{k,n}$). Our study suggests that $M^G_{k,n}$ may serve as a graph connectivity metric.

Affiliated with

Also associated with

No associations

Rating

Sparse Recovery with Graph Constraints: Fundamental Limits and Measurement Construction does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Sparse Recovery with Graph Constraints: Fundamental Limits and Measurement Construction, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Sparse Recovery with Graph Constraints: Fundamental Limits and Measurement Construction will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-508041