Identifying sparse and dense sub-graphs in large graphs with a fast algorithm (original) (raw)
Related papers
Dense Subgraph Extraction with Application to Community Detection
IEEE Transactions on Knowledge and Data Engineering, 2012
Finding Dense Subgraphs for Sparse Undirected, Directed, and Bipartite Graphs
2009
From graphs to signals and back: Identification of graph structures using spectral analysis
2015
Learning Erdős-Rényi Graphs under Partial Observations: Concentration or Sparsity?
ArXiv, 2019
Graph Signal Processing -- Part I: Graphs, Graph Spectra, and Spectral Clustering
arXiv (Cornell University), 2019
Graph Signal Processing - Part III: Machine Learning on Graphs, from Graph Topology to Applications
ArXiv, 2020
Concentration of Random Graphs and Application to Community Detection
Proceedings of the International Congress of Mathematicians (ICM 2018), 2019
Finding communities in sparse networks
Scientific Reports, 2015
A unified framework for spectral clustering in sparse graphs
ArXiv, 2020
Planted Dense Subgraphs in Dense Random Graphs Can Be Recovered using Graph-based Machine Learning
2022
Graph Learning with Partial Observations: Role of Degree Concentration
2019 IEEE International Symposium on Information Theory (ISIT), 2019
Fast Community Detection with Graph Sparsification
Advances in Knowledge Discovery and Data Mining, 2020
Large Very Dense Subgraphs in a Stream of Edges
Proceedings of the 2020 ACM-IMS on Foundations of Data Science Conference, 2020
Graph Signal Processing: Foundations and Emerging Directions [From the Guest Editors]
IEEE Signal Processing Magazine
Sparse random graphs: regularization and concentration of the Laplacian
2015
Bounded Arboricity to Determine the Local Structure of Sparse Graphs
Lecture Notes in Computer Science, 2006
Data Analytics on Graphs Part III: Machine Learning on Graphs, from Graph Topology to Applications
Foundations and Trends® in Machine Learning, 2020
From graphs to signals and back: Identification of network structures using spectral analysis
arXiv (Cornell University), 2015
Title Sparse random graphs : regularization and concentration of the Laplacian Permalink
Discovering large dense subgraphs in massive graphs
2005
On Local Distributions in Graph Signal Processing
ArXiv, 2022
Inference and phase transitions in the detection of modules in sparse networks
2011
Learning Graphs From Smooth and Graph-Stationary Signals With Hidden Variables
IEEE Transactions on Signal and Information Processing over Networks, 2022
Joint Inference of Multiple Graphs with Hidden Variables from Stationary Graph Signals
ICASSP 2022 - 2022 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)
Graph Learning Over Partially Observed Diffusion Networks: Role of Degree Concentration
IEEE Open Journal of Signal Processing
Concentration and regularization of random graphs
Random Structures & Algorithms, 2017
Estimating Community Structure in Networks by Spectral Methods
2016
A Sparse Matrix Approach for Covering Large Complex Networks by Cliques
2020
Community Detection in Complex Networks via Clique Conductance
Scientific Reports, 2018
2009