SearcharxivSearch

arXiv subjects

Wai-Kit Lam

Publications and source records attributed to Wai-Kit Lam.

15 recordsLinked to original sources

Correlation Decay for Maximum Weight Matchings on Sparse Graphs

We study correlation decay for the maximum weight matching problem on sparse graphs with i.i.d. edge weights. We show exponential decay of correlations when the underlying graphs are locally tree-like with uniformly bounded degree and the edge weights are exponential. We also prove a polynomial rate of decay of correlations for any finite graph with maximum degree at most three, again for exponential edge weights. As consequences of the correlation decay property, we obtain the existence of the maximum weight matching on infinite graphs, local weak convergence of the maximum weight matching, and a law of large numbers for its total weight.

math.PR

Asymptotics for first-passage percolation on logarithmic subgraphs of $\mathbb{Z}^2$

For $a>0$ and $b \geq 0$, let $\mathbb{G}_{a,b}$ be the subgraph of $\mathbb{Z}^2$ induced by the vertices between the first coordinate axis and the graph of the function $f = f_{a,b}(u) = a \log (1+u) + b \log(1+\log(1+u))$, $u \geq 0$. It is known that for $a>0$, the critical value for Bernoulli percolation on $\mathbb{G}_f = \mathbb{G}_{a,b}$ is strictly between $1/2$ and $1$, and that if $b>2a$ then the percolation phase transition is discontinuous. We study first-passage percolation (FPP) on $\mathbb{G}_{a,b}$ with i.i.d. edge-weights $(\tau_e)$ satisfying $p = \mathbb{P}(\tau_e=0) \in [1/2,1)$ and the "gap condition" $\mathbb{P}(\tau_e \leq \delta) = p$ for some $\delta>0$. We find the rate of growth of the expected passage time in $\mathbb{G}_f$ from the origin to the line $x=n$, and show that, while when $p=1/2$ it is of order $n/(a \log n)$, when $p>1/2$ it can be of order (a) $n^{c_1}/(\log n)^{c_2}$, (b) $(\log n)^{c_3}$, (c) $\log \log n$, or (d) constant, depending on the relationship between $a,b,$ and $p$. For more general functions $f$, we prove a central limit theorem for the passage time and show that its variance grows at the same rate as the mean. As a consequence of our methods, we improve the percolation transition result by showing that the phase transition on $\mathbb{G}_{a,b}$ is discontinuous if and only if $b > a$, and improve "sponge crossing dimensions" asymptotics from the '80s on subcritical percolation crossing probabilities for tall thin rectangles.

math.PR

Moderate deviations in first-passage percolation for bounded weights

We investigate the moderate and large deviations in first-passage percolation (FPP) with bounded weights on $\mathbb{Z}^d$ for $d \geq 2$. Write $T(\mathbf{x}, \mathbf{y})$ for the first-passage time and denote by $\mu(\mathbf{u})$ the time constant in direction $\mathbf{u}$. In this paper, we establish that, if one assumes that the sublinear error term $T(\mathbf{0}, N\mathbf{u}) - N\mu(\mathbf{u})$ is of order $N^\chi$, then under some unverified (but widely believed) assumptions, for $\chi < a < 1$, \begin{align*} &\mathbb{P}\bigl(T(\mathbf{0}, N\mathbf{u}) > N\mu(\mathbf{u}) + N^a\bigr) = \exp{\Big(-\,N^{\frac{d(1+o(1))}{1-\chi}(a-\chi)}\Big)},\end{align*} \begin{align*} &\mathbb{P}\bigl(T(\mathbf{0}, N\mathbf{u}) < N\mu(\mathbf{u}) - N^a\bigr) = \exp{\Big(-\,N^{\frac{1+o(1)}{1-\chi}(a-\chi)}\Big)}, \end{align*} with accompanying estimates in the borderline case $a=1$. Moreover, the exponents $\frac{d}{1-\chi}$ and $\frac{1}{1-\chi}$ also appear in the asymptotic behavior near $0$ of the rate functions for upper and lower tail large deviations. Notably, some of our estimates are established rigorously without relying on any unverified assumptions. Our main results highlight the interplay between fluctuations and the decay rates of large deviations, and bridge the gap between these two regimes. A key ingredient of our proof is an improved concentration via multi-scale analysis for several moderate deviation estimates, a phenomenon that has previously appeared in the contexts of two-dimensional last-passage percolation and two-dimensional rotationally invariant FPP.

