Fern Hunt

Publications

Fast Methods for Finding Multiple Effective Influencers in Real Networks

December 31, 2020

Author(s)

Fern Y. Hunt, Roldan Pozo

We present scalable first hitting time methods for finding a collection of nodes that enables the fastest time for the spread of consensus in a network. That is

An Algorithm for Identifying Optimal Spreaders in a Random Walk Model of Network Communication

May 10, 2016

Author(s)

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 its size), enable the fastest

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

December 19, 2014

Author(s)

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

Optimal Spread in Network Consensus Models

January 27, 2014

Author(s)

Fern Y. Hunt

Suppose we seek a set of nodes in a network that will enable the fastest spread of information in a decentralized communication environment. If communication

A Mathematical Model of Joint Congestion Control and Routing in Multisource Networks

September 28, 2011

Author(s)

Fern Y. Hunt, Vladimir V. Marbukh, Yi Wang

In this paper we study a model of joint congestion control and routing in a ring of network sources with a single destination at the center. A utility

View more Publications

Fern Hunt (Assoc)

Research Interests:

Projects:

Publications

Fast Methods for Finding Multiple Effective Influencers in Real Networks

An Algorithm for Identifying Optimal Spreaders in a Random Walk Model of Network Communication

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

Optimal Spread in Network Consensus Models

A Mathematical Model of Joint Congestion Control and Routing in Multisource Networks