activity
20012024
most citedNearly-Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems

71 citations · 437 across the 49 of their papers we have counts for

collaborators
Showing 2014Show all

5 papers · 1 filter

cs.DS2014★ 5 cited

Scalable Parallel Factorizations of SDD Matrices and Efficient Sampling for Gaussian Graphical Models

Dehua Cheng, Yu Cheng, Yan Liu +2

Motivated by a sampling problem basic to computational statistical inference, we develop a nearly optimal algorithm for a fundamental problem in spectral graph theory and numerical…

cs.SI2014★ 2 cited

Fixed-Points of Social Choice: An Axiomatic Approach to Network Communities

Christian Borgs, Jennifer Chayes, Adrian Marple +1

We provide the first social choice theory approach to the question of what constitutes a community in a social network. Inspired by the classic preferences models in social choice…

cs.GT2014

Signaling in Quasipolynomial time

Yu Cheng, Ho Yee Cheung, Shaddin Dughmi +1

Strategic interactions often take place in an environment rife with uncertainty. As a result, the equilibrium of a game is intimately related to the information available to its pl…

cs.LG2014★ 2 cited

Efficient Clustering with Limited Distance Information

Konstantin Voevodski, Maria-Florina Balcan, Heiko Roglin +2

Given a point set S and an unknown metric d on S, we study the problem of efficiently partitioning S into k clusters while querying few distances between the points. In our model w…

cs.SI2014★ 26 cited

The Interplay Between Dynamics and Networks: Centrality, Communities, and Cheeger Inequality

Rumi Ghosh, Kristina Lerman, Shang-Hua Teng +1

We study the interplay between a dynamic process and the structure of the network on which it is defined. Specifically, we examine the impact of this interaction on the quality-mea…