207 citations · 1.3k across the 53 of their papers we have counts for
10 papers · 1 filter
Optimizing Robustness against Cascading Failures under Max-Load Targeted Attack
Omur Ozel, Bruno Sinopoli, Osman Yagan
Motivated by reliability of networks in critical infrastructures, we consider optimal robustness of a class of flow networks against a \textit{targeted} attack, namely max-load tar…
Connectivity of inhomogeneous random K-out graphs
Rashad Eletreby, Osman Yağan
We propose inhomogeneous random K-out graphs , where each of the nodes is assigned to one of classes independently with a probability distr…
A Unified Approach to Translate Classical Bandit Algorithms to the Structured Bandit Setting
Samarth Gupta, Shreyas Chaudhari, Subhojyoti Mukherjee +2
We consider a finite-armed structured bandit problem in which mean rewards of different arms are known functions of a common hidden parameter . Since we do not place any restr…
The Effects of Evolutionary Adaptations on Spreading Processes in Complex Networks
Rashad Eletreby, Yong Zhuang, Kathleen M. Carley +2
A common theme among the proposed models for network epidemics is the assumption that the propagating object, i.e., a virus or a piece of information, is transferred across the nod…
Active Distribution Learning from Indirect Samples
Samarth Gupta, Gauri Joshi, Osman Yağan
This paper studies the problem of {\em learning} the probability distribution of a discrete random variable using indirect and sequential samples. At each time step, we c…
Correlated Multi-armed Bandits with a Latent Random Source
Samarth Gupta, Gauri Joshi, Osman Yağan
We consider a novel multi-armed bandit framework where the rewards obtained by pulling the arms are functions of a common latent random variable. The correlation between arms due t…