Cover Image

Locally Differentially Private Graph Clustering via the Power Iteration Method

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Suppakitpaisarn, Vorapong, Mukherjee, Sayan
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms Social and Information Networks
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Counting Graphlets of Size $k$ under Local Differential Privacy
by: Suppakitpaisarn, Vorapong, et al.
Published: (2025)

Local Differential Privacy-Preserving Spectral Clustering for General Graphs
by: Mukherjee, Sayan, et al.
Published: (2023)

Cycle Counting under Local Differential Privacy for Degeneracy-bounded Graphs
by: Hillebrand, Quentin, et al.
Published: (2024)

Publishing Below-Threshold Triangle Counts under Local Weight Differential Privacy
by: Pfisterer, Kevin, et al.
Published: (2026)

Improved Differentially Private Algorithms for Rank Aggregation
by: Hillebrand, Quentin, et al.
Published: (2025)

Adaptive Local Clustering over Attributed Graphs
by: Zheng, Haoran, et al.
Published: (2025)

Approximation Algorithms for the $b$-Matching and List-Restricted Variants of MaxQAP
by: Nanta, Jiratchaphat, et al.
Published: (2025)

Minsum Problem for Discrete and Weighted Set Flow on Dynamic Path Network
by: Manna, Bubai, et al.
Published: (2024)

Robust Parameter Fitting to Realistic Network Models via Iterative Stochastic Approximation
by: Bläsius, Thomas, et al.
Published: (2024)

Near-Optimal Differentially Private k-Core Decomposition
by: Dhulipala, Laxman, et al.
Published: (2023)

Mixing Time Matters: Accelerating Effective Resistance Estimation via Bidirectional Method
by: Cui, Guanyu, et al.
Published: (2025)

On Approximating the Dynamic and Discrete Network Flow Problem
by: Manna, Bubai, et al.
Published: (2024)

Provably Extending PageRank-based Local Clustering Algorithm to Weighted Directed Graphs with Self-Loops and to Hypergraphs
by: Li, Zihao, et al.
Published: (2024)

ProbeWalk: Fast Estimation of Biharmonic Distance on Graphs via Probe-Driven Random Walks
by: Zheng, Dehong, et al.
Published: (2025)

Graph Discovery and Source Detection in Temporal Graphs
by: Bals, Ben
Published: (2025)

An Improved Combinatorial Algorithm for Edge-Colored Clustering in Hypergraphs
by: Han, Seongjune, et al.
Published: (2026)

Local Centrality Minimization with Quality Guarantees
by: Miyauchi, Atsushi, et al.
Published: (2024)

Efficient and Adaptive Estimation of Local Triadic Coefficients
by: Sarpe, Ilie, et al.
Published: (2025)

Optimizing Probabilistic Propagation in Graphs by Adding Edges
by: Bhaskara, Aditya, et al.
Published: (2024)

On the External Validity of Average-Case Analyses of Graph Algorithms
by: Bläsius, Thomas, et al.
Published: (2022)

A Spanning-Tree-Based Algorithm for Planar Graph Dismantling
by: You, Fangchen
Published: (2025)

Covering a Graph with Dense Subgraph Families, via Triangle-Rich Sets
by: Basu, Sabyasachi, et al.
Published: (2024)

Linear-Time Exact Computation of Influence Spread on Bounded-Pathwidth Graphs
by: Nakamura, Kengo, et al.
Published: (2026)

A Fully-dynamic Approximation Algorithm for Maximum Weight b-Matchings in Graphs
by: Brandt-Tumescheit, Fabian, et al.
Published: (2024)

Densest Subhypergraph: Negative Supermodular Functions and Strongly Localized Methods
by: Huang, Yufan, et al.
Published: (2023)

Equalizing Closeness Centralities via Edge Additions
by: Crane, Alex, et al.
Published: (2025)

Adaptive Power Iteration Method for Differentially Private PCA
by: Nguyen, Ta Duy, et al.
Published: (2026)

Fast Approximate CoSimRanks via Random Projections
by: Yang, Renchi, et al.
Published: (2020)

$k$-local Graphs
by: Beth, Christian, et al.
Published: (2024)

Exact Graph Matching in Correlated Gaussian-Attributed Erdős-Rényi Model
by: Yang, Joonhyuk, et al.
Published: (2024)

Differential Privacy on Trust Graphs
by: Ghazi, Badih, et al.
Published: (2024)

Outperforming Dijkstra on Sparse Graphs: The Lightning Network Use Case
by: Valko, Danila, et al.
Published: (2025)

inGRASS: Incremental Graph Spectral Sparsification via Low-Resistance-Diameter Decomposition
by: Aghdaei, Ali, et al.
Published: (2024)

Combinatorial Approximations for Cluster Deletion: Simpler, Faster, and Better
by: Balmaseda, Vicente, et al.
Published: (2024)

A Sublinear-Time Spectral Clustering Oracle with Improved Preprocessing Time
by: Shen, Ranran, et al.
Published: (2023)

Fast Percolation Centrality Approximation with Importance Sampling
by: Cruciani, Antonio, et al.
Published: (2025)

The Vertex-Attribute-Constrained Densest $k$-Subgraph Problem
by: Lu, Qiheng, et al.
Published: (2025)

An Asymptotically Optimal Approximation Algorithm for Multiobjective Submodular Maximization at Scale
by: Spaeh, Fabian, et al.
Published: (2025)

Efficient Sampling of Temporal Networks with Preserved Causality Structure
by: Stamm, Felix I., et al.
Published: (2025)

Towards Tight Bounds for Estimating Degree Distribution in Streaming and Query Models
by: Bishnu, Arijit, et al.
Published: (2025)