Finding links and initiators: a graph reconstruction problem

Details Finding links and initiators: a graph reconstruction problem Finding links and initiators: a graph reconstruction problem

2008-09-17

arxiv.org/abs/0809.3027v1

Computer Science

Artificial Intelligence

Scientific paper

Consider a 0-1 observation matrix M, where rows correspond to entities and columns correspond to signals; a value of 1 (or 0) in cell (i,j) of M indicates that signal j has been observed (or not observed) in entity i. Given such a matrix we study the problem of inferring the underlying directed links between entities (rows) and finding which entries in the matrix are initiators. We formally define this problem and propose an MCMC framework for estimating the links and the initiators given the matrix of observations M. We also show how this framework can be extended to incorporate a temporal aspect; instead of considering a single observation matrix M we consider a sequence of observation matrices M1,..., Mt over time. We show the connection between our problem and several problems studied in the field of social-network analysis. We apply our method to paleontological and ecological data and show that our algorithms work well in practice and give reasonable results.

Affiliated with

Also associated with

No associations

Rating

Finding links and initiators: a graph reconstruction problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Finding links and initiators: a graph reconstruction problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Finding links and initiators: a graph reconstruction problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-280386