dorsal/arxiv
View SchemaCritical level-set percolation on finite graphs and spectral gap
| Authors | Subhajit Goswami, Dipranjan Pal |
|---|---|
| Categories | |
| ArXiv ID | 2601.07802vv1 |
| URL | https://arxiv.org/abs/2601.07802 |
| License | http://arxiv.org/licenses/nonexclusive-distrib/1.0/ |
Abstract
We study the bond percolation on finite graphs induced by the level-sets of zero-average Gaussian free field on the associated metric graph above a given height (level) parameter $h \in \mathbb{R}$. We characterize the near- and off-critical phases of this model for any expanders family $\mathcal{G}_n = (V_n, E_n)$ with uniformly bounded degrees. In particular, we show that the volume of the largest open cluster at level $h_n$ is of the order $|V_n|^{\frac23}$ when $h_n$ lies in the corresponding critical window which we identify as $|h_n| = O(|V_n|^{-\frac13})$. Outside this window, the volume starts to deviate from $\Theta(|V_n|^{\frac23})$ culminating into a linear order in the supercritical phase $h_n = h < 0$ (the giant component) and a logarithmic order in the subcritical phase $h_n = h > 0$. We deduce these from effective estimates on tail probabilities for the maximum volume of an open cluster at any level $h$ for a generic base graph $\mathcal{G}$. The estimates depend on $\mathcal{G}$ only through its size and upper and lower bounds on its degrees and spectral gap respectively. To the best of our knowledge, this is the first instance where a mean-field critical behavior is derived under such general setup for finite graphs. The generality of these estimates preclude any local approximation of $\mathcal{G}$ by regular infinite trees -- a standard approach in the area. Instead, our methods rely on exploiting the connection between spectral gap of the graph $\mathcal{G}$ and its connection to the level-sets of zero-average Gaussian free field mediated via a set function we call the zero-average capacity.
{
"annotation_id": "9fa48d41-85cf-4de0-84e7-3079984ed32c",
"date_created": "2026-02-17T05:53:11.948000Z",
"date_modified": "2026-02-17T05:53:11.948000Z",
"file_hash": "551b6f326a9062e6aee2719a6df89de4b5451be381f16745ab0b636a1e0837db",
"private": false,
"record": {
"abstract": "We study the bond percolation on finite graphs induced by the level-sets of zero-average Gaussian free field on the associated metric graph above a given height (level) parameter $h \\in \\mathbb{R}$. We characterize the near- and off-critical phases of this model for any expanders family $\\mathcal{G}_n = (V_n, E_n)$ with uniformly bounded degrees. In particular, we show that the volume of the largest open cluster at level $h_n$ is of the order $|V_n|^{\\frac23}$ when $h_n$ lies in the corresponding critical window which we identify as $|h_n| = O(|V_n|^{-\\frac13})$. Outside this window, the volume starts to deviate from $\\Theta(|V_n|^{\\frac23})$ culminating into a linear order in the supercritical phase $h_n = h \u003c 0$ (the giant component) and a logarithmic order in the subcritical phase $h_n = h \u003e 0$. We deduce these from effective estimates on tail probabilities for the maximum volume of an open cluster at any level $h$ for a generic base graph $\\mathcal{G}$. The estimates depend on $\\mathcal{G}$ only through its size and upper and lower bounds on its degrees and spectral gap respectively. To the best of our knowledge, this is the first instance where a mean-field critical behavior is derived under such general setup for finite graphs. The generality of these estimates preclude any local approximation of $\\mathcal{G}$ by regular infinite trees -- a standard approach in the area. Instead, our methods rely on exploiting the connection between spectral gap of the graph $\\mathcal{G}$ and its connection to the level-sets of zero-average Gaussian free field mediated via a set function we call the zero-average capacity.",
"arxiv_id": "2601.07802",
"authors": [
"Subhajit Goswami",
"Dipranjan Pal"
],
"categories": [
"math.PR",
"math.CO"
],
"license": "http://arxiv.org/licenses/nonexclusive-distrib/1.0/",
"title": "Critical level-set percolation on finite graphs and spectral gap",
"url": "https://arxiv.org/abs/2601.07802",
"version": "v1"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "cba54d87-292f-46b3-8451-228fa90b71fa",
"id": "arXiv Dataset",
"type": "Model",
"variant": "snapshot-2026-01-17",
"version": "0.1.0"
},
"user_id": 1000002
}