CutTheTail: An Accurate and Space-Efficient Heuristic Algorithm for Influence Maximization
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Abstract Algorithmic problem of computing the most influential nodes in an arbitrary graph (influence maximization) is an important theoretical and practical problem and has been extensively studied for decades. For massive graphs (e.g. modelling huge social networks), randomized algorithms are the answer as the exact computation is prohibitively complex, both for runtime and space. This paper concentrates on developing new accurate and efficient randomized algorithms that drastically cut the memory footprint and scale up the computation of the most influential nodes. Implementing the Reverse Influence Sampling method proposed by Borgs, Brautbar, Chayes and Lucier in 2013, we engineered a novel algorithm, CutTheTail (CTT), which solves the problem of influence maximization (IM) while using up to five orders of magnitude smaller space than the existing renown algorithms. CTT is a heuristic algorithm. We tested the accuracy of CTT on large real-world graphs using Monte Carlo simulation as the benchmark and comparing the quality of CTT solution to the algorithms with theoretically proven guaranteed approximation to optimal. Experiments show that CTT provides solutions with the quality equal to the quality of such algorithms. Savings in required space allow to successfully run CTT on a consumer-grade laptop for a graph with almost a billion of edges. To the best of our knowledge, no other IM algorithm can compute a solution on such a scale using a 16 GB RAM laptop.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it