Cover Image

Sublinear-Time Algorithms for Diagonally Dominant Systems and Applications to the Friedkin-Johnsen Model

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Feng, Weiming, Li, Zelin, Peng, Pan
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms Machine Learning Social and Information Networks
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

On the Robustness of Spectral Algorithms for Semirandom Stochastic Block Models
by: Bhaskara, Aditya, et al.
Published: (2024)

On Solving Asymmetric Diagonally Dominant Linear Systems in Sublinear Time
by: Kwok, Tsz Chiu, et al.
Published: (2025)

Sublinear-Time Opinion Estimation in the Friedkin--Johnsen Model
by: Neumann, Stefan, 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)

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

A Sublinear Algorithm for Approximate Shortest Paths in Large Networks
by: Basu, Sabyasachi, et al.
Published: (2024)

Sublinear Time Algorithm for Online Weighted Bipartite Matching
by: Hu, Hang, et al.
Published: (2022)

Learn to Vaccinate: Combining Structure Learning and Effective Vaccination for Epidemic and Outbreak Control
by: Elahi, Sepehr, et al.
Published: (2025)

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

Efficient Approximate Temporal Triangle Counting in Streaming with Predictions
by: Venturin, Giorgio, et al.
Published: (2025)

Fair Minimum Labeling: Efficient Temporal Network Activations for Reachability and Equity
by: Oettershagen, Lutz, et al.
Published: (2025)

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

Revisiting Information Cascades in Online Social Networks
by: Sidorov, Michael, et al.
Published: (2022)

Weighted Embeddings for Low-Dimensional Graph Representation
by: Bläsius, Thomas, et al.
Published: (2024)

Spectral Toolkit of Algorithms for Graphs: Technical Report (2)
by: Macgregor, Peter, et al.
Published: (2024)

On Densest $k$-Subgraph Mining and Diagonal Loading: Optimization Landscape and Finite-Step Exact Convergence Analysis
by: Lu, Qiheng, et al.
Published: (2024)

Sublinear Time Quantum Algorithm for Attention Approximation
by: Song, Zhao, et al.
Published: (2026)

Dynamic Correlation Clustering in Sublinear Update Time
by: Cohen-Addad, Vincent, et al.
Published: (2024)

Training Overparametrized Neural Networks in Sublinear Time
by: Deng, Yichuan, et al.
Published: (2022)

Scalable Algorithm for Finding Balanced Subgraphs with Tolerance in Signed Networks
by: Chen, Jingbang, et al.
Published: (2024)

Node Similarities under Random Projections: Limits and Pathological Cases
by: Tadić, Tvrtko, et al.
Published: (2024)

HITSnDIFFs: From Truth Discovery to Ability Discovery by Recovering Matrices with the Consecutive Ones Property
by: Chen, Zixuan, et al.
Published: (2023)

Fast-MWEM: Private Data Release in Sublinear Time
by: Haris, Themistoklis, et al.
Published: (2026)

Hypergraphs as Weighted Directed Self-Looped Graphs: Spectral Properties, Clustering, Cheeger Inequality
by: Li, Zihao, et al.
Published: (2024)

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

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

Staying Fresh: Efficient Algorithms for Timely Social Information Distribution
by: Li, Songhua, et al.
Published: (2023)

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

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

Terminal Embeddings in Sublinear Time
by: Cherapanamjeri, Yeshwanth, et al.
Published: (2021)

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

A Comprehensive Survey on Graph Reduction: Sparsification, Coarsening, and Condensation
by: Hashemi, Mohammad, et al.
Published: (2024)

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

Efficient Graph Matching for Correlated Stochastic Block Models
by: Chai, Shuwen, et al.
Published: (2024)

Sublinear Time Quantum Sensitivity Sampling
by: Song, Zhao, et al.
Published: (2025)

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

Maximum Defective Clique Computation: Improved Time Complexities and Practical Performance
by: Chang, Lijun
Published: (2024)

Spectral clustering in the Gaussian mixture block model
by: Li, Shuangping, et al.
Published: (2023)

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