Computer Science – Information Retrieval
Scientific paper
2008-02-10
Computer Science
Information Retrieval
12 pages, CSR 2008
Scientific paper
We explore a simple mathematical model of network computation, based on Markov chains. Similar models apply to a broad range of computational phenomena, arising in networks of computers, as well as in genetic, and neural nets, in social networks, and so on. The main problem of interaction with such spontaneously evolving computational systems is that the data are not uniformly structured. An interesting approach is to try to extract the semantical content of the data from their distribution among the nodes. A concept is then identified by finding the community of nodes that share it. The task of data structuring is thus reduced to the task of finding the network communities, as groups of nodes that together perform some non-local data processing. Towards this goal, we extend the ranking methods from nodes to paths. This allows us to extract some information about the likely flow biases from the available static information about the network.
No associations
LandOfFree
Network as a computer: ranking paths to find flows 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 Network as a computer: ranking paths to find flows, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Network as a computer: ranking paths to find flows will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-295395