@inproceedings{1e6a40152ed94c758872284f082743b1,
title = "Impact neighborhood indexing (INI) in diffusion graphs",
abstract = "A graph neighborhood consists of a set of nodes that are nearby or otherwise related to each other. While existing definitions consider the structure (or topology) of the graph, we note that they fail to take into account the information propagation and diffusion characteristics, such as decay and reinforcement, common in many networks. In this paper, we first define the propagation efficiency of nodes and edges. We use this to introduce the novel concept of zero-erasure (or impact) neighborhood (ZEN) of a given node, n, consisting of the set of nodes that receive information from (or are impacted by) n without any decay. Based on this, we present an impact neighborhood indexing (INI) algorithm that creates data structures to help quickly identify impact neighborhood of any given node. Experiment results confirm the efficiency and effectiveness of the proposed INI algorithms.",
keywords = "graph neighborhood, impact propagation, indexing",
author = "Kim, {Jung Hyun} and Kasim Candan and Sapino, {Maria Luisa}",
year = "2012",
doi = "10.1145/2396761.2398598",
language = "English (US)",
isbn = "9781450311564",
series = "ACM International Conference Proceeding Series",
pages = "2184--2188",
booktitle = "CIKM 2012 - Proceedings of the 21st ACM International Conference on Information and Knowledge Management",
note = "21st ACM International Conference on Information and Knowledge Management, CIKM 2012 ; Conference date: 29-10-2012 Through 02-11-2012",
}