math.PR

Exceptional behavior in critical first-passage percolation and random sums

We study first-passage percolation (FPP) on the square lattice. The model is defined using i.i.d. nonnegative random edge-weights $(t_e)$ associated to the nearest neighbor edges of $\mathbb{Z}^2$. The passage time between vertices $x$ and $y$, $T(x,y)$, is the minimal total weight of any lattice path from $x$ to $y$. The growth rate of $T(x,y)$ depends on the value of $F(0) = \mathbb{P}(t_e=0)$: if $F(0) < 1/2$ then $T(x,y)$ grows linearly in $|x-y|$, but if $F(0) > 1/2$ then it is stochastically bounded. In the critical case, where $F(0) = 1/2$, $T(x,y)$ can be bounded or unbounded depending on the behavior of the distribution function $F$ of $t_e$ near 0. In this paper, we consider the critical case in which $T(x,y)$ is unbounded and prove the existence of an incipient infinite cluster (IIC) type measure, constructed by conditioning the environment on the event that the passage time from $0$ to a far distance remains bounded. This IIC measure is a natural candidate for the distribution of the weights at a typical exceptional time in dynamical FPP. A major part of the analysis involves characterizing the limiting behavior of independent nonnegative random variables conditioned to have small sum. We give conditions on random variables that ensure that such limits are trivial, and several examples that exhibit nontrivial limits.

math.PR

Universality of Superconcentration in the Sherrington-Kirkpatrick Model

We study the universality of superconcentration for the free energy in the Sherrington-Kirkpatrick (SK) model. In arXiv:0907.3381, Chatterjee showed that when the system consists of $N$ spins and Gaussian disorders, the variance of this quantity is superconcentrated by establishing an upper bound of order $N/\log{N}$, in contrast to the $O(N)$ bound obtained from the Gaussian-Poincaré inequality. In this paper, we show that superconcentration indeed holds for any choice of centered disorders with finite third moment, where the upper bound is expressed in terms of an auxiliary nondecreasing function $f$ that arises in the representation of the disorder as $f(g)$ for $g$ standard normal. Under an additional regularity assumption on $f$, we further show that the variance is of order at most $N/\log{N}$.

math.PR

Central Limit Theorem in Disordered Monomer-Dimer Model

We consider the disordered monomer-dimer model on general finite graphs with bounded degrees. Under the finite fourth moment assumption on the weight distributions, we prove a Gaussian central limit theorem for the free energy of the associated Gibbs measure with a rate of convergence. The central limit theorem continues to hold under a nearly optimal finite $(2+\epsilon)$-moment assumption on the weight distributions if the underlying graphs are further assumed to have a uniformly subexponential volume growth. This generalizes a recent result by Dey and Krishnan (arXiv:2109.12716) who showed a Gaussian central limit theorem in the disordered monomer-dimer model on cylinder graphs. Our proof relies on the idea that the disordered monomer-dimer model exhibits a decay of correlation with high probability. We also establish a central limit theorem for the Gibbs average of the number of dimers where the underlying graph has subexponential volume growth and the edge weights are Gaussians.

math.PR

On the number and size of holes in the growing ball of first-passage percolation

First-passage percolation is a random growth model defined on $\mathbb{Z}^d$ using i.i.d. nonnegative weights $(τ_e)$ on the edges. Letting $T(x,y)$ be the distance between vertices $x$ and $y$ induced by the weights, we study the random ball of radius $t$ centered at the origin, $B(t) = \{x \in \mathbb{Z}^d : T(0,x) \leq t\}$. It is known that for all such $τ_e$, the number of vertices (volume) of $B(t)$ is at least order $t^d$, and under mild conditions on $τ_e$, this volume grows like a deterministic constant times $t^d$. Defining a hole in $B(t)$ to be a bounded component of the complement $B(t)^c$, we prove that if $τ_e$ is not deterministic, then a.s., for all large $t$, $B(t)$ has at least $ct^{d-1}$ many holes, and the maximal volume of any hole is at least $c\log t$. Conditionally on the (unproved) uniform curvature assumption, we prove that a.s., for all large $t$, the number of holes is at most $(\log t)^C t^{d-1}$, and for $d=2$, no hole in $B(t)$ has volume larger than $(\log t)^C$. Without curvature, we show that no hole has volume larger than $Ct \log t$.

