The DOI matches its Crossref record; 57 of the 57 references it cites were found in a registry or an index.
Connecting the Dots: Identifying Network Structure via Graph Signal Processing
Open accessAbstract
Network topology inference is a significant problem in network science. Most graph signal processing (GSP) efforts to date assume that the underlying network is known and then analyze how the graph?s algebraic and spectral characteristics impact the properties of the graph signals of interest. Such an assumption is often untenable beyond applications dealing with, e.g., directly observable social and infrastructure networks; and typically adopted graph construction schemes are largely informal, distinctly lacking an element of validation. This article offers an overview of graph-learning methods developed to bridge the aforementioned gap, by using information available from graph signals to infer the underlying graph topology. Fairly mature statistical approaches are surveyed first, where correlation analysis takes center stage along with its connections to covariance selection and high-dimensional regression for learning Gaussian graphical models. Recent GSP-based network inference frameworks are also described, which postulate that the network exists as a latent underlying structure and that observations are generated as a result of a network process defined in such a graph. A number of arguably more nascent topics are also briefly outlined, including inference of dynamic networks and nonlinear models of pairwise interaction, as well as extensions to directed (di) graphs and their relation to causal inference. All in all, this article introduces readers to challenges and opportunities for SP research in emerging topic areas at the crossroads of modeling, prediction, and control of complex behavior arising in networked systems that evolve over time.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Investigating causal relations by econometric models and cross-spectral methods
Granger, C. W. J. (1969) · Econometrica · doi:10.2307/1912791 · Cited by 22,989
Sparse inverse covariance estimation with the graphical lasso
Friedman, J., Hastie, T., & Tibshirani, R. (2008) · Biostatistics · doi:10.1093/biostatistics/kxm045 · Cited by 6,355
New Introduction to Multiple Time Series Analysis
Lütkepohl, H. (2005) · Springer eBooks · doi:10.1007/978-3-540-27752-1 · Cited by 5,918
Shuman, D. I., Narang, S. K., Frossard, P., Ortega, A., & Vandergheynst, P. (2013) · IEEE Signal Processing Magazine · doi:10.1109/msp.2012.2235192 · Cited by 4,421
Semidefinite Relaxation of Quadratic Optimization Problems
Luo, Z.-Q., Ma, W.-K., So, A., Ye, Y., & Zhang, S. (2010) · IEEE Signal Processing Magazine · doi:10.1109/msp.2010.936019 · Cited by 3,715
High dimensional graphs and variable selection with the Lasso
Meinshausen, N., & Bühlmann, P. (2006) · Cited by 2,539
High-dimensional graphs and variable selection with the Lasso
Meinshausen, N., & Bühlmann, P. (2006) · The Annals of Statistics · doi:10.1214/009053606000000281 · Cited by 2,521
Structural Equation Modeling: Foundations and Extensions
Kaplan, D. E. (2000) · University of Maribor digital library (University of Maribor) · Cited by 1,813
Graph Signal Processing: Overview, Challenges, and Applications
Ortega, A., Frossard, P., Kovačević, J., Moura, J. M. F., & Vandergheynst, P. (2018) · Proceedings of the IEEE · doi:10.1109/jproc.2018.2820126 · Cited by 1,787
Model selection and estimation in the Gaussian graphical model
Yuan, M., & Lin, Y. (2007) · Biometrika · doi:10.1093/biomet/asm018 · Cited by 1,627
Sporns, O. (2010) · The MIT Press eBooks · doi:10.7551/mitpress/8476.001.0001 · Cited by 1,580
Discrete Signal Processing on Graphs
Sandryhaila, A., & Moura, J. M. F. (2013) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2013.2238935 · Cited by 1,531
Banerjee, O., Ghaoui, L. E., & d’Aspremont, A. (2007) · arXiv (Cornell University) · doi:10.1145/1390681.1390696 · Cited by 1,233
Statistical Analysis of Network Data: Methods and Models
Kolaczyk, E. D. (2009) · Springer Series in Statistics · doi:10.1007/978-0-387-88146-1 · Cited by 980
Dempster, A. P. (1972) · Biometrics · doi:10.2307/2528966 · Cited by 905
Computer Age Statistical Inference: Algorithms, Evidence, and Data Science
Efron, B., & Hastie, T. (2016) · Cambridge University Press eBooks · doi:10.1017/cbo9781316576533 · Cited by 902
High-dimensional Ising model selection using ℓ1-regularized logistic regression
Ravikumar, P., Wainwright, M. J., & Lafferty, J. D. (2010) · The Annals of Statistics · doi:10.1214/09-aos691 · Cited by 892
Discrete Signal Processing on Graphs: Frequency Analysis
Sandryhaila, A., & Moura, J. M. F. (2014) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2014.2321121 · Cited by 879
High-dimensional covariance estimation by minimizing ℓ1-penalized log-determinant divergence
Ravikumar, P., Wainwright, M. J., Raskutti, G., & Yu, B. (2011) · Electronic Journal of Statistics · doi:10.1214/11-ejs631 · Cited by 744
Learning Laplacian Matrix in Smooth Graph Signal Representations
Dong, X., Thanou, D., Frossard, P., & Vandergheynst, P. (2016) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2016.2602809 · Cited by 640
Numerical Analysis, A Second Course
de Boor, C. W., & Ortega, J. M. (1973) · Mathematics of Computation · doi:10.2307/2005671 · Cited by 556
Structural Equation Modeling (2nd ed.): Foundations and Extensions
Kaplan, D. (2009) · Sage eBooks · doi:10.4135/9781452226576 · Cited by 419
Graph Learning From Data Under Laplacian and Structural Constraints
Egilmez, H. E., Pavez, E., & Ortega, A. (2017) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2017.2726975 · Cited by 364
Vertex-frequency analysis on graphs
Shuman, D. I., Ricaud, B., & Vandergheynst, P. (2016) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2015.02.005 · Cited by 349
Sampling of Graph Signals With Successive Local Aggregations
Marques, A. G., Segarra, S., Leus, G., & Ribeiro, A. (2016) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2015.2507546 · Cited by 287
Self-citationNetwork deconvolution as a general method to distinguish direct dependencies in networks
Feizi, S., Marbach, D., Médard, M., & Kellis, M. (2013) · Nature Biotechnology · doi:10.1038/nbt.2635 · Cited by 287
Network Topology Inference from Spectral Templates
Segarra, S., Marques, A. G., Mateos, G., & Ribeiro, A. (2017) · IEEE Transactions on Signal and Information Processing over Networks · doi:10.1109/tsipn.2017.2731051 · Cited by 287
Self-citationStructure and dynamics of information pathways in online media
Gomez Rodriguez, M., Leskovec, J., & Schölkopf, B. (2013) · Proceedings of the sixth ACM international conference on Web search and data mining · doi:10.1145/2433396.2433402 · Cited by 271
Computer age statistical inference algorithms, evidence, and data science
Efron, B., & Hastie, T. J. (2016) · Thammasat University Digital Collections · Cited by 263
Optimal Graph-Filter Design and Applications to Distributed Linear Network Operators
Segarra, S., Marques, A. G., & Ribeiro, A. (2017) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2017.2703660 · Cited by 251
Self-citationGraph Spectral Image Processing
Cheung, G., Magli, E., Tanaka, Y., & Ng, M. K. (2018) · Proceedings of the IEEE · doi:10.1109/jproc.2018.2799702 · Cited by 251
Stationary Signal Processing on Graphs
Perraudin, N., & Vandergheynst, P. (2017) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2017.2690388 · Cited by 244
Stationary Graph Processes and Spectral Estimation
Marques, A. G., Segarra, S., Leus, G., & Ribeiro, A. (2017) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2017.2739099 · Cited by 235
Self-citationTopology Identification and Learning over Graphs: Accounting for Nonlinearities and Dynamics
Giannakis, G. B., Shen, Y., & Karanikolas, G. V. (2018) · Proceedings of the IEEE · doi:10.1109/jproc.2018.2804318 · Cited by 204
Signal Processing on Graphs: Causal Modeling of Un structured Data
Mei, J., & Moura, J. M. F. (2017) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2016.2634543 · Cited by 187
Graph Frequency Analysis of Brain Signals
Huang, W., Goldsberry, L., Wymbs, N. F., Grafton, S. T., Bassett, D. S., & Ribeiro, A. (2016) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2016.2600859 · Cited by 181
Self-citationNetwork Inference via the Time-Varying Graphical Lasso
Hallac, D., Park, Y., Boyd, S., & Leskovec, J. (2017) · Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/3097983.3098037 · Cited by 174
Cai, X., Bazerque, J. A., & Giannakis, G. B. (2013) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1003068 · Cited by 160
Learning Heat Diffusion Graphs
Thanou, D., Dong, X., Kressner, D., & Frossard, P. (2017) · IEEE Transactions on Signal and Information Processing over Networks · doi:10.1109/tsipn.2017.2731164 · Cited by 159
Ortega, J. M. (1990) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971323 · Cited by 149
Causal Network Inference Via Group Sparse Regularization
Bolstad, A. K., Veen, B. D. V., & Nowak, R. (2011) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2011.2129515 · Cited by 140
Stationary graph signals using an isometric graph translation
Girault, B. (2015) · European Signal Processing Conference (EUSIPCO) · doi:10.1109/eusipco.2015.7362637 · Cited by 121
Proximal-Gradient Algorithms for Tracking Cascades Over Social Networks
Baingana, B., Mateos, G., & Giannakis, G. B. (2014) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2014.2317284 · Cited by 94
Self-citationKernel-Based Structural Equation Models for Topology Identification of Directed Networks
Shen, Y., Baingana, B., & Giannakis, G. B. (2017) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2017.2664039 · Cited by 94
Slawski, M., & Hein, M. (2014) · Linear Algebra and its Applications · doi:10.1016/j.laa.2014.04.020 · Cited by 91
Kalofolias, V., Loukas, A., Thanou, D., & Frossard, P. (2017) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2017.7952672 · Cited by 90
Graph Spectral Image Processing
(2021) · Wiley eBooks · doi:10.1002/9781119850830 · Cited by 90
Translation on Graphs: An Isometric Shift Operator
Girault, B., Gonçalvès, P., & Eric Fleury, B. (2015) · IEEE Signal Processing Letters · doi:10.1109/lsp.2015.2488279 · Cited by 83
Rating Prediction via Graph Signal Processing
Huang, W., Marques, A. G., & Ribeiro, A. (2018) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2018.2864654 · Cited by 70
Self-citationLearning Graphs With Monotone Topology Properties and Multiple Connected Components
Pavéz, E., Egilmez, H. E., & Ortega, A. (2018) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2018.2813337 · Cited by 54
Multi-kernel based nonlinear models for connectivity identification of brain networks
Karanikolas, G. V., Giannakis, G. B., Slavakis, K., & Leahy, R. M. (2016) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.2016.7472892 · Cited by 47
Identifying the Topology of Undirected Networks From Diffused Non-Stationary Graph Signals
Shafipour, R., Segarra, S., Marques, A. G., & Mateos, G. (2021) · IEEE Open Journal of Signal Processing · doi:10.1109/ojsp.2021.3063926 · Cited by 45
Self-citationTopology identification of undirected consensus networks via sparse inverse covariance estimation
Hassan-Moghaddam, S., Dhingra, N. K., & Jovanović, M. R. (2016) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2016.7798973 · Cited by 38
Localizing Sources of Brain Disease Progression with Network Diffusion Model
Hu, C., Hua, X., Ying, J., Thompson, P. M., Fakhri, G. E., & Li, Q. (2016) · IEEE Journal of Selected Topics in Signal Processing · doi:10.1109/jstsp.2016.2601695 · Cited by 35
Network Inference via the Time-Varying Graphical LassoPreprint
Hallac, D., Park, Y., Boyd, S., & Leskovec, J. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1703.01958 · Cited by 23
Joint inference of networks from stationary graph signals
Segarra, S., Wang, Y., Uhler, C., & Marques, A. G. (2017) · Asilomar Conference on Signals, Systems and Computers (ACSSC) · doi:10.1109/acssc.2017.8335493 · Cited by 20
Self-citationDIRECTED NETWORK TOPOLOGY INFERENCE VIA GRAPH FILTER IDENTIFICATION
Shafipour, R., Segarra, S., Marques, A. G., & Mateos, G. (2018) · IEEE Data Science Workshop (DSW) · doi:10.1109/dsw.2018.8439888 · Cited by 10
Self-citation
Cited by
Non-Negative Kernel Graphs for Time-Varying Signals Using Visibility Graphs
Bozkurt, E., & Ortega, A. (2022) · 2022 30th European Signal Processing Conference (EUSIPCO) · doi:10.23919/eusipco55093.2022.9909594 · Cited by 1
Metadata
- Authors
- Mateos, G., Segarra, S., Marques, A. G., & Ribeiro, A.
- Venue
- IEEE Signal Processing Magazine
- Published
- 2019-05
- Volume
- 36
- Issue
- 3
- Pages
- 16-43
- ISSN
- 1053-5888 (ISSN-L)
- 1558-0792
- OpenAlex
- W2994097903
- Cited by
- 369
- References
- 57
- FWCI
- 22.79
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.