Report - Distributed Computing Group

Many systems in the world can be usefully represented as networks. Examples are social networks, link structures in encyclopedias or the world wide web, or data structures in computer science. Embedding this networks into Euclidean space provides several advantages like visualization, fast distance calculations, a notion of direction, etc., and enables new applications. First, a generic and extensible framework, together with a graphical user interface, for embedding, analyzing, and visualizing graphs is presented.

It enables a simple way of de ning and plugging layout measurements to determine the quality of embeddings and be able to compare di erent embeddings. It helps nding the right con guration consisting of algorithm, parameters, and heuristics to obtain a adequate layout for a designated application. As another advantage, it provides a basic infrastructure for testing and evaluating new embedding ideas and algorithms. Second, a novel incremental embedding method, where new nodes are added to the existing lay- out, based on forecast is presented and evaluated with the framework. Based on our preliminary experiments, we evaluate and analyze strengths and shortcomings of the approach. Contents 1 Introduction 8 1.1 Embedding Graphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 2 Part I: Framework 10 2.1 Problem Description . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 2.2 Requirements . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 2.3 Related Work . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11 2.4 Choosing a Library . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11 2.5 Extensions for JUNG . . . . . . . . . . . . . . . . . ....

Website: disco.ethz.ch | Filesize: -
No of Page(s): 45
Download Report - Distributed Computing Group.pdf