网络作为一台计算机:对路径进行排序以查找流
Network as a computer: ranking paths to find flows
摘要:
我们探索一个简单的数学模型的网络计算,基于马尔可夫链。类似的模型适用于计算机网络、遗传网络、神经网络、社交网络等广泛的计算现象,与这些自发演化的计算系统交互的主要问题是数据的结构不统一。一种有趣的方法是尝试从节点之间的数据分布中提取数据的语义内容。然后,通过找到共享概念的节点社区来识别概念。因此,数据结构化的任务被简化为找到网络社区的任务,作为一起执行某些非本地数据处理的节点组。为了实现这个目标,我们扩展了从节点到路径的排名方法。这使我们能够从关于网络的可用静态信息中提取一些关于可能的流偏差的信息。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。