A Framework for Path-Oriented Network Simplification

Abstract. We propose a generic framework and methods for simplification of large networks. The methods can be used to improve the understandability of a given network, to complement user-centric analysis methods, or as a pre-processing step for computationally more complex methods. The approach is path-oriented: edges are pruned while keeping the original quality of best paths between all pairs of nodes (but not necessarily all best paths). The framework is applicable to different kinds of graphs (for instance flow networks and random graphs) and connections can be measured in different ways (for instance by the shortest path, maximum flow, or maximum probability). It has relative neighborhood graphs, spanning trees, and certain Pathfinder graphs as its special cases. We give four algorithmic variants and report on experiments with 60 real biological networks. The simplification methods are part of ongoing projects for intelligent analysis of networked information.

• Type: Conference
• Year: 2010
• Where: IDA
• Authors: Hannu Toivonen, Sébastien Mahler, Fang Zhou
• Keywords: IDA 2010, Information Management, Instance Flow Networks, Relative Neighborhood Graphs, User-centric Analysis Methods