Persistent Homology generalizations for Social Media Network Analysis

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autore principale:	Rocha, Isabela
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Computers and Society Computational Geometry Data Structures and Algorithms Social and Information Networks
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Dynamically Maintaining the Persistent Homology of Time Series
di: di Montesano, Sebastiano Cultrera, et al.
Pubblicazione: (2023)

Parallel Algorithms for Median Consensus Clustering in Complex Networks
di: Hussain, Md Taufique, et al.
Pubblicazione: (2024)

Bonsai: A class of effective methods for independent sampling of graph partitions
di: Clelland, Jeanne, et al.
Pubblicazione: (2026)

Fast Algorithms for Minimum Homology Basis
di: Dhar, Amritendu, et al.
Pubblicazione: (2021)

Profit Maximization in Closed Social Networks
di: Sharma, Poonam, et al.
Pubblicazione: (2026)

Enabling Asymptotic Truth Learning in a Social Network
di: Lu, Kevin, et al.
Pubblicazione: (2024)

Opinion Maximization in Social Networks by Modifying Internal Opinions
di: Wang, Gengyu, et al.
Pubblicazione: (2025)

Counting Balanced Triangles on Social Networks With Uncertain Edge Signs
di: Zhou, Alexander, et al.
Pubblicazione: (2026)

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

The Theory and Practice of Computing the Bus-Factor
di: Piccolo, Sebastiano A., et al.
Pubblicazione: (2026)

Sequential non-determinism in tile self-assembly: a general framework and an application to efficient temperature-1 self-assembly of squares
di: Furcy, David, et al.
Pubblicazione: (2024)

Error-Tolerant E-Discovery Protocols
di: Dong, Jinshuo, et al.
Pubblicazione: (2024)

Controlling the Spread of Epidemics on Networks with Differential Privacy
di: Nguyen, Dung, et al.
Pubblicazione: (2025)

On the Complexity of Community-aware Network Sparsification
di: Herrendorf, Emanuel, et al.
Pubblicazione: (2024)

Inferring Tie Strength in Temporal Networks
di: Oettershagen, Lutz, et al.
Pubblicazione: (2022)

BBK: a simpler, faster algorithm for enumerating maximal bicliques in large sparse bipartite graphs
di: Baudin, Alexis, et al.
Pubblicazione: (2024)

Faster maximal clique enumeration in large real-world link streams
di: Baudin, Alexis, et al.
Pubblicazione: (2023)

An Edge-Based Decomposition Framework for Temporal Networks
di: Oettershagen, Lutz, et al.
Pubblicazione: (2023)

Finding Near-Optimal Maximum Set of Disjoint $k$-Cliques in Real-World Social Networks
di: Lin, Wenqing, et al.
Pubblicazione: (2025)

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

Overcoming Non-Submodularity: Towards Constant Approximation for Network Immunization
di: Srivastava, Ajitesh, et al.
Pubblicazione: (2024)

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

Geometry helps in routing scalability
di: Piekenbrock, Matt
Pubblicazione: (2024)

Catch Me If You Can: Finding the Source of Infections in Temporal Networks
di: Bals, Ben, et al.
Pubblicazione: (2024)

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

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

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

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

Pack and Measure: An Effective Approach for Influence Propagation in Social Networks
di: Abu-Khzam, Faisal N., et al.
Pubblicazione: (2023)

Temporal Triadic Closure: Finding Dense Structures in Social Networks That Evolve
di: Davot, Tom, et al.
Pubblicazione: (2024)

Approximation Algorithms for Smallest Intersecting Balls
di: Zheng, Jiaqi, et al.
Pubblicazione: (2024)

On Approximating the Weighted Region Problem in Square Tessellations
di: Kakimura, Naonori, et al.
Pubblicazione: (2024)

Online sorting and online TSP: randomized, stochastic, and high-dimensional
di: Abrahamsen, Mikkel, et al.
Pubblicazione: (2024)

Bipartizing (Pseudo-)Disk Graphs: Approximation with a Ratio Better than 3
di: Lokshtanov, Daniel, et al.
Pubblicazione: (2024)

Spanners in Planar Domains via Steiner Spanners and non-Steiner Tree Covers
di: Bhore, Sujoy, et al.
Pubblicazione: (2024)

A Subquadratic Time Approximation Algorithm for Individually Fair k-Center
di: Ebbens, Matthijs, et al.
Pubblicazione: (2024)

Extraction Theorems With Small Extraction Numbers
di: Agarwal, Arjun, et al.
Pubblicazione: (2024)

Fréchet Distance in Subquadratic Time
di: Cheng, Siu-Wing, et al.
Pubblicazione: (2024)

Computing largest minimum color-spanning intervals of imprecise points
di: Acharyya, Ankush, et al.
Pubblicazione: (2024)

Computing Diameter +1 in Truly Subquadratic Time for Unit-Disk Graphs
di: Chang, Hsien-Chih, et al.
Pubblicazione: (2024)