Thursday, November 21 at 12:15pm to 1:15pm
Building C, Room 220
113 Research Dr, Bethlehem, PA 18015
Abstract: In network design, the goal is to construct or modify a network to optimize performance measures related to the dynamics of that network. Examples of network design problems include: assigning edge weights to optimize network robustness; adding a set of edges to improve network connectivity; and identifying a set of input nodes to most efficiently drive the system to desired state. Significant work has been done to analyze the complexity of many network design problems and to develop efficient algorithms for them; however, even these efficient algorithms may not scale to the size of massive networks like online social networks, as well as physical networks like the Internet of Things. In this talk, I will examine several network design problems related to robustness and connectivity. I will present strategies for scalable network design with provable performance guarantees, including analytical solutions and algorithms that run in near-linear time. Finally, I will highlight new results on network design for diversity and polarization in social networks.
Bio: Stacy Patterson is an Associate Professor in the Department of Computer Science at Rensselaer Polytechnic Institute. She received the MS and PhD in Computer Science from the University of California, Santa Barbara in 2003 and 2009, respectively. From 2009 to 2011, she was a postdoctoral scholar at the Center for Control, Dynamical Systems and Computation at the University of California, Santa Barbara. From 2011 to 2013, she was a postdoctoral fellow in the Department of Electrical Engineering at Technion - Israel Institute of Technology. Dr. Patterson is the recipient of a Viterbi postdoctoral fellowship, the IEEE CSS Axelby Outstanding Paper Award, and an NSF CAREER award. Her research interests include distributed systems, cloud and edge computing, and the Internet of Things.