How does the length of the shortest path *in T* from node h to node k (if any) grow with their 'numeric distance' (k - h)?

Take all the naturals and for each pair (i, j) with i j with fixed probability p, thus obtaining an infinite DAG (directed acyclic graph) G.  Let T be the...

16 September 2014 9,841 3 View