This paper focuses on the consensus averaging problem on graphs under general noisy channels. We study a particular class of distributed consensus algorithms based on damped updat...
The parallel repetition theorem states that for any Two Prover Game with value at most 1 - (for < 1/2), the value of the game repeated n times in parallel is at most (1 - 3 )(n...
Abstract. Modularity was introduced as a measure of goodness for the community structure induced by a partition of the set of vertices in a graph. Then, it also became an objective...
We present Graphite, a system that allows the user to visually construct a query pattern, finds both its exact and approximate matching subgraphs in large attributed graphs, and ...
Duen Horng Chau, Christos Faloutsos, Hanghang Tong...
This paper presents a new method for visualizing and navigating huge graphs. The main feature of this method is that it applies Level-Of-Detail (LOD) strategy to graph visualizati...