A Discretization of Bertrand's Paradox
Gregory Churchill, Dakota Williams
Abstract
In this paper we present a discrete version of Bertrand's paradox, where each sample space is a finite set of chords and a chord is chosen uniformly at random.
Create a lesson
Related papers
On Solutions to Graphon McKean-Vlasov SDEs of Nemytskii-type
Sebastian Grube, Guodong Pang, Michael Röckner
Facilitated Exclusion Process in Higher Dimensions: Recurrent Structure and Transient Dynamics
Seonwoo Kim, Sanha Lee, Insuk Seo
On the telegrapher's signals of sticky local times
F. Colantoni, M. D'Ovidio
p-roughness of paths and invariance of p-th variation
Rama Cont
Exponential convergence of Sinkhorn algorithm for entropy martingale optimal transport
Anna Kazeykina, Zhenjie Ren, Hecheng Wang
Delocalisation and scaling limit for the disordered long-range Discrete Gaussian Chain
Christopher Chalhoub, Paul Dario, Corentin Faipeur et al.