math.PR

Near-critical avalanches in 2D frozen percolation and forest fires

We study two closely related processes on the triangular lattice: frozen percolation, where connected components of occupied vertices freeze (they stop growing) as soon as they contain at least $N$ vertices, and forest fire processes, where connected components burn (they become entirely vacant) at rate $ζ> 0$. In this paper, we prove that when the density of occupied sites approaches the critical threshold for Bernoulli percolation, both processes display a striking phenomenon: the appearance of near-critical "avalanches". More specifically, we analyze the avalanches, all the way up to the natural characteristic scale of each model, which constitutes an important step toward understanding the self-organized critical behavior of such processes. For frozen percolation, we show in particular that the number of frozen clusters surrounding a given vertex is asymptotically equivalent to $(\log(96/5))^{-1} \log \log N$ as $N \to \infty$. A similar mechanism underlies forest fires, enabling us to obtain an analogous result for these processes, but with substantially more work: the number of burnt clusters is equivalent to $(\log(96/41))^{-1} \log \log (ζ^{-1})$ as $ζ\searrow 0$. Moreover, almost all of these clusters have a volume $ζ^{- 91/55 + o(1)}$. For forest fires, the percolation process with impurities introduced in arXiv:1810.08181 plays a crucial role in our proofs, and we extend the results in that paper, up to a positive density of impurities. In addition, we develop a novel exploration procedure to couple full-plane forest fires with processes in finite but large enough (compared to the characteristic scale) domains.

math.PR

Transitions for exceptional times in dynamical first-passage percolation

In first-passage percolation (FPP), we let $(τ_v)$ be i.i.d. nonnegative weights on the vertices of a graph and study the weight of the minimal path between distant vertices. If $F$ is the distribution function of $τ_v$, there are different regimes: if $F(0)$ is small, this weight typically grows like a linear function of the distance, and when $F(0)$ is large, the weight is typically of order one. In between these is the critical regime in which the weight can diverge, but does so sublinearly. We study a dynamical version of critical FPP on the triangular lattice where vertices resample their weights according to independent rate-one Poisson processes. We prove that if $\sum F^{-1}(1/2+1/2^k) = \infty$, then a.s. there are exceptional times at which the weight grows atypically, but if $\sum k^{7/8} F^{-1}(1/2+1/2^k) <\infty$, then a.s. there are no such times. Furthermore, in the former case, we compute the Hausdorff and Minkowski dimensions of the exceptional set and show that they can be but need not be equal. These results show a wider range of dynamical behavior than one sees in subcritical (usual) FPP.

math.PR

Estimates for the empirical distribution along a geodesic in first-passage percolation

In first-passage percolation, we assign i.i.d.~nonnegative weights $(t_e)$ to the nearest-neighbor edges of $\mathbb{Z}^d$ and study the induced pseudometric $T = T(x,y)$. In this paper, we focus on geodesics, or optimal paths for $T$, and estimate the empirical distribution of weights along them. We prove an upper bound for the expected number of edges with weight $\geq M$ in the union of all geodesics from $0$ to $x$ of the form $q(M) \mathbb{P}(t_e \geq M)|x|$, where $q(M) \leq e^{-cM}$. This shows that the tail of the expected empirical distribution along a geodesic is lighter than that of the original weight distribution by an exponential factor. We also give a lower bound for the expected minimal number of edges with weight $\geq M$ in any geodesic from $0$ to $x$ in terms of $\mathbb{P}(t_e \geq M)$ and $\mathbb{P}(t_e \in [M,2M])$. For example, these two imply that if $t_e$ has a power law tail of the form $\mathbb{P}(t_e \geq M) \sim M^{-\alpha}$, then the tail of the expected empirical distribution asymptotically lies between $e^{-CM \log M}$ and $e^{-cM}$. We also provide estimates for the expected number of edges in a geodesic with weight in a set $A$ for (a) arbitrary $A$, (b) $A$ an interval separated from the infimum of the support of $t_e$ and (c) $A=[0,a]$ for some $a \geq 0$.

math.PR

Universality of Approximate Message Passing Algorithms

