Extremal Paths on a Random Cayley Tree

Physics – Condensed Matter – Statistical Mechanics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

7 pages Revtex, 3 eps figures

Scientific paper

10.1103/PhysRevE.62.7735

We investigate the statistics of extremal path(s) (both the shortest and the longest) from the root to the bottom of a Cayley tree. The lengths of the edges are assumed to be independent identically distributed random variables drawn from a distribution \rho(l). Besides, the number of branches from any node is also random. Exact results are derived for arbitrary distribution \rho(l). In particular, for the binary {0,1} distribution \rho(l)=p\delta_{l,1}+(1-p)\delta_{l,0}, we show that as p increases, the minimal length undergoes an unbinding transition from a `localized' phase to a `moving' phase at the critical value, p=p_c=1-b^{-1}, where b is the average branch number of the tree. As the height n of the tree increases, the minimal length saturates to a finite constant in the localized phase (pp_c) where the velocity v_{min}(p) is determined via a front selection mechanism. At p=p_c, the minimal length grows with n in an extremely slow double logarithmic fashion. The length of the maximal path, on the other hand, increases linearly as v_{max}(p)n for all p. The maximal and minimal velocities satisfy a general duality relation, v_{min}(p)+v_{max}(1-p)=1, which is also valid for directed paths on finite-dimensional lattices.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Extremal Paths on a Random Cayley Tree does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Extremal Paths on a Random Cayley Tree, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Extremal Paths on a Random Cayley Tree will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-710586

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.