The maximum-entropy median-martingale
Pith reviewed 2026-05-11 02:21 UTC · model grok-4.3
The pith
The maximum-entropy median-martingale walk on the unit interval has the arcsine distribution as its stationary distribution.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
The stationary distribution of the maximum-entropy median-martingale walk on the unit interval is the arcsine distribution. This is shown by a proof that makes explicit the link to the two classical arcsine laws satisfied by Brownian motion. The paper further generalizes the martingale notion and characterizes the stationary distributions of a larger class of walks that obey similar median-type conditions.
What carries the argument
The median-martingale property, requiring that the median of the next state equals the current state, used together with the maximum-entropy selection criterion to define the walk on the unit interval.
If this is right
- The long-run distribution of the walk is exactly the arcsine distribution.
- The construction directly illuminates the connection to the arcsine laws of Brownian motion.
- Generalizing the martingale condition allows characterization of stationary distributions for a broader family of walks.
- The proof technique relies on symmetry properties shared by the discrete walk and Brownian motion.
Where Pith is reading between the lines
- The same symmetry might let discrete simulations approximate certain Brownian functionals without solving the corresponding PDEs.
- The approach could be tested on walks defined on other bounded intervals or with different median-type constraints.
- If the pattern holds, similar maximum-entropy constructions might recover other classical distributions tied to diffusion processes.
Load-bearing premise
A unique maximum-entropy walk on the unit interval exists and satisfies the median-martingale property.
What would settle it
Finding any walk on the unit interval that maximizes entropy subject to the median-next-state condition yet converges to a stationary distribution other than the arcsine distribution would disprove the claim.
read the original abstract
This short note explores the maximum-entropy walk on the unit interval that is a median-martingale. That is, the median of its next state is equal to its current state. The stationary distribution of this walk is the arcsine distribution, and we provide a proof that elucidates the connection to two classical arcsine laws for Brownian motion. The notion of a martingale is further generalized, and a larger class of walks is considered and similarly characterized.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript constructs a maximum-entropy Markov walk on the unit interval [0,1] obeying the median-martingale condition (the median of the next-state distribution equals the current state). It proves that the stationary distribution of this walk is the arcsine law and supplies a proof relating the construction to the two classical arcsine laws for Brownian motion. The paper further generalizes the martingale notion and characterizes a larger class of walks with analogous properties.
Significance. If the construction and proof hold, the work supplies a parameter-free characterization of the arcsine distribution as the stationary measure of a maximum-entropy median-martingale process, together with an explicit link to Brownian-motion arcsine laws. The generalization to a broader class of walks adds scope. These features would constitute a modest but clean contribution to the interface of entropy maximization, martingale theory, and diffusion processes.
minor comments (2)
- [Abstract] The abstract states that a proof is provided but does not indicate the section or theorem number where the connection to the classical arcsine laws is established; adding a forward reference would improve navigability.
- The generalization of the martingale concept is mentioned only briefly; a short dedicated paragraph or subsection outlining the precise extension would clarify the scope of the larger class of walks.
Simulated Author's Rebuttal
We thank the referee for the positive assessment of our manuscript and the recommendation to accept. There are no major comments to address.
Circularity Check
No significant circularity detected
full rationale
The paper constructs a maximum-entropy Markov walk on [0,1] obeying the median-martingale condition and proves that its stationary measure is the arcsine law, with an explicit connection to the classical arcsine laws for Brownian motion. The derivation is presented as a characterization supported by a proof; no step reduces by construction to a fitted parameter, self-definition, or load-bearing self-citation. The central claim remains independent of its inputs.
Axiom & Free-Parameter Ledger
axioms (1)
- domain assumption There exists a unique maximum-entropy random walk on the unit interval satisfying the median-martingale property.
Lean theorems connected to this paper
-
IndisputableMonolith/Cost/FunctionalEquation.leanwashburn_uniqueness_aczel echoes?
echoesECHOES: this paper passage has the same mathematical shape or conceptual pattern as the Recognition theorem, but is not a direct formal dependency.
ρ(s) = 1/Z_p (2/(x^p + (1−x)^p))^{1/p} ... lim p→0 M_p = √(ab) ... recovers arcsine
-
IndisputableMonolith/Foundation/BranchSelection.leanbranch_selection echoes?
echoesECHOES: this paper passage has the same mathematical shape or conceptual pattern as the Recognition theorem, but is not a direct formal dependency.
median-martingale ... maximum-entropy walk ... ℓ_q-minimizing-martingales
What do these tags mean?
- matches
- The paper's claim is directly supported by a theorem in the formal canon.
- supports
- The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
- extends
- The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
- uses
- The paper appears to rely on the theorem as machinery.
- contradicts
- The paper's claim conflicts with a theorem or certificate in the canon.
- unclear
- Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.
Reference graph
Works this paper leans on
-
[1]
On expected occupation time of Brownian bridge
Chi, Z., Pozdnyakov, V., and Yan, J. On expected occupation time of Brownian bridge . Statistics and Probability Letters 97\/ (Feb. 2015), 83–87
work page 2015
-
[2]
Coudin, E., and Dufour, J.-M. Finite-sample distribution-free inference in linear median regressions under heteroscedasticity and non-linear dependence of unknown form . The Econometrics Journal 12 , S1 (2009), S19--S49
work page 2009
-
[3]
Diaconis, P., and Freedman, D. Iterated random functions. SIAM Review 41 , 1 (Jan. 1999), 45–76
work page 1999
-
[4]
Sur certains processus stochastiques homog\'enes
L\'evy, P. Sur certains processus stochastiques homog\'enes. Compositio Mathematica\/ (1940), 283--339
work page 1940
-
[5]
G., Stoyanov, J., and Universio, N
Pacheco–Gonz \'a lez, C. G., Stoyanov, J., and Universio, N. A class of markov chains with beta ergodic distributions
-
[6]
Pincheira, P. M. Shrinkage Based Tests of the Martingale Difference Hypothesis . SSRN Electronic Journal\/ (2006)
work page 2006
-
[7]
Revuz, D., and Yor, M. Excursions. In Continuous Martingales and Brownian Motion . Springer Berlin Heidelberg, Berlin, Heidelberg, 1999, pp. 471--513
work page 1999
-
[8]
Random motions, classes of ergodic markov chains and beta distributions
Stoyanov, J., and Pirinsky, C. Random motions, classes of ergodic markov chains and beta distributions. Statistics and Probability Letters 50 , 3 (Nov. 2000), 293–304
work page 2000
-
[9]
Stabilizing the Splits through Minimax Decision Trees
Zhang, Z., and Luo, H. Stabilizing the Splits through Minimax Decision Trees . arXiv 2502.16758\/ (2026)
work page internal anchor Pith review Pith/arXiv arXiv 2026
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.