Copertina

A Generalisation of Voter Model: Influential Nodes and Convergence Properties

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Manohara, Abhiram, Zehmakan, Ahad N.
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Social and Information Networks Artificial Intelligence Data Structures and Algorithms
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

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

Errors are Robustly Tamed in Cumulative Knowledge Processes
di: Brandenberger, Anna, et al.
Pubblicazione: (2023)

A Comprehensive Survey on Graph Reduction: Sparsification, Coarsening, and Condensation
di: Hashemi, Mohammad, 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)

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

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

A novel DFS/BFS approach towards link prediction
di: Dörpinghaus, Jens, et al.
Pubblicazione: (2024)

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

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

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

Node Similarities under Random Projections: Limits and Pathological Cases
di: Tadić, Tvrtko, et al.
Pubblicazione: (2024)

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)

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

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

Fast Estimation of Percolation Centrality
di: Cruciani, Antonio
Pubblicazione: (2024)

On the accurate computation of expected modularity in probabilistic networks
di: Shen, Xin, et al.
Pubblicazione: (2024)

Optimizing Probabilistic Propagation in Graphs by Adding Edges
di: Bhaskara, Aditya, et al.
Pubblicazione: (2024)

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

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

Consistent Tie-Strength Labeling for Multilayer Strong Triadic Closure
di: Oettershagen, Lutz, et al.
Pubblicazione: (2024)

Local Centrality Minimization with Quality Guarantees
di: Miyauchi, Atsushi, et al.
Pubblicazione: (2024)

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

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

Graph Discovery and Source Detection in Temporal Graphs
di: Bals, Ben
Pubblicazione: (2025)

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

Multilevel Digital Contact Tracing
di: Mahapatra, Gautam, et al.
Pubblicazione: (2020)

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

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

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

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

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

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

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

Temporal Betweenness Centrality on Shortest Walks Variants
di: Naima, Mehdi
Pubblicazione: (2023)

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

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

On the External Validity of Average-Case Analyses of Graph Algorithms
di: Bläsius, Thomas, et al.
Pubblicazione: (2022)

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