The Right Way to Search Evolving Graphs

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

Warning
There is a more recent version of this item available.
[thumbnail of paper.pdf] PDF
paper.pdf
Download (291kB)

Abstract

Evolving graphs arise in many different contexts where the interrelations between data elements change over time. We present a breadth first search (BFS) algorithm for evolving graphs that can track (active) nodes correctly. Using simple examples, we show na �ıve matrix-matrix multiplication on time-dependent adjacency matrices miscounts the number of temporal paths. By mapping an evolving graph to an adjacency matrix of the equivalent static graph, we prove the properties of the BFS algorithm using the properties of the adjacency matrix. Finally, demonstrate how the BFS over evolving graphs can be applied to mining 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: 29 Jan 2016
Last Modified: 20 Oct 2017 14:13
URI: https://eprints.maths.manchester.ac.uk/id/eprint/2435

Available Versions of this Item

Actions (login required)

View Item View Item