Introduction

A boundary-to-boundary walk can be weighted critically without fixing its length. In that law the separation of the endpoints supplies the spatial scale. Our question is whether prescribing the terminal boundary point, rather than summing over an interval, changes the power relating length to that scale. The distinction is substantial: a macroscopic terminal interval contains order RR ports, and a bound on its total exceptional mass does not bound the exceptional mass at one specified port.

We use the regular honeycomb lattice, embedded as the centers of the triangles of an equilateral triangular tiling of side one. Neighboring centers are joined across a common triangle edge. A port is the midpoint of a boundary edge of a domain made of whole triangles. A path enters and leaves normally at its ports, visits only centers in the interior, and visits no center twice. Its length L(γ)L(\gamma) is the number of visited centers, and its critical weight is

w(γ)=κL(γ),κ=(2cos⁡(π/8))−1=(2+2)−1/2.w(\gamma)=\kappa^{L(\gamma)},\qquad\kappa=(2\cos(\pi/8))^{-1}=(2+\sqrt{2})^{-1/2}.

Ports carry no weight. For a domain DD and boundary ports a,ba,b, set

KD(a,b)=∑γ:a→b in Dw(γ).K_D(a,b)=\sum_{\gamma:a\to b\text{ in }D}w(\gamma).

Whenever the sum is positive and finite, dividing by it defines the critical chord law. The path has no other boundary exit. A pure cut follows one of the three tiling-edge directions; its admissible translates bound whole triangular rows. Distances refer to this fixed embedding.

Theorem 1.1 (Prescribed boundary endpoints). Let DRD_R be convex pure lattice hexagons which, after scaling by RR, converge to a regular hexagon. Let aR,bRa_R,b_R be boundary ports whose scaled limits are distinct points in the relative interiors of sides. Then, for every ε>0\varepsilon>0, the critical chord law satisfies

PDR;aR,bR{R4/3−ε≤L(γ)≤R4/3+ε}⟶1.\mathbb{P}_{D_R;a_R,b_R}\left\{R^{4/3-\varepsilon}\le L(\gamma)\le R^{4/3+\varepsilon}\right\}\longrightarrow1.

*The same conclusion holds in a full half-plane for prescribed boundary ports at distance RR, in a strip of height comparable to RR for one prescribed port on each of the two opposite boundary cuts, at mutual distance O(R)O(R), and in a wedge of angle π/3\pi/3 or 2π/32\pi/3 formed by two nonparallel pure cuts, with one prescribed port on each ray. In the wedge, each endpoint has clearance comparable to RR from the other cut and distance O(R)O(R) from the apex. Constants are uniform on fixed compact sets of these nondegenerate scaled geometries. In each case the normalizing mass is at least cR−5/4cR^{-5/4}.

The theorem concerns each admissible choice of the two ports. A first step, proved in Section 3, fixes the source and sums the terminal port over a separated macroscopic interval. Its normalizing mass is of order R−1/4R^{-1/4}. This intermediate law is also useful in its own right, and remains distinct from the prescribed-endpoint law.

For half-plane arches we additionally prove EL=R4/3+o(1)\mathbb{E}L=R^{4/3+o(1)}. This requires control of the weighted upper tail; convergence in probability alone would not imply it. We also record the terminal-summed mean law from the proof of [15], Theorem 8.1, where the gap ranges over [R,2R][R,2R] and the arch diameter is confined to a sufficiently large fixed multiple of RR. For strip bridges, a second argument proves a mean law uniformly over sublinear terminal offsets on a single set of heights of natural density one. It also proves the same mean exponent in the critical mixture of aligned bridges at all even heights in [H,2H][H,2H]. These mean statements retain their own height and weighting conventions.

Historical context. Nienhuis’s analysis of the dilute O(n)O(n) model predicted the planar self-avoiding-walk exponents, including the length–distance power 4/34/3 [11]. Duminil-Copin and Smirnov proved the honeycomb connective constant using a local winding relation and a boundary identity [3]. Their mid-edge convention is the port convention used here. For critical strip mass, Beaton, Bousquet-Mélou, de Gier, Duminil-Copin and Guttmann proved decay to zero in their work on surface adsorption [2]. Glazman and Manolescu gave a shorter proof and a logarithmic subsequence bound, and proved boundary two-point invariance for columnwise rhombic half-planes with angles in [π/3,2π/3][\pi/3,2\pi/3] [6]. Krachun and Panagiotis subsequently proved a polynomial upper bound for strip-crossing mass and a quantitative sub-ballistic estimate for uniform honeycomb walks [9]. These results distinguish critical activity, decay of crossing mass, and length–distance exponents; the finite inputs below specify the stronger estimates used here.

The irreducible-bridge construction goes back to Kesten [8]; its honeycomb mid-edge form appears in [2], Appendix]. On the square lattice, the infinite critical law and its relation to strip-spanning laws are developed by Lawler–Schramm–Werner [10], Appendix] and Dhy–Gilbert–Kennedy–Lawler–Passon [4], Section 2.4]. Gilbert’s appendix records Kennedy’s heuristic connecting strip mass of order h−1/4h^{-1/4} to an irreducible height tail of order h−3/4h^{-3/4} and renewal heights of order n4/3n^{4/3} [5], Appendix]. Here whole irreducible bridges are independent increments; height, length and lateral displacement within one increment remain dependent.

The quantitative starting point is the sharp finite marked-polygon and bridge estimates of [16], together with the renewal estimates of [15]; Section 2 states exactly what we use. These are stronger inputs than the preceding critical and sub-ballistic results. The terminal-free fixed-height probability law and the prescribed half-plane arch probability law already appear in [15], Propositions 5.7 and 5.8]. We give a different proof of the latter, through common-level pair renewals and arch-kernel regularity, and develop the local estimates needed to assemble the prescribed-endpoint laws in the other geometries. The mean estimates require additional length-weighted control and retain separate finite inputs.

The three endpoint mechanisms. For two ports on one line, grow independent bridge sequences upward from the two ports and stop at their common renewal levels. Their common height transform has exponent 1/21/2. A separate lateral window estimate gives O(m−2)O(m^{-2}) atoms for the difference after mm common blocks. This supplies both regularity of the arch kernel and control of a long final joining arch; the complete argument is in Section 4.

For parallel cuts one must match height and lateral displacement at once. A height-tail bound alone does not pay for one prescribed height. Section 5 bounds all fixed-order differences of the strip mass, starting from the finite projection representation in [16]. This local regularity gives the one-piece height atom bound in Section 6. Together with two-dimensional concentration and a sum of heightwise maximal atoms, it pays the parallel endpoint restriction in Section 7. For nonparallel cuts, small normal prefixes initially exhaust only a sum over terminal ports. A local visit estimate and an artificial-arc boundary identity then control the exceptional mass at the prescribed terminal port. Each case thus pays for its actual endpoint restriction before dividing by the chord mass; Section 8 completes the nonparallel case.

The means use two further arguments. In Section 9, the calibrated finite estimates of [12] and their renewal consequences control marked arms at both ends of an arch. The resulting length-weighted contributions are summable over arch heights at each prescribed gap. In Section 10, the finite strip moments of [14] feed a renewal-reward identity. A two-bridge boundary comparison controls variation between terminal ports after averaging over heights, leading to the density-one and aligned-mixture mean laws rather than an all-height pointwise claim.

Finite estimates and the irreducible law

We first identify the inputs that do not depend on prescribed endpoints. A strip of integral height hh has physical thickness dhdh, where d=3/2d = \sqrt{3}/2. Write BhB_h for its critical bridge mass from one fixed bottom port, summed over all compatible top ports, and put B0=1B_0 = 1. A strict bridge stays between its boundary cuts. Its terminal offset lies on the row-staggered lattice Z+h/2\mathbb{Z} + h/2 in horizontal side units. There is no translation factor in BhB_h.

Proposition 2.1 (Finite boundary and length inputs). The following estimates hold in the port convention above.

  1. For every integer h≥0h \ge0, Bh≲(1+h)−1/4B_h \lesssim(1+h)^{-1/4}. For all sufficiently large integers hh, the length-weighted bridge mass is at most Ch13/12C h^{13/12}, and Bh{L≥ch4/3}≥ch−1/4B_h\{L \ge c h^{4/3}\} \ge c h^{-1/4}. For every integer h≥1h \ge1 and every r≥0r \ge0, the mass of bridges of diameter exceeding rr is at most C(1+r)−1/4C(1+r)^{-1/4}.

  1. In a convex pure domain, the mass from one boundary source of completed paths of diameter at least rr is at most C(1+r)−1/4C(1+r)^{-1/4} for r≥0r \ge0. For the half-plane arch kernel and integer l≥1l \ge1, Kl≍l−5/4K_l \asymp l^{-5/4} and Kl+1≤KlK_{l+1} \le K_l. The same monotonicity comparison is valid along one straight side of a convex pure truncation whenever both compared adjacent ports remain on that side. Arches of diameter at most AlAl retain mass cl−5/4cl^{-5/4} for a fixed AA.

  1. From a prescribed port aa with inward pure normal nn, consider the terminal line m⋅(z−a)=sm \cdot(z-a) = s, where mm is its outward pure unit normal and the angle between nn and mm is at most π/3\pi/3. Here s>0s > 0 is the Euclidean distance from aa to the terminal line. Crossings that stay in the initial half-plane and before the terminal line until their final exit have mass comparable to s−1/4s^{-1/4}. For any fixed positive relative tolerance, and all sufficiently large admissible ss with a threshold depending only on that tolerance, the lower bound can be confined within distance equal to that tolerance times ss of the segment a+[0,s]ma + [0,s]m. The corresponding two-cut upper bound holds without confinement.

  1. In a convex pure domain of diameter O(R)O(R), the total length-weighted mass of chords, summed over ordered boundary endpoint pairs, is at most $R^{25/12+o(1)}.

These are the finite results of [16], Theorem 1.1, Propositions 7.1, 7.4, 10.1 and Corollary 8.1. The statement records the input before use; the full analytic and finite geometric proofs are in that companion. In particular its free-boundary mean is a finite input, not a consequence of the endpoint theorem here. The disk-transfer construction [13], Theorem 1.1 provides an independent fixed-corridor first moment. We use the specified finite method at each application below; in particular the logarithmic confinement in the polynomial-vacuum route retains its own precision.

We use also the local contour identity with phase eiσWe^{i\sigma W}, σ=3/8\sigma= 3/8, where WW is total turning. This is the phase e−5iW/8e^{-5iW/8} of the usual observable multiplied by the terminal tangent relative to the initial direction; see [3], Section 2, Lemma 1. At an unvisited center the two outgoing weights sum to the incoming weight, since 2κcos⁡(π/8)=12\kappa\cos(\pi/8) = 1. Prefixes returning to a visited center cancel in pairs under reversal of their unfinished simple loop: their turn increments differ by 8π/38\pi/3, and hence their phases have opposite signs. Summing over a finite domain gives signed exit mass one. For a convex domain the real exit coefficients lie in [cos⁡(3π/8),1][\cos(3\pi/8),1]. Subtracting the identity in a convex subdomain bounds the mass of paths lost on restriction by a fixed multiple of the mass to the newly exposed sides. Exhaustion is justified by the diameter bound in Proposition 2.1. This is the local winding mechanism of [3]; below we explain the additional arc and spectator constructions when they are used.

An irreducible strict bridge has positive integral height and no intermediate singly crossed level. Every bridge has a unique ordered factorization into such pieces. The honeycomb mid-edge version of the irreducible construction is given in [2], Appendix]. Let p(γ)=κL(γ)p(\gamma) = \kappa^{L(\gamma)} on irreducibles from a fixed port. Let H,Z,L,DH,Z,L,D denote respectively the height, transverse displacement, length and diameter of one piece.

Proposition 2.2 (Renewal inputs). The mass pp is a probability. Successive complete pieces have independent law pp, and, for s>0s > 0,

∑h≥0Bhe−sh=(1−Epe−sH)−1≍s−3/4(s↓0).\sum_{h\ge0} B_h e^{-sh} = (1-\mathbb{E}_p e^{-sH})^{-1} \asymp s^{-3/4}\qquad(s\downarrow0).

Moreover,

p(H>x)+p(D>x)≤Cx−3/4,Ep[L;H≤x]≤x7/12+o(1),p(H>x)+p(D>x)\le Cx^{-3/4},\qquad\mathbb{E}_p[L;H\le x]\le x^{7/12+o(1)},
p(L>n)≤n−9/16+o(1),1−Epe−uL=u9/16+o(1).p(L>n)\le n^{-9/16+o(1)},\qquad1-\mathbb{E}_p e^{-uL}=u^{9/16+o(1)}.

Almost surely, for independent pieces, their first kk heights and lengths sum respectively to k4/3+o(1)k^{4/3+o(1)} and k16/9+o(1)k^{16/9+o(1)}, and their diameters sum to at most k4/3+o(1)k^{4/3+o(1)}.

The proofs and the full joint-law conventions are [15], Propositions 2.2, 2.4, Remark 2.5 and Lemma 2.6. Only the independent pieces are asserted here; their coordinates are not independent. BhB_h is a renewal occurrence mass, not a probability conditioned on a future height. No estimate in this proposition conditions a piece on its length.

Throughout, f(R)=Rα+o(1)f(R)=R^{\alpha+o(1)} means Rα−ϵ≤f(R)≤Rα+ϵR^{\alpha-\epsilon}\le f(R)\le R^{\alpha+\epsilon} for every fixed ϵ>0\epsilon>0 at all sufficiently large scales, with fixed geometric parameters chosen first. A one-sided version just the corresponding inequality. All suprema of atoms are on their actual support lattice; off-lattice probabilities are zero.

A prescribed source and a terminal interval

Prescribing one endpoint and summing the other over a separated interval gives normalizing mass of order R−1/4R^{-1/4}. We first establish this normalization by constructing interior connectors. We then prove the bridge and attachment estimates that transfer the length law to these chords. The attachment estimates will also be used for nonparallel cuts in Section 8.

Interior connectors

Proposition 3.1 (Interior connectors). For two macroscopically separated side-interior ports in the hexagons of Theorem 1.1, the critical mass of connecting paths inside the hexagon is at least cR−5/4cR^{-5/4}. The same bound holds in a parallel strip of thickness comparable to RR, with one port on each opposite cut and displacement O(R)O(R), and in compact nondegenerate wedge geometries with one port on each ray, as in Theorem 1.1. The constants are uniform on fixed compact sets of these scaled configurations.

Proof. We adapt the cut-averaging construction in the proof of [16], placing the routes in the interior rather than the exterior. The geometric choices below ensure that the decomposition can be recovered for two different lists of cuts.

Routes and junction cuts. Work first in a hexagon and scale distances by RR. Start with short segments in the inward normals at the two ports. Continue by disjoint simple arcs in the open interior to two parallel lanes in a free interior ball, preserving their cyclic order. The lanes approach one common pure transverse line from the same side. Their separation is a small fixed positive number, so a completing arch of diameter at most a fixed multiple of that separation fits in the free half-ball beyond the line. Keep that half-ball disjoint from all nonincident route portions.

Approximate the arcs by finitely many segments in pure normal directions, retaining the initial and terminal straight portions and making successive direction changes at most π/3\pi/3. One can do this by alternating the two adjacent pure directions spanning each smooth tangent, with a short step in their common direction at a sector transition. A sufficiently fine fixed mesh preserves separation of nonlocal portions; on nearby portions, positive projection in a common direction preserves simplicity. Every segment has length a fixed positive multiple of RR.

Index a branch’s segments by their guiding directions njn_j. The cut at the end of segment jj has normal njn_j, the arriving direction. The next leg starts with inward normal njn_j and travels toward a cut with outward normal nj+1n_{j+1}. Proposition 2.1(iii) therefore keeps the incoming leg before the junction cut and the outgoing leg after it. Restrict each leg to a sufficiently narrow corridor about its segment. Each junction has its own small crossing neighborhood, avoided by all nonincident route portions. This is a local requirement: those portions need not avoid the entire infinite line of the cut.

The geometric choices have positive clearances. They persist in a neighborhood of the scaled endpoint data, including the small support perturbations allowed in Theorem 1.1. Compactness gives uniform choices of the number of segments and their relative tolerances.

One list and two lists of levels. Vary each junction cut in a fixed small window of admissible levels of width comparable to RR. Choose the windows so that all corridors and stage orders just described persist for every list. The terminal level is shared by the two branches; all other levels vary independently. If there are kk legs in total, the set ΛR\Lambda_R of level lists is thus a product of k−2k-2 ordinary windows and one shared terminal window. Give it the uniform product probability measure.

For a list λ\lambda, let Iλ(γ)I_\lambda(\gamma) indicate that the chord splits into the confined legs and the completing arch at these cuts. The splitting is unique. At each isolated junction the two incident pieces meet the cut once and occupy its opposite half-planes; all other pieces avoid that crossing neighborhood. Put

FR(γ)=1∣ΛR∣∑λ∈ΛRIλ(γ),∫G dμ=∑γ:a→bκL(γ)G(γ).F_R(\gamma)=\frac{1}{|\Lambda_R|}\sum_{\lambda\in\Lambda_R} I_\lambda(\gamma), \qquad\int G\,d\mu=\sum_{\gamma:a\to b}\kappa^{L(\gamma)}G(\gamma).

Multiplication of the kk point-to-line lower bounds and the confined arch lower bound gives

∫FR dμ≥cR−k/4−5/4.\int F_R\,\mathrm{d}\mu\ge cR^{-k/4-5/4}.

For two lists, split each branch at both crossings in each junction neighborhood. The two crossings occur in their normal-level order: the incoming portions start below both levels, and the outgoing portions end above both. The intervening portion is consequently a strict bridge of the level difference. The portions between successive neighborhoods still have separation comparable to RR and cost O(R−1/4)O(R^{-1/4}) each. There are kk such long portions. Beyond the later shared terminal line the remaining arch costs O(R−5/4)O(R^{-5/4}).

For two independent uniform levels u,u′u,u' in a window of order RR,

E(1+∣u−u′∣)−α≤CαR−α(0<α<1).\mathbb{E}(1+|u-u'|)^{-\alpha}\le C_\alpha R^{-\alpha}\qquad(0<\alpha<1).

Every ordinary junction gives one difference bridge and uses this bound with α=1/4\alpha=1/4. The shared terminal level gives two difference bridges, one on each branch, and uses α=1/2\alpha=1/2. Ties are included by the convention B0=1B_0=1. Averaging the joint mass therefore gives

References

  1. [1]K. S. Alexander and Q. Berger. Local asymptotics for the first intersection of two independent renewals. Electronic Journal of Probability 21 (2016), paper 68, 1–20. arXiv:1603.05531.arxiv.org/abs/1603.05531
  2. [2]N. R. Beaton, M. Bousquet-Mélou, J. de Gier, H. Duminil-Copin and A. J. Guttmann. The critical fugacity for surface adsorption of self-avoiding walks on the honeycomb lattice is 1 + √2. Communications in Mathematical Physics 326 (2014), 727–754. doi:10.1007/s00220-014-1896-1.DOI
  3. [3]H. Duminil-Copin and S. Smirnov. The connective constant of the honeycomb lattice equals √(2 + √2). Annals of Mathematics 175 (2012), 1653–1665. doi:10.4007/annals.2012.175.3.14.
  4. [4]B. Dyhr, M. Gilbert, T. Kennedy, G. F. Lawler and S. Passon. The self-avoiding walk spanning a strip. Journal of Statistical Physics 144 (2011), 1–22. doi:10.1007/s10955-011-0258-z. arXiv:1008.4321.DOI
  5. [5]M. J. Gilbert. The fixed irreducible bridge ensemble for self-avoiding walks. Journal of Statistical Physics 159 (2015), 321–335. doi:10.1007/s10955-014-1137-1.DOI
  6. [6]A. Glazman and I. Manolescu. Self-avoiding walk on ℤ² with Yang–Baxter weights: universality of critical fugacity and 2-point function. Annales de l’Institut Henri Poincaré, Probabilités et Statistiques 56 (2020), 2281–2300. doi:10.1214/19-AIHP1024.DOI
  7. [7]S. Jaffard. Propriétés des matrices “bien localisées” près de leur diagonale et quelques applications. Annales de l’Institut Henri Poincaré C, Analyse non linéaire 7 (1990), 461–476. doi:10.1016/S0294-1449(16)30287-6.DOI
  8. [8]H. Kesten. On the number of self-avoiding walks. Journal of Mathematical Physics 4 (1963), 960–969. doi:10.1063/1.1704022.DOI
  9. [9]D. Krachun and C. Panagiotis. Quantitative sub-ballisticity of self-avoiding walk on the hexagonal lattice. Annals of Probability 54 (2026), 1109–1125. doi:10.1214/24-AOP1730.DOI
  10. [10]G. F. Lawler, O. Schramm and W. Werner. On the scaling limit of planar self-avoiding walk. In Fractal Geometry and Applications: A Jubilee of Benoît Mandelbrot, Part 2, Proceedings of Symposia in Pure Mathematics 72, American Mathematical Society, 2004, 339–364. arXiv:math/0204277.DOI
  11. [11]B. Nienhuis. Exact critical point and critical exponents of O(n) models in two dimensions. Physical Review Letters 49 (1982), 1062–1065. doi:10.1103/PhysRevLett.49.1062.DOI
  12. [12]OpenAI. Cylinder amplitudes and logarithmic bridge-length windows on the honeycomb lattice. OpenAI Math Release preprint OAI:Cylinder-amplitudes-and-logarithmic-bridge-length-windows-on-the-honeycomb-lattice-September-26-2026, 2026.
  13. [13]OpenAI. Disk transfer representations and confined bridge mass. OpenAI Math Release preprint OAI:Disk-transfer-representations-and-confined-bridge-mass-September-26-2026, 2026.
  14. [14]OpenAI. Polynomial vacuum representations and bridge mass for honeycomb walks. OpenAI Math Release preprint OAI:Polynomial-vacuum-representations-and-bridge-mass-for-honeycomb-walks-September-26-2026, 2026.
  15. [15]OpenAI. Renewal and changes of law for critical honeycomb walks. OpenAI Math Release preprint OAI:Renewal-and-changes-of-law-for-critical-honeycomb-walks-September-26-2026, 2026.
  16. [16]OpenAI. Uniform marked-polygon estimates and sharp finite bridge moments. OpenAI Math Release preprint OAI:Uniform-marked-polygon-estimates-and-sharp-finite-bridge-moments-September-26-2026, 2026.
  17. [17]B. Simon. The sharp form of the strong Szegő theorem. In Geometry, Spectral Theory, Groups, and Dynamics, Contemporary Mathematics 387, American Mathematical Society, 2005, 253–275. arXiv:math/0402110.DOI
  18. [18]V. Vysotsky. Positivity of integrated random walks. Annales de l’Institut Henri Poincaré, Probabilités et Statistiques 50 (2014), 195–213. doi:10.1214/12-AIHP487.DOI

Paper details

Contents