Wiggins: Detecting Valuable Information in Dynamic Networks with Limited Resources

This post introduces Wiggins, an algorithm for detecting valuable information in dynamic networks with limited resources. It addresses the problem of optimizing a probing schedule to minimize the average novelty of undetected items when only a small subset of nodes can be probed at each time step. The algorithm uses convex optimization to compute the optimal schedule and includes a scalable variant for the MapReduce framework. The work also touches upon dynamic graph analysis by presenting a method for triangle counting in dynamic graphs.