Searcharxiv⌕ Search

arXiv · 2611.00981

Invariant universal averages and Bertrand's paradox: a response to Shackel

Abstract

In 2014, with D. Aerts we proposed a solution to the hard problem of Bertrand's paradox by means of a universal average over different ways of randomizing an entity. In his recent monograph, N. Shackel raises objections concerning the approximation by cellular densities, the restrictions used in their construction, the apparently trivial limit of their averages, the choice of a second-order probability law, and the dependence of the result on the naming of chords. We revisit these objections using the invariance-based formulation of the universal average. The first objection is well taken, and the approximation argument is repaired: an explicit sequence of bivalent cellular densities provides weak approximation of any prescribed probability measure, with an error bound for intervals. We show that any second-order selection law invariant under rearrangements of equal-length cells has the same uniform barycenter, independently of the particular densities and weights employed. For cellular densities, this conclusion holds exactly at every finite resolution. Thus, non-uniqueness of the second-order law does not prevent uniqueness of the resulting average within the indifferent class. Finally, we prove that no probability measure can be invariant under both these rearrangements and arbitrary changes of interval lengths. The reference geometry therefore cannot be obtained by averaging alone: it must be supplied by the physical modelization of the randomized entity. These results clarify the scope, and the limitations, of our original distinction between the easy and hard problems of Bertrand's paradox.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Massimiliano Sassoli de Bianchi. 2026-10-31. Invariant universal averages and Bertrand's paradox: a response to Shackel. https://arxiv.org/abs/2611.00981

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Quantitative Propagation of Chaos for Singular Interacting Particle Systems Driven by Fractional Brownian Motion

We consider interacting systems particle driven by i.i.d. fractional Brownian motions, subject to irregular, possibly distributional, pairwise interactions. We show propagation of chaos and mean field convergence to the law of the associated McKean--Vlasov equation, as the number of particles $N\to\infty$, with quantitative sharp rates of order $N^{-1/2}$. Our results hold for a wide class of possibly time-dependent interactions, which are only assumed to satisfy a Besov-type regularity, related to the Hurst parameter $H\in (0,+\infty)\setminus \mathbb{N}$ of the driving noises. In particular, as $H$ decreases to $0$, interaction kernels of arbitrary singularity can be considered, a phenomenon frequently observed in regularization by noise results. Our proofs rely on a combinations of Sznitman's direct comparison argument with stochastic sewing techniques.

math.PR↗

Power rate of convergence of discrete curves: framework and applications

We develop a framework for power-law rates of convergence of random discrete curves to Schramm Loewner Evolution (SLE). We show that a power-law rate of convergence of a suitable martingale observable gives a power-law rate of convergence of the interface to SLE, provided the discrete curves satisfy the Kemppainen-Smirnov crossing condition; the proof uses known estimates on the derivative of the SLE map. We apply the framework to the exploration process of critical site percolation on the triangular lattice, obtaining a power-law rate of convergence to SLE$_6$.

math.PR↗

Refining Concentration Bounds for Gaussian Quadratic Chaos with Applications

This paper studies concentration of measure for Gaussian quadratic chaos in the non-asymptotic regime. We begin by tightening the classic Hanson-Wright inequality, where we increase its absolute constant $κ$ from 0.125 to at least 0.1457 in the symmetric case. We present a sharper version of Laurent-Massart inequality (LMI), which increases $κ$ from the largest available value of $1-\frac{\sqrt{3}}{2}\approx 0.134$ to $\frac{9-\sqrt{17}}{32}\approx 0.152$ in the positive-semidefinite case. We develop a sequence of inequalities indexed by $m\ge1$ that involve Schatten norms of the underlying matrix. The case $m=1$ recovers HWI. The bounds undergo a phase transition in the sense that if the tail parameter is smaller than a critical threshold $τ_c$, then $m=1$ is the tightest, whereas if it is larger than $τ_c$, then $m=\infty$ is the tightest. This leads to a novel bound called the $m_\infty$ bound. All HWI, LMI and the $m_\infty$ inequality rely on Markov's inequality. By avoiding Markov's inequality, we introduce the strong and weak $χ^2$ inequalities. We provide a list of concentration bounds that depend only on the operator norm in the positive-definite case, namely, the $m_\infty$ bound, the weak $χ^2$ bound, relaxed versions of HWI and LMI, and the so-called large-deviations bound. The sharpest among these is shown to be always either the $m_\infty$ bound or the weak $χ^2$ bound. By utilizing conditioning, modified versions of $m_\infty$, $χ^2$, and HW inequalities of various orders are proposed, all of which can be significantly tighter than the original inequalities. By leveraging the Ruben-Kotz expansion for the distribution of a positive-definite quadratic form, we introduce the Ruben-Kotz inequalities (RKIs) for general symmetric quadratic forms. A key advantage of RKIs is that they provide an explicit upper bound on the approximation gap.

math.PR↗