基于布朗粒子的随机运动度量网络中节点之间的距离
算法思想
Consider a connected network of nodes and edges. Its node set is denoted by and its connection pattern is specified by the generalized adjacency matrix . If there is no edge between node and node , ; if there is an edge in between, and its value signifies the interaction strength (self-connection is allowed). The set of nearest neighbors of node is denoted by . A Brownian particle keeps moving on the network, and at each time step it jumps from its present position (say ) to a nearestneighboring position . When no additional knowledge about the network is known, it is natural to assume the following jumping probability (the corresponding matrix is called the transfer matrix)
Define the node-node distance
from
to
as the average number of steps needed for the Brownian particle to move from
through the the network to
:
where is the identity matrix and matrix equals to the transfer matrix except that for any .