Traveling Waves, Front Selection, and Exact Nontrivial Exponents in a Random Fragmentation Problem

Physics – Condensed Matter – Statistical Mechanics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

4 pages Revtex

Scientific paper

10.1103/PhysRevLett.85.5492

We study a random bisection problem where an initial interval of length x is cut into two random fragments at the first stage, then each of these two fragments is cut further, etc. We compute the probability P_n(x) that at the n-th stage, each of the 2^n fragments is shorter than 1. We show that P_n(x) approaches a traveling wave form, and the front position x_n increases as x_n\sim n^{\beta}{\rho}^n for large n. We compute exactly the exponents \rho=1.261076... and \beta=0.453025.... as roots of transcendental equations. We also solve the m-section problem where each interval is broken into m fragments. In particular, the generalized exponents grow as \rho_m\approx m/(\ln m) and \beta_m\approx 3/(2\ln m) in the large m limit. Our approach establishes an intriguing connection between extreme value statistics and traveling wave propagation in the context of the fragmentation problem.

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

Traveling Waves, Front Selection, and Exact Nontrivial Exponents in a Random Fragmentation Problem 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 Traveling Waves, Front Selection, and Exact Nontrivial Exponents in a Random Fragmentation Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Traveling Waves, Front Selection, and Exact Nontrivial Exponents in a Random Fragmentation Problem will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-290156

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