The Structure of Optimal and Near Optimal Target Sets in Consensus Models

Published

December 19, 2014

Author(s)

Fern Y. Hunt

Abstract

We consider the problem of identifying a subset of nodes in a network that will enable the fastest spread of information in a decentralized environment. In a model of communication based on a random walk on an undirected graph, the optimal set over all sets of the same or smaller cardinality, minimizes the sum of the mean first arrival times to the set by walkers starting at nodes outside the set. We provide sufficient conditions for the existence of a greedoid that contains feasible optimal and near optimal sets. It may therefore be possible to search for optimal or near optimal sets by local moves in a stepwise manner to obtain near optimal sets that are better approximations than the factor (1 − 1/e) degree of optimality guaranteed by the use of the greedy algorithm.

Citation

Special Publication (NIST SP) - 500-303

Report Number

500-303

NIST Pub Series

Special Publication (NIST SP)

Pub Type

NIST Pubs

Download Paper

DOI Link

Keywords

random walk on graph, network spread, consensus models

Citation

Hunt, F. (2014), The Structure of Optimal and Near Optimal Target Sets in Consensus Models, Special Publication (NIST SP), National Institute of Standards and Technology, Gaithersburg, MD, [online], https://doi.org/10.6028/NIST.SP.500-303 (Accessed October 1, 2025)