The Right Way to Search Evolving Graphs

Chen, Jiahao and Zhang, Weijian (2016) The Right Way to Search Evolving Graphs. [MIMS Preprint]

This is the latest version of this item.

[img] PDF
paper_final.pdf

Download (424kB)

Abstract

Evolving graphs arise in problems where interrelations between data change over time. We present a breadth first search (BFS) algorithm for evolving graphs that computes the most direct influences between nodes at two different times. Using simple examples, we show that na �ıve unfoldings of adjacency matrices miscount the number of temporal paths. By mapping an evolving graph to an adjacency matrix of an equivalent static graph, we prove that our generalization of the BFS algorithm correctly accounts for paths that traverse both space and time. Finally, we demonstrate how the BFS over evolving graphs can be applied to mine citation networks.

Item Type: MIMS Preprint
Uncontrolled Keywords: evolving graph; complex network; breadth first search; data mining
Subjects: MSC 2010, the AMS's Mathematics Subject Classification > 05 Combinatorics
MSC 2010, the AMS's Mathematics Subject Classification > 15 Linear and multilinear algebra; matrix theory
Depositing User: Mr Weijian Zhang
Date Deposited: 08 Mar 2016
Last Modified: 20 Oct 2017 14:13
URI: http://eprints.maths.manchester.ac.uk/id/eprint/2445

Available Versions of this Item

Actions (login required)

View Item View Item