Compressive Network Analysis

04/24/2011
by   Xiaoye Jiang, et al.
0

Modern data acquisition routinely produces massive amounts of network data. Though many methods and models have been proposed to analyze such data, the research of network data is largely disconnected with the classical theory of statistical learning and signal processing. In this paper, we present a new framework for modeling network data, which connects two seemingly different areas: network data analysis and compressed sensing. From a nonparametric perspective, we model an observed network using a large dictionary. In particular, we consider the network clique detection problem and show connections between our formulation with a new algebraic tool, namely Randon basis pursuit in homogeneous spaces. Such a connection allows us to identify rigorous recovery conditions for clique detection problems. Though this paper is mainly conceptual, we also develop practical approximation algorithms for solving empirical problems and demonstrate their usefulness on real-world datasets.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/21/2018

A Tutorial on Clique Problems in Communications and Signal Processing

Since its first use by Euler on the seven bridges of Königsberg problem,...
research
08/31/2022

Optimality Analysis and Block Sparse Algorithm for Complex Compressed Sensing

Recently, many new challenges in Compressed Sensing (CS), such as block ...
research
09/14/2013

Optimized projections for compressed sensing via rank-constrained nearest correlation matrix

Optimizing the acquisition matrix is useful for compressed sensing of si...
research
12/19/2022

Analysis of Sparse Recovery Algorithms via the Replica Method

This manuscript goes through the fundamental connections between statist...
research
02/21/2013

Nonparametric Basis Pursuit via Sparse Kernel-based Learning

Signal processing tasks as fundamental as sampling, reconstruction, mini...
research
04/01/2022

Balanced Clique Computation in Signed Networks: Concepts and Algorithms

Clique is one of the most fundamental models for cohesive subgraph minin...
research
10/19/2018

Data analysis from empirical moments and the Christoffel function

Spectral features of the empirical moment matrix constitute a resourcefu...

Please sign up or login with your details

Forgot password? Click here to reset