betaFeedback

WorksComputer Science

Multi-seed information diffusion with varying reproduction

Abstract

We define the ShRkS_hR_k-process that generalizes the notion of Hamiltonicity through the lense of information diffusion. We say that a graph is ShRkS_hR_k-infectable if it can be fully infected by transmission trees seeded by at most hh initial infections in which each infection leads to at most kk others; or, equivalently, if it can be exactly vertex-covered by at most hh trees of degree at most kk. While determining ShRkS_hR_k infectability is NP-hard in general, we argue fixed-parameter tractability when parameterised by treewidth. Additionally, we give computational experimental results comparing the performance of several natural heuristics for minimising the number of initial infections required to an optimal LP-based approach on several standard complex network models. We find that a uniformly random approach outperforms greedy heuristics based on degree or clustering.

Paper details

vlnc:W_a65tcmtr
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC-BY-NC-ND-4.0
Usage

views · 1

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Computer Science

Not recorded for this paper

View statement
Looking for related papers…