Saved in:
| Main Author: | Rocha, Isabela |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2404.19257 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Parallel Algorithms for Median Consensus Clustering in Complex Networks
by: Hussain, Md Taufique, et al.
Published: (2024)
by: Hussain, Md Taufique, et al.
Published: (2024)
Bonsai: A class of effective methods for independent sampling of graph partitions
by: Clelland, Jeanne, et al.
Published: (2026)
by: Clelland, Jeanne, et al.
Published: (2026)
Dynamically Maintaining the Persistent Homology of Time Series
by: di Montesano, Sebastiano Cultrera, et al.
Published: (2023)
by: di Montesano, Sebastiano Cultrera, et al.
Published: (2023)
Fast Algorithms for Minimum Homology Basis
by: Dhar, Amritendu, et al.
Published: (2021)
by: Dhar, Amritendu, et al.
Published: (2021)
Profit Maximization in Closed Social Networks
by: Sharma, Poonam, et al.
Published: (2026)
by: Sharma, Poonam, et al.
Published: (2026)
Enabling Asymptotic Truth Learning in a Social Network
by: Lu, Kevin, et al.
Published: (2024)
by: Lu, Kevin, et al.
Published: (2024)
Opinion Maximization in Social Networks by Modifying Internal Opinions
by: Wang, Gengyu, et al.
Published: (2025)
by: Wang, Gengyu, et al.
Published: (2025)
Counting Balanced Triangles on Social Networks With Uncertain Edge Signs
by: Zhou, Alexander, et al.
Published: (2026)
by: Zhou, Alexander, et al.
Published: (2026)
Counting Graphlets of Size $k$ under Local Differential Privacy
by: Suppakitpaisarn, Vorapong, et al.
Published: (2025)
by: Suppakitpaisarn, Vorapong, et al.
Published: (2025)
The Theory and Practice of Computing the Bus-Factor
by: Piccolo, Sebastiano A., et al.
Published: (2026)
by: Piccolo, Sebastiano A., et al.
Published: (2026)
Controlling the Spread of Epidemics on Networks with Differential Privacy
by: Nguyen, Dung, et al.
Published: (2025)
by: Nguyen, Dung, et al.
Published: (2025)
BBK: a simpler, faster algorithm for enumerating maximal bicliques in large sparse bipartite graphs
by: Baudin, Alexis, et al.
Published: (2024)
by: Baudin, Alexis, et al.
Published: (2024)
Faster maximal clique enumeration in large real-world link streams
by: Baudin, Alexis, et al.
Published: (2023)
by: Baudin, Alexis, et al.
Published: (2023)
Finding Near-Optimal Maximum Set of Disjoint $k$-Cliques in Real-World Social Networks
by: Lin, Wenqing, et al.
Published: (2025)
by: Lin, Wenqing, et al.
Published: (2025)
Revisiting Information Cascades in Online Social Networks
by: Sidorov, Michael, et al.
Published: (2022)
by: Sidorov, Michael, et al.
Published: (2022)
Error-Tolerant E-Discovery Protocols
by: Dong, Jinshuo, et al.
Published: (2024)
by: Dong, Jinshuo, et al.
Published: (2024)
On the Complexity of Community-aware Network Sparsification
by: Herrendorf, Emanuel, et al.
Published: (2024)
by: Herrendorf, Emanuel, et al.
Published: (2024)
Inferring Tie Strength in Temporal Networks
by: Oettershagen, Lutz, et al.
Published: (2022)
by: Oettershagen, Lutz, et al.
Published: (2022)
An Edge-Based Decomposition Framework for Temporal Networks
by: Oettershagen, Lutz, et al.
Published: (2023)
by: Oettershagen, Lutz, et al.
Published: (2023)
Efficient Sampling of Temporal Networks with Preserved Causality Structure
by: Stamm, Felix I., et al.
Published: (2025)
by: Stamm, Felix I., et al.
Published: (2025)
Overcoming Non-Submodularity: Towards Constant Approximation for Network Immunization
by: Srivastava, Ajitesh, et al.
Published: (2024)
by: Srivastava, Ajitesh, et al.
Published: (2024)
Scalable Algorithm for Finding Balanced Subgraphs with Tolerance in Signed Networks
by: Chen, Jingbang, et al.
Published: (2024)
by: Chen, Jingbang, et al.
Published: (2024)
Pack and Measure: An Effective Approach for Influence Propagation in Social Networks
by: Abu-Khzam, Faisal N., et al.
Published: (2023)
by: Abu-Khzam, Faisal N., et al.
Published: (2023)
Catch Me If You Can: Finding the Source of Infections in Temporal Networks
by: Bals, Ben, et al.
Published: (2024)
by: Bals, Ben, et al.
Published: (2024)
Sequential non-determinism in tile self-assembly: a general framework and an application to efficient temperature-1 self-assembly of squares
by: Furcy, David, et al.
Published: (2024)
by: Furcy, David, et al.
Published: (2024)
Robust Parameter Fitting to Realistic Network Models via Iterative Stochastic Approximation
by: Bläsius, Thomas, et al.
Published: (2024)
by: Bläsius, Thomas, et al.
Published: (2024)
Towards Asimov's Psychohistory: Harnessing Topological Data Analysis, Artificial Intelligence and Social Media data to Forecast Societal Trends
by: Rocha, Isabela
Published: (2024)
by: Rocha, Isabela
Published: (2024)
Temporal Triadic Closure: Finding Dense Structures in Social Networks That Evolve
by: Davot, Tom, et al.
Published: (2024)
by: Davot, Tom, 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)
by: Lu, Qiheng, et al.
Published: (2024)
ReeSPOT: Reeb Graph Models Semantic Patterns of Normalcy in Human Trajectories
by: Zhang, Bowen, et al.
Published: (2024)
by: Zhang, Bowen, et al.
Published: (2024)
Seed Selection in the Heterogeneous Moran Process
by: Petsinis, Petros, et al.
Published: (2024)
by: Petsinis, Petros, et al.
Published: (2024)
Calibrated Recommendations for Users with Decaying Attention
by: Kleinberg, Jon, et al.
Published: (2023)
by: Kleinberg, Jon, et al.
Published: (2023)
Triangle Centrality
by: Burkhardt, Paul
Published: (2021)
by: Burkhardt, Paul
Published: (2021)
Geometry helps in routing scalability
by: Piekenbrock, Matt
Published: (2024)
by: Piekenbrock, Matt
Published: (2024)
Generalizing Fair Top-$k$ Selection: An Integrative Approach
by: Cai, Guangya
Published: (2026)
by: Cai, Guangya
Published: (2026)
Outperforming Dijkstra on Sparse Graphs: The Lightning Network Use Case
by: Valko, Danila, et al.
Published: (2025)
by: Valko, Danila, et al.
Published: (2025)
Effective Individual Fairest Community Search over Heterogeneous Information Networks
by: Zhao, Taige, et al.
Published: (2024)
by: Zhao, Taige, et al.
Published: (2024)
On Approximating the Dynamic and Discrete Network Flow Problem
by: Manna, Bubai, et al.
Published: (2024)
by: Manna, Bubai, et al.
Published: (2024)
Maximum Defective Clique Computation: Improved Time Complexities and Practical Performance
by: Chang, Lijun
Published: (2024)
by: Chang, Lijun
Published: (2024)
A Fully-dynamic Approximation Algorithm for Maximum Weight b-Matchings in Graphs
by: Brandt-Tumescheit, Fabian, et al.
Published: (2024)
by: Brandt-Tumescheit, Fabian, et al.
Published: (2024)
Similar Items
-
Parallel Algorithms for Median Consensus Clustering in Complex Networks
by: Hussain, Md Taufique, et al.
Published: (2024) -
Bonsai: A class of effective methods for independent sampling of graph partitions
by: Clelland, Jeanne, et al.
Published: (2026) -
Dynamically Maintaining the Persistent Homology of Time Series
by: di Montesano, Sebastiano Cultrera, et al.
Published: (2023) -
Fast Algorithms for Minimum Homology Basis
by: Dhar, Amritendu, et al.
Published: (2021) -
Profit Maximization in Closed Social Networks
by: Sharma, Poonam, et al.
Published: (2026)