RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PERSONAL OFFICE
Video Library
Archive
Most viewed videos

Search
RSS
New in collection





You may need the following programs to see the files






Random geometry and physics
September 10, 2014 10:50–11:40, Moscow
 


From elongated spanning trees to vicious random walks

S. K. Nechaev
Video records:
Flash Video 312.3 Mb
Flash Video 1,870.9 Mb
MP4 312.3 Mb

Number of views:
This page:128
Video files:52

S. K. Nechaev


Видео не загружается в Ваш браузер:
  1. Установите Adobe Flash Player    

  2. Проверьте с Вашим администратором, что из Вашей сети разрешены исходящие соединения на порт 8080
  3. Сообщите администратору портала о данной ошибке

Abstract: Given a spanning forest on a large square lattice, we consider by Kirchhoff theorem a correlation function of $k$ paths ($k$ is odd) along branches of trees or, equivalently, $k$ loop-erased random walks. Starting and ending points of the paths are grouped such that they form a $k$-leg watermelon. For large distance $r$ between groups of starting and ending points, the ratio of the number of watermelon configurations to the total number of spanning trees behaves as $r^{-\nu}\log r$ with $\nu = (k^2-1)/2$. Considering the spanning forest stretched along the meridian of the watermelon, we show that the two-dimensional $k$-leg loop-erased watermelon exponent $\nu$, corresponding to $c=-2$ CFT is converting into the scaling exponent for the reunion probability (at a given point) of $k$ $(1+1)$-dimensional vicious walkers, $\tilde{\nu} = k^2/2$, described by RMT.

Language: English

SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru
 
Contact us:
 Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2018