We consider a broad class of Approximate Message Passing (AMP) algorithms defined as a Lipschitzian functional iteration in terms of an $n\times n$ random symmetric matrix $A$. We establish universality in noise for this AMP in the $n$-limit and validate this behavior in a number of AMPs popularly adapted in compressed sensing, statistical inferences, and optimizations in spin glasses.

math.PR

Universality of the time constant for $2D$ critical first-passage percolation

We consider first-passage percolation (FPP) on the triangular lattice with vertex weights $(t_v)$ whose common distribution function $F$ satisfies $F(0)=1/2$. This is known as the critical case of FPP because large (critical) zero-weight clusters allow travel between distant points in time which is sublinear in the distance. Denoting by $T(0,\partial B(n))$ the first-passage time from $0$ to $\{x : \|x\|_\infty = n\}$, we show existence of the "time constant'' and find its exact value to be \[ \lim_{n \to \infty} \frac{T(0,\partial B(n))}{\log n} = \frac{I}{2\sqrt{3}π} \text{ almost surely}, \] where $I = \inf\{x > 0 : F(x) > 1/2\}$ and $F$ is any critical distribution for $t_v$. This result shows that the time constant is universal and depends only on the value of $I$. Furthermore, we find the exact value of the limiting normalized variance, which is also only a function of $I$, under the optimal moment condition on $F$. The proof method also shows an analogous universality on other two-dimensional lattices, assuming the time constant exists.

math.PR

Order of Fluctuations of the Free Energy in the SK Model at Critical Temperature

We present an elementary approach to the order of fluctuations for the free energy in the Sherrington-Kirkpatrick mean field spin glass model at and near the critical temperature. It is proved that at the critical temperature the variance of the free energy is of $O((\log N)^2).$ In addition, we show that if one approaches the critical temperature from the low temperature regime at the rate $O(N^{-α})$ for some $α>0,$ then the variance is of $O((\log N)^2+N^{1-α}).$

math.PR

The size of the boundary in first-passage percolation

First-passage percolation is a random growth model defined using i.i.d. edge-weights $(t_e)$ on the nearest-neighbor edges of $\mathbb{Z}^d$. An initial infection occupies the origin and spreads along the edges, taking time $t_e$ to cross the edge $e$. In this paper, we study the size of the boundary of the infected ("wet") region at time $t$, $B(t)$. It is known that $B(t)$ grows linearly, so its boundary $\partial B(t)$ has size between $ct^{d-1}$ and $Ct^d$. Under a weak moment condition on the weights, we show that for most times, $\partial B(t)$ has size of order $t^{d-1}$ (smooth). On the other hand, for heavy-tailed distributions, $B(t)$ contains many small holes, and consequently we show that $\partial B(t)$ has size of order $t^{d-1+α}$ for some $α>0$ depending on the distribution. In all cases, we show that the exterior boundary of $B(t)$ (edges touching the unbounded component of the complement of $B(t)$) is smooth for most times. Under the unproven assumption of uniformly positive curvature on the limit shape for $B(t)$, we show the inequality $\#\partial B(t) \leq (\log t)^C t^{d-1}$ for all large $t.$

math.PR

Asymptotics for $2D$ Critical First Passage Percolation

We consider first-passage percolation on $\mathbb{Z}^2$ with i.i.d. weights, whose distribution function satisfies $F(0) = p_c = 1/2$. This is sometimes known as the "critical case" because large clusters of zero-weight edges force passage times to grow at most logarithmically, giving zero time constant. Denote $T(\mathbf{0}, \partial B(n))$ as the passage time from the origin to the boundary of the box $[-n,n] \times [-n,n]$. We characterize the limit behavior of $T(\mathbf{0}, \partial B(n))$ by conditions on the distribution function $F$. We also give exact conditions under which $T(\mathbf{0}, \partial B(n))$ will have uniformly bounded mean or variance. These results answer several questions of Kesten and Zhang from the '90s and, in particular, disprove a conjecture of Zhang from '99. In the case when both the mean and the variance go to infinity as $n \to \infty$, we prove a CLT under a minimal moment assumption. The main tool involves a new relation between first-passage percolation and invasion percolation: up to a constant factor, the passage time in critical first-passage percolation has the same first-order behavior as the passage time of an optimal path constrained to lie in an embedded invasion cluster.

math.PR