Fluctuation lower bounds in planar random growth models

被引:1
|
作者
Bates, Erik [1 ]
Chatterjee, Sourav [2 ]
机构
[1] Univ Calif Berkeley, Dept Math, 1067 Evans Hall, Berkeley, CA 94720 USA
[2] Stanford Univ, Dept Stat, Sequoia Hall,390 Jane Stanford Way, Stanford, CA 94305 USA
关键词
First-passage percolation; Corner growth model; Directed polymers; 1ST PASSAGE PERCOLATION; DIMENSIONAL DIRECTED POLYMER; 1ST-PASSAGE PERCOLATION; SHAPE FLUCTUATIONS; ORIENTED PERCOLATION; RANDOM ENVIRONMENT; LIMITING-SHAPE; TIME CONSTANT; DIVERGENCE; DISTRIBUTIONS;
D O I
10.1214/19-AIHP1043
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
We prove root log n lower bounds on the order of growth fluctuations in three planar growth models (first-passage percolation, last-passage percolation, and directed polymers) under no assumptions on the distribution of vertex or edge weights other than the minimum conditions required for avoiding pathologies. Such bounds were previously known only for certain restrictive classes of distributions. In addition, the first-passage shape fluctuation exponent is shown to be at least 1/8, extending previous results to more general distributions.
引用
收藏
页码:2406 / 2427
页数:22
相关论文
共 50 条
  • [31] Extended Formulation Lower Bounds for Refuting Random CSPs
    Brown-Cohen, Jonah
    Raghavendra, Prasad
    PROCEEDINGS OF THE THIRTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA'20), 2020, : 305 - 324
  • [32] Topological lower bounds on algebraic random access machines
    Ben-Amram, AM
    Galil, Z
    SIAM JOURNAL ON COMPUTING, 2002, 31 (03) : 722 - 761
  • [33] Random restricted matching and lower bounds for combinatorial optimization
    Steinerberger, Stefan
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2012, 24 (03) : 280 - 298
  • [34] Lower and Upper Bounds for Random Mimimum Satisfiability Problem
    Huang, Ping
    Su, Kaile
    FRONTIERS IN ALGORITHMICS (FAW 2015), 2015, 9130 : 115 - 124
  • [35] Random restricted matching and lower bounds for combinatorial optimization
    Stefan Steinerberger
    Journal of Combinatorial Optimization, 2012, 24 : 280 - 298
  • [36] LOWER BOUNDS FOR THE ISOPERIMETRIC NUMBERS OF RANDOM REGULAR GRAPHS
    Kolesnik, Brett
    Wormald, Nick
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2014, 28 (01) : 553 - 575
  • [37] The Price of Verifiability: Lower Bounds for Verifiable Random Functions
    Brandt, Nicholas
    Hofheinz, Dennis
    Kastner, Julia
    Unal, Akin
    THEORY OF CRYPTOGRAPHY, TCC 2022, PT II, 2022, 13748 : 747 - 776
  • [38] Extended Formulation Lower Bounds for Refuting Random CSPs
    Brown-Cohen, Jonah
    Raghavendra, Prasad
    PROCEEDINGS OF THE 2020 ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2020, : 305 - 324
  • [39] ON UPPER AND LOWER BOUNDS FOR THE VARIANCE OF A FUNCTION OF A RANDOM VARIABLE
    CACOULLOS, T
    ANNALS OF PROBABILITY, 1982, 10 (03): : 799 - 809
  • [40] Lower Bounds on Learning Random Structures with Statistical Queries
    Angluin, Dana
    Eisenstat, David
    Kontorovich, Leonid
    Reyzin, Lev
    ALGORITHMIC LEARNING THEORY, ALT 2010, 2010, 6331 : 194 - 208