Imagen de Portada

Efficient Sampling of Temporal Networks with Preserved Causality Structure

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Stamm, Felix I., Naima, Mehdi, Schaub, Michael T.
Formato:	Preprint
Publicado:	2025
Materias:	Social and Information Networks Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

Faster optimal univariate microgaggregation
por: Stamm, Felix I., et al.
Publicado: (2024)

MANTRA: Temporal Betweenness Centrality Approximation through Sampling
por: Cruciani, Antonio
Publicado: (2023)

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

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

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

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

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

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

Random Abstract Cell Complexes
por: Hoppe, Josef, et al.
Publicado: (2024)

Beyond Uniform Reverse Sampling: A Hybrid Sampling Technique for Misinformation Prevention
por: Tong, Gunagmo, et al.
Publicado: (2019)

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

Scalable Temporal Motif Densest Subnetwork Discovery
por: Sarpe, Ilie, et al.
Publicado: (2024)

Accurate and Fast Estimation of Temporal Motifs using Path Sampling
por: Pan, Yunjie, et al.
Publicado: (2024)

Fast Percolation Centrality Approximation with Importance Sampling
por: Cruciani, Antonio, et al.
Publicado: (2025)

Triadic First-Order Logic Queries in Temporal Networks
por: Bhalerao, Omkar, et al.
Publicado: (2025)

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

Efficient and Adaptive Estimation of Local Triadic Coefficients
por: Sarpe, Ilie, et al.
Publicado: (2025)

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

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

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

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

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

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

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

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

An Efficient Streaming Algorithm for Approximating Graphlet Distributions
por: Bressan, Marco, et al.
Publicado: (2026)

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

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

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

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

The Vertex-Attribute-Constrained Densest $k$-Subgraph Problem
por: Lu, Qiheng, et al.
Publicado: (2025)

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

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

Towards Tight Bounds for Estimating Degree Distribution in Streaming and Query Models
por: Bishnu, Arijit, et al.
Publicado: (2025)

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

Locally Differentially Private Graph Clustering via the Power Iteration Method
por: Suppakitpaisarn, Vorapong, et al.
Publicado: (2025)

Mixing Time Matters: Accelerating Effective Resistance Estimation via Bidirectional Method
por: Cui, Guanyu, 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)