Imagen de Portada

Counting Balanced Triangles on Social Networks With Uncertain Edge Signs

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Zhou, Alexander, Li, Haoyang, Tian, Anxin, Li, Zhiyuan, Wang, Yue
Formato:	Preprint
Publicado:	2026
Materias:	Data Structures and Algorithms Social and Information Networks
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

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

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

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

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

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

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

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

Counting hypertriangles through hypergraph orientations
por: Paul-Pena, Daniel, et al.
Publicado: (2026)

Finding the Balance Rate of Uncertain Signed Graphs
por: Wang, Zeyu, et al.
Publicado: (2026)

Cover Edge-Based Novel Triangle Counting
por: Bader, David A., et al.
Publicado: (2024)

Triangle Centrality
por: Burkhardt, Paul
Publicado: (2021)

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

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

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

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

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

Effective Individual Fairest Community Search over Heterogeneous Information Networks
por: Zhao, Taige, et al.
Publicado: (2024)

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

Density Decomposition on Hypergraphs
por: Leng, Xiaoyu, et al.
Publicado: (2026)

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

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

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

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

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

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

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

Influence Maximization in Hypergraphs by Stratified Sampling for Efficient Generation of Reverse Reachable Sets
por: Zhang, Lingling, et al.
Publicado: (2024)

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

BEACON: A Benchmark for Efficient and Accurate Counting of Subgraphs
por: Najafi, Mohammad Matin, et al.
Publicado: (2025)

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

Graph Discovery and Source Detection in Temporal Graphs
por: Bals, Ben
Publicado: (2025)

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

Multilevel Digital Contact Tracing
por: Mahapatra, Gautam, et al.
Publicado: (2020)

Finding coherent node groups in directed graphs
por: Kumpulainen, Iiro, et al.
Publicado: (2023)

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

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

Temporal Betweenness Centrality on Shortest Walks Variants
por: Naima, Mehdi
Publicado: (2023)

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