Motivated by applications to sensor, peer-to-peer, and ad hoc networks, we study distributed
algorithms, also known as gossip algorithms, for exchanging information and for computing …

The algebraic connectivity of a graph is the second smallest eigenvalue of the graph Laplacian,
and is a measure of how well-connected the graph is. We study the problem of adding …

A mechanism for releasing information about a statistical database with sensitive data must
resolve a trade-off between utility and privacy. Publishing fully accurate information …

Motivated by applications to sensor, peer-to-peer and ad hoc networks, we study distributed
asynchronous algorithms, also known as gossip algorithms, for computation and information …

We consider the problem of designing a survey to aggregate non-verifiable information from
a privacy-sensitive population: an analyst wants to compute some aggregate statistic from …

The effective resistance between two nodes of a weighted graph is the electrical resistance
seen between the nodes of a resistor network with branch conductances given by the edge …

We initiate the study of markets for private data, through the lens of differential privacy.
Although the purchase and sale of private data has already begun on a large scale, a theory of …

We introduce the concept of a trust network—a decentralized payment infrastructure in which
payments are routed as IOUs between trusted entities. The trust network has directed links …

Discussion forums, employed by MOOC providers as the primary mode of interaction among
instructors and students, have emerged as one of the important components of online …

Crowdsourcing is now widely used to replace judgement or evaluation by an expert authority
with an aggregate evaluation from a number of non-experts, in applications ranging from …