2 citations · 5 across the 4 of their papers we have counts for
4 papers
Using First Hitting Times to Find Sets that Maximize the Convergence Rate to Consensus
Fern Y. Hunt
In a model of communication in a social network described by a simple consensus model, we pose the problem of finding a subset of nodes with given cardinality and fixed consensus v…
Finding Optimal Sinks for Random Walkers in a Network
F. Y. Hunt
In a model of network communication based on a random walk in an undirected graph, what subset of nodes (subject to constraints on the set size), enables the fastest spread of info…
The Structure of Optimal and Near Optimal Target Sets in Consensus Models
Fern Y. Hunt
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…
Optimal Spread in Network Consensus Models
Fern Y. Hunt
In a model of network communication based on a random walk in an undirected graph, what subset of nodes (subject to constraints on the set size), enable the fastest spread of infor…