:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Sidorov, Michael, Vilenchik, Dan
Format:	Preprint
Publié:	2022
Sujets:	Social and Information Networks Data Structures and Algorithms Machine Learning
Accès en ligne:	https://arxiv.org/abs/2208.00904
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Fair Minimum Labeling: Efficient Temporal Network Activations for Reachability and Equity
par: Oettershagen, Lutz, et autres
Publié: (2025)

On the Robustness of Spectral Algorithms for Semirandom Stochastic Block Models
par: Bhaskara, Aditya, et autres
Publié: (2024)

Learn to Vaccinate: Combining Structure Learning and Effective Vaccination for Epidemic and Outbreak Control
par: Elahi, Sepehr, et autres
Publié: (2025)

Combinatorial Approximations for Cluster Deletion: Simpler, Faster, and Better
par: Balmaseda, Vicente, et autres
Publié: (2024)

Adaptive Local Clustering over Attributed Graphs
par: Zheng, Haoran, et autres
Publié: (2025)

Sublinear-Time Algorithms for Diagonally Dominant Systems and Applications to the Friedkin-Johnsen Model
par: Feng, Weiming, et autres
Publié: (2025)

inGRASS: Incremental Graph Spectral Sparsification via Low-Resistance-Diameter Decomposition
par: Aghdaei, Ali, et autres
Publié: (2024)

Provably Extending PageRank-based Local Clustering Algorithm to Weighted Directed Graphs with Self-Loops and to Hypergraphs
par: Li, Zihao, et autres
Publié: (2024)

Efficient Approximate Temporal Triangle Counting in Streaming with Predictions
par: Venturin, Giorgio, et autres
Publié: (2025)

A Sublinear-Time Spectral Clustering Oracle with Improved Preprocessing Time
par: Shen, Ranran, et autres
Publié: (2023)

Weighted Embeddings for Low-Dimensional Graph Representation
par: Bläsius, Thomas, et autres
Publié: (2024)

Profit Maximization in Closed Social Networks
par: Sharma, Poonam, et autres
Publié: (2026)

Node Similarities under Random Projections: Limits and Pathological Cases
par: Tadić, Tvrtko, et autres
Publié: (2024)

HITSnDIFFs: From Truth Discovery to Ability Discovery by Recovering Matrices with the Consecutive Ones Property
par: Chen, Zixuan, et autres
Publié: (2023)

Opinion Maximization in Social Networks by Modifying Internal Opinions
par: Wang, Gengyu, et autres
Publié: (2025)

Enabling Asymptotic Truth Learning in a Social Network
par: Lu, Kevin, et autres
Publié: (2024)

Counting Balanced Triangles on Social Networks With Uncertain Edge Signs
par: Zhou, Alexander, et autres
Publié: (2026)

Hypergraphs as Weighted Directed Self-Looped Graphs: Spectral Properties, Clustering, Cheeger Inequality
par: Li, Zihao, et autres
Publié: (2024)

Spectral Toolkit of Algorithms for Graphs: Technical Report (2)
par: Macgregor, Peter, et autres
Publié: (2024)

A Comprehensive Survey on Graph Reduction: Sparsification, Coarsening, and Condensation
par: Hashemi, Mohammad, et autres
Publié: (2024)

Differential Privacy on Trust Graphs
par: Ghazi, Badih, et autres
Publié: (2024)

Efficient Sampling of Temporal Networks with Preserved Causality Structure
par: Stamm, Felix I., et autres
Publié: (2025)

Finding Near-Optimal Maximum Set of Disjoint $k$-Cliques in Real-World Social Networks
par: Lin, Wenqing, et autres
Publié: (2025)

Efficient Graph Matching for Correlated Stochastic Block Models
par: Chai, Shuwen, et autres
Publié: (2024)

Spectral clustering in the Gaussian mixture block model
par: Li, Shuangping, et autres
Publié: (2023)

Effective Individual Fairest Community Search over Heterogeneous Information Networks
par: Zhao, Taige, et autres
Publié: (2024)

Inferring Tie Strength in Temporal Networks
par: Oettershagen, Lutz, et autres
Publié: (2022)

On the Complexity of Community-aware Network Sparsification
par: Herrendorf, Emanuel, et autres
Publié: (2024)

An Edge-Based Decomposition Framework for Temporal Networks
par: Oettershagen, Lutz, et autres
Publié: (2023)

Overcoming Non-Submodularity: Towards Constant Approximation for Network Immunization
par: Srivastava, Ajitesh, et autres
Publié: (2024)

Scalable Algorithm for Finding Balanced Subgraphs with Tolerance in Signed Networks
par: Chen, Jingbang, et autres
Publié: (2024)

Staying Fresh: Efficient Algorithms for Timely Social Information Distribution
par: Li, Songhua, et autres
Publié: (2023)

Pack and Measure: An Effective Approach for Influence Propagation in Social Networks
par: Abu-Khzam, Faisal N., et autres
Publié: (2023)

Catch Me If You Can: Finding the Source of Infections in Temporal Networks
par: Bals, Ben, et autres
Publié: (2024)

Robust Parameter Fitting to Realistic Network Models via Iterative Stochastic Approximation
par: Bläsius, Thomas, et autres
Publié: (2024)

Temporal Triadic Closure: Finding Dense Structures in Social Networks That Evolve
par: Davot, Tom, et autres
Publié: (2024)

Outperforming Dijkstra on Sparse Graphs: The Lightning Network Use Case
par: Valko, Danila, et autres
Publié: (2025)

On the External Validity of Average-Case Analyses of Graph Algorithms
par: Bläsius, Thomas, et autres
Publié: (2022)

Graph Discovery and Source Detection in Temporal Graphs
par: Bals, Ben
Publié: (2025)

ProbeWalk: Fast Estimation of Biharmonic Distance on Graphs via Probe-Driven Random Walks
par: Zheng, Dehong, et autres
Publié: (2025)