We consider a collaborative online learning paradigm, wherein a group of agents connected
through a social network are engaged in learning a stochastic multi-armed bandit problem …

We design the first node-differentially private algorithm for approximating the number of
connected components in a graph. Given a database representing an n-vertex graph G and …

We analyze the performance of membrane filters represented by pore networks using two
criteria:(1) total volumetric throughput of filtrate over the filter lifetime and (2) accumulated …

We introduce a random hypergraph model for core-periphery structure. By leveraging our
model's sufficient statistics, we develop a novel statistical inference algorithm that is able to …

Understanding the relationship between individuals' social networks and health could help
devise public health interventions for reducing incidence of unhealthy behaviors or …

We investigate linear bandits in a network setting in the presence of side-observations
across nodes in order to design recommendation algorithms for users connected via social …

Incorrect sensor readings can cause serious problems in Wireless Sensor Networks
(WSNs), potentially disrupting the operation of the entire system. As shown in the literature …

A key generative principle within social and other complex networks is transitivity, where
friends of friends are more likely friends. We propose a new model for highly dense complex …

In this paper we devise a generative random network model with core–periphery properties
whose core nodes act as sublinear dominators, that is, if the network has n nodes, the core …

We consider a biased version of Maker-Breaker domination games, which were recently
introduced by Gledel, Ir {\v {s}} i {\v {c}}, and Klav {\v {z}} ar. Two players, Dominator and …