Английская Википедия:Biased random walk on a graph
Шаблон:Short description Шаблон:Network Science In network science, a biased random walk on a graph is a time path process in which an evolving variable jumps from its current state to one of various potential new states; unlike in a pure random walk, the probabilities of the potential new states are unequal.
Biased random walks on a graph provide an approach for the structural analysis of undirected graphs in order to extract their symmetries when the network is too complex or when it is not large enough to be analyzed by statistical methods. The concept of biased random walks on a graph has attracted the attention of many researchers and data companies over the past decade especially in the transportation and social networks.[1]
Model
There have been written many different representations of the biased random walks on graphs based on the particular purpose of the analysis. A common representation of the mechanism for undirected graphs is as follows:[2]
On an undirected graph, a walker takes a step from the current node, <math>j,</math> to node <math>i.</math> Assuming that each node has an attribute <math>\alpha_i,</math> the probability of jumping from node <math>j</math> to <math>i</math> is given by:
- <math>T_{ij}^\alpha=\frac{\alpha_i A_{ij}}{\sum_{k} \alpha_k A_{kj}},</math>
where <math>A_{ij}</math> represents the topological weight of the edge going from <math>j</math> to <math>i.</math>
In fact, the steps of the walker are biased by the factor of <math>\alpha</math> which may differ from one node to another.[3]
Depending on the network, the attribute <math>\alpha</math> can be interpreted differently. It might be implied as the attraction of a person in a social network, it might be betweenness centrality or even it might be explained as an intrinsic characteristic of a node. In case of a fair random walk on graph <math>\alpha</math> is one for all the nodes.
In case of shortest paths random walks[4] <math>\alpha_i</math> is the total number of the shortest paths between all pairs of nodes that pass through the node <math>i </math>. In fact the walker prefers the nodes with higher betweenness centrality which is defined as below:
- <math>C(i)=\tfrac{\text{Total number of shortest paths through } i}{\text{Total number of shortest paths}}</math>
Based on the above equation, the recurrence time to a node in the biased walk is given by:[5]
- <math>r_i=\frac{1}{C(i)}</math>
Applications
There are a variety of applications using biased random walks on graphs. Such applications include control of diffusion,[6] advertisement of products on social networks,[7] explaining dispersal and population redistribution of animals and micro-organisms,[8] community detections,[9] wireless networks,[10] and search engines.[11]
See also
- Betweenness centrality
- Community structure
- Kullback–Leibler divergence
- Markov chain
- Maximal entropy random walk
- Random walk closeness centrality
- Social network analysis
- Travelling salesman problem
References
External links
- Gábor Simonyi, "Graph Entropy: A Survey". In Combinatorial Optimization (ed. W. Cook, L. Lovász, and P. Seymour). Providence, RI: Amer. Math. Soc., pp. 399–441, 1995.
- Anne-Marie Kermarrec, Erwan Le Merrer, Bruno Sericola, Gilles Trédan, "Evaluating the Quality of a Network Topology through Random Walks" in Gadi Taubenfeld (ed.) Distributed Computing
