A graph-based equilibrium problem for the limiting distribution of non-intersecting Brownian motions at low temperature

Mathematics – Complex Variables

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

41 pages, 13 figures

Scientific paper

We consider n non-intersecting Brownian motion paths with p prescribed starting positions at time t=0 and q prescribed ending positions at time t=1. The positions of the paths at any intermediate time are a determinantal point process, which in the case p=1 is equivalent to the eigenvalue distribution of a random matrix from the Gaussian unitary ensemble with external source. For general p and q, we show that if a temperature parameter is sufficiently small, then the distribution of the Brownian paths is characterized in the large n limit by a vector equilibrium problem with an interaction matrix that is based on a bipartite planar graph. Our proof is based on a steepest descent analysis of an associated (p+q) by (p+q) matrix valued Riemann-Hilbert problem whose solution is built out of multiple orthogonal polynomials. A new feature of the steepest descent analysis is a systematic opening of a large number of global lenses.

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

A graph-based equilibrium problem for the limiting distribution of non-intersecting Brownian motions at low temperature 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 A graph-based equilibrium problem for the limiting distribution of non-intersecting Brownian motions at low temperature, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A graph-based equilibrium problem for the limiting distribution of non-intersecting Brownian motions at low temperature will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-331555

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