Search information entropy portal 02-25-2014d1321

2015-01-13

"C:\Users\kurtw_000\Documents\kurt\storage\DR\2014\02-25-2014d1321\Search information equation.docx"

Definition found in these articles: 
-Characterization of complex networks: A survey of measurements
--"C:\Users\kurtw_000\Box Sync\DocDR\2014\03-29-2014d1134\Characterization of complex networks c A survey of measurements.pdf"
-[Hide and seek on complex networks]

Pure text (no formatted equations) definition of search information entropy
{
Search information entropy: S(i->b) = -log2{P{p(i,b))}

S(i?b)=-?log?_2 {P{p(i,b)}

Let p(i, b) be a shortest path starting at vertex i and ending at vertex b. The probability of following this path in a random walk is (P{p(I,b)} = 1/Ki * Cumulative_Product (while j belongs to p(I,b)) (1/(Kj-1))

where k j is the degree of vertex j and the product includes all vertices j in the path
p(i, b) with the exclusion of i and b. (Therefore, ki would be the degree of the start verticex i)

The search information, corresponding to the
total information needed to identify one of the shortest paths between i and b, is
given by
S(i->b) = -log2{P{p(i,b))}
 
where the sum is taken over all shortest paths p(i, b) from i to b.

}

azim58wiki: