pith. sign in

arxiv: 2606.23896 · v1 · pith:G35LTLQZnew · submitted 2026-06-22 · 🧮 math.PR · math.GR

The one-point Schreier Poisson boundary of Thompson's group F

Christian M\"onch This is my paper

Pith reviewed 2026-06-26 06:44 UTC · model grok-4.3

classification 🧮 math.PR math.GR
keywords Poisson boundaryThompson's group FSchreier graphrandom walkharmonic measureskeleton end boundarydyadic orbitBernoulli measure
0
0 comments X

The pith

The Poisson boundary of the one-point Schreier walk on Thompson's group F is the skeleton end boundary.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper identifies the Poisson boundary for the random walk obtained by projecting the simple symmetric walk on Thompson's group F onto the dyadic point 1/2. It proves that this boundary equals the skeleton end boundary of the associated Schreier graph. The proof reduces the problem, via an explicit trace, to standard Poisson-Martin theory on a rooted binary tree with two unequal edge conductances. The resulting hitting measure is a biased Bernoulli product measure on odd 2-adic integers whose bias is computed explicitly. A reader cares because the construction gives a concrete, computable description of the boundary for this non-amenable group action.

Core claim

For the associated simple labelled-generator walk on the dyadic Schreier graph, the full Poisson boundary is the skeleton end boundary. After tracing to the grey skeleton and deleting holding probabilities the walk becomes a reversible nearest-neighbor walk on the rooted binary tree with two unequal classes of edge conductance. Following Kaimanovich's coding of skeleton ends by odd 2-adic integers, the hitting measure is a biased Bernoulli product measure with explicitly computed bias; it is singular with respect to Haar measure, has full topological support, and is exact-dimensional.

What carries the argument

The dyadic Schreier graph, described as a binary-tree skeleton with recurrent one-dimensional ray attachments; tracing reduces the walk to a reversible nearest-neighbor walk on the rooted binary tree with two unequal edge conductances.

If this is right

  • The hitting measure is singular with respect to Haar measure on the boundary.
  • The hitting measure has full topological support on the skeleton ends.
  • The hitting measure is exact-dimensional, with the dimension and bias constants computed explicitly from the conductances.
  • The reduction to Poisson-Martin theory on the tree determines the full Poisson boundary without additional factors.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The explicit product structure of the hitting measure may allow closed-form expressions for the walk's entropy or asymptotic drift.
  • Similar Schreier graphs for other groups with tree-like skeletons could admit the same reduction and yield analogous Bernoulli hitting measures.
  • Singularity to Haar measure implies that the walk's path measures are mutually singular to the uniform measure on the group orbit closure.

Load-bearing premise

The Schreier graph admits a description as a binary-tree skeleton with recurrent one-dimensional ray attachments that permits the trace reduction to a walk on the rooted binary tree.

What would settle it

A direct calculation of the hitting probabilities for the traced walk on the skeleton ends that fails to match the biased Bernoulli product measure with the stated bias.

Figures

Figures reproduced from arXiv: 2606.23896 by Christian M\"onch.

Figure 1
Figure 1. Figure 1: Schematic of the reduction. The solid binary tree is the grey skeleton 𝐵, while the dashed pieces indicate recurrent one-dimensional ray attachments in the Schreier graph. Tracing the labelled-generator walk to 𝐵 and deleting holds gives the displayed conductance walk, whose ends are coded by odd 2-adic integers. the four maps 𝐴e±1 , 𝐵e±1 , not from choosing uniformly among the distinct neighboring vertice… view at source ↗
read the original abstract

We identify the Poisson boundary of the one-point Schreier-chain random walk obtained by projecting the simple symmetric random walk on Thompson's group $F$ to the dyadic orbit point $1/2$. For the associated simple labelled-generator walk on the dyadic Schreier graph, the full Poisson boundary is the skeleton end boundary. The proof combines the known description of this Schreier graph as a binary-tree skeleton with recurrent one-dimensional ray attachments with an explicit trace computation. After tracing to the grey skeleton and deleting holding probabilities, the walk becomes a reversible nearest-neighbor walk on the rooted binary tree with two unequal classes of edge conductance. This reduces the boundary identification to standard Poisson--Martin theory for transient walks on trees and leaves a finite electrical-network calculation for the harmonic measure. Following Kaimanovich's coding of skeleton ends by odd 2-adic integers [{\emph{Groups, Graphs and Random Walks}}, London Math. Soc. Lecture Note Ser.~436, pp.~300--342, 2017], the hitting measure is a biased Bernoulli product measure with explicitly computed bias. It is singular with respect to Haar measure, has full topological support, and is exact-dimensional; these properties and the exact constants are proved here.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 2 minor

Summary. The paper claims to identify the Poisson boundary of the one-point Schreier-chain random walk obtained by projecting the simple symmetric random walk on Thompson's group F to the dyadic orbit point 1/2. For the associated simple labelled-generator walk on the dyadic Schreier graph, the full Poisson boundary is the skeleton end boundary. The proof combines the known description of this Schreier graph as a binary-tree skeleton with recurrent one-dimensional ray attachments with an explicit trace computation. After tracing to the grey skeleton and deleting holding probabilities, the walk becomes a reversible nearest-neighbor walk on the rooted binary tree with two unequal classes of edge conductance. This reduces the boundary identification to standard Poisson--Martin theory for transient walks on trees and leaves a finite electrical-network calculation for the harmonic measure. Following Kaimanovich's coding of skeleton ends by odd 2-adic integers, the hitting measure is a biased Bernoulli product measure with explicitly computed bias. It is singular with respect to Haar measure, has full topological support, and is exact-dimensional; these properties and the exact constants are proved here.

Significance. If the result holds, the paper delivers an explicit identification of the Poisson boundary together with a closed-form expression for the hitting measure (a biased Bernoulli product on the 2-adic boundary) and verifies its singularity, support, and exact dimensionality. The derivation rests on a previously known combinatorial description of the Schreier graph, a transparent trace that reduces to standard Poisson-Martin theory on trees, and Kaimanovich's coding; the absence of free parameters or post-hoc fitting in the bias computation is a clear strength. This supplies a concrete, verifiable example in the study of boundaries for random walks on Thompson's group F and similar finitely generated groups.

minor comments (2)
  1. [Abstract] The abstract states that the bias is 'explicitly computed' but does not record the numerical value or closed-form expression; stating the bias (e.g., the conductance ratio or the resulting Bernoulli parameter) already in the abstract would improve immediate readability.
  2. The reduction step that deletes holding probabilities and obtains the two conductance classes on the binary tree is described at a high level; a short displayed equation or diagram showing the conductances on even/odd levels would make the electrical-network calculation easier to follow without consulting the cited prior work on the graph.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive summary, significance assessment, and recommendation to accept the manuscript. There are no major comments requiring a point-by-point response.

Circularity Check

0 steps flagged

No significant circularity identified

full rationale

The derivation combines a cited known combinatorial description of the dyadic Schreier graph with an explicit trace computation performed in the paper, reducing the walk to a nearest-neighbor reversible walk on the rooted binary tree whose conductances are constant on levels. Standard Poisson-Martin theory then identifies the boundary, after which Kaimanovich's external coding yields the biased Bernoulli measure whose bias is computed explicitly here. All listed properties (singularity, support, dimension) follow from that closed-form bias and standard Bernoulli facts. No step equates a claimed result to its own inputs by definition, renames a fitted quantity as a prediction, or rests the central claim solely on a self-citation chain; the load-bearing reductions invoke external literature and perform independent calculations.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

Based on the abstract, the central claim rests on the domain assumption about the graph structure and standard mathematical results on random walks on trees. No free parameters or new entities are mentioned.

axioms (2)
  • domain assumption The Schreier graph admits a description as a binary-tree skeleton with recurrent one-dimensional ray attachments.
    Invoked to allow the trace computation that reduces the walk to the skeleton.
  • standard math Standard Poisson-Martin theory for transient walks on trees applies after the conductance adjustment.
    Used to conclude that the boundary is the skeleton end boundary and to obtain the hitting measure.

pith-pipeline@v0.9.1-grok · 5745 in / 1656 out tokens · 37248 ms · 2026-06-26T06:44:34.521115+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

11 extracted references · 3 linked inside Pith

  1. [1]

    and Soardi, Paolo M

    Cartwright, Donald I. and Soardi, Paolo M. and Woess, Wolfgang , title =. Transactions of the American Mathematical Society , volume =. 1993 , doi =

    1993

  2. [2]

    and Geoghegan, Ross , title =

    Brown, Kenneth S. and Geoghegan, Ross , title =. Inventiones Mathematicae , volume =. 1984 , doi =

    1984

  3. [3]

    and Floyd, William J

    Cannon, James W. and Floyd, William J. and Parry, Walter R. , title =. L'Enseignement Mathématique , series =. 1996 , mrnumber =

    1996

  4. [4]

    , title =

    Kaimanovich, Vadim A. , title =. Groups, Graphs and Random Walks , editor =. 2017 , doi =. 1602.02971 , eprinttype =

    Pith/arXiv arXiv 2017

  5. [5]

    2015 , eprint =

    Mishchenko, Pavlo , title =. 2015 , eprint =

    2015

  6. [6]

    and Woess, Wolfgang , title =

    Picardello, Massimo A. and Woess, Wolfgang , title =. Transactions of the American Mathematical Society , volume =. 1987 , doi =

    1987

  7. [7]

    Combinatorial and Geometric Group Theory , editor =

    Savchuk, Dmytro , title =. Combinatorial and Geometric Group Theory , editor =. 2010 , doi =. 0803.0043 , eprinttype =

    Pith/arXiv arXiv 2010

  8. [8]

    Geometriae Dedicata , volume =

    Savchuk, Dmytro , title =. Geometriae Dedicata , volume =. 2015 , doi =. 1105.4017 , eprinttype =

    Pith/arXiv arXiv 2015

  9. [9]

    Journal of Theoretical Probability , volume =

    Stankov, Bogdan , title =. Journal of Theoretical Probability , volume =. 2022 , doi =. 1905.10120 , eprinttype =

    arXiv 2022

  10. [10]

    2000 , doi =

    Woess, Wolfgang , title =. 2000 , doi =

    2000

  11. [11]

    2009 , doi =

    Woess, Wolfgang , title =. 2009 , doi =

    2009