Chicken (game) respectively. The line in graph on the left shows the optimum probability of playing the escalated strategy for player Y as a function of "x". The line in the second graph shows the optimum probability of playing the escalated strategy for player X as a function of "y" (the axes have not been rotated, so the dependent variable is plotted on the abscissa, and the independent variable is plotted on the ordinate). The Nash equilibria are where the players' correspondences agree, i.e., cross. These are shown with points in the right hand graph. The best response mappings agree (i.e., cross)
Biased random walk on a graph total number of the shortest paths between all pairs of nodes that pass through the node formula_14. In fact the walker prefers the nodes with higher betweenness centrality which is defined as below: Based on the above equation, the recurrence time to a node in the biased walk is given by: Variety of applications by using biased random walks on graphs have been developed; control of diffusion, advertisement of products on social networks, explaining dispersal and population redistribution of animals and micro-organisms, community detections, wireless networks, search engines and so on. Biased random walk on a graph In network science,