Academics

One-arm exponent of critical metric graph Gaussian free field in high dimensions

Time:Thur., 4:00-5:00 pm, Nov. 9, 2023

Venue:C548, Shuangqing Complex Building A 双清综合楼A座C548报告厅

Organizer:吴昊,杨帆,姜建平,顾陈琳

Speaker:Cai Zhenhao 蔡振豪

About the speaker

I am a PhD student at the School of Mathematical Science, Peking University. My supervisor is Prof. Yuan Zhang. Currently, my research interests include some stochastic models related to random walks, such as random interlacements, Gaussian free field, and diffusion-limited aggregation.


Abstract

We prove that for the critical level-set of Gaussian free field on the metric graph generated by Z^d (d>6), the one-arm probability (i.e. the probability of the event that the origin is connected to the boundary of the box B(N)) is proportional to N^{-2}, where B(N) is centered at the origin and has side length 2N. This paper is a joint work with Prof. Jian Ding. In addition to presenting the proof idea, this talk will also involve some interesting open questions, including the one-arm exponent in low dimensions, the structure of large clusters, and the incipient infinite cluster (IIC).

DATENovember 9, 2023
SHARE
Related News
    • 0

      The critical disordered pinning measure

      YMSC Probability Seminar 概率论讨论班Organizers:吴昊、杨帆、姜建平、顾陈琳Speaker:Jinjiong Yu 俞锦炯华东师范大学Time:Thur., 15:40-16:40, Dec. 5, 2024Venue:C548, Shuangqing Complex Building ATitle:The critical disordered pinning measureAbstract:A disordered pinning model is called disorder relevant if even arbitrarily small amounts of disorder can qualitatively alter the typical behavior of...

    • 1

      The chromatic profile of a graph

      AbstractDetermining the chromatic number of a graph is a difficult but important problem. Hence, it is not surprising that a variety of questions in Graph Theory concern the search for meaningful upper bounds for the chromatic number of certain families of graphs. One type of graph family that received considerable attention is that of H-free graphs, that is, the family of graphs G which do not...