A combinatorial proof of the Burdzy-Pitman conjecture

DOI10.1214/23-ECP512WikidataQ123332057 ScholiaQ123332057MaRDI QIDQ2686004

Stanisław Cichomski, Fedor Petrov

Publication date: 24 February 2023

Published in: Electronic Communications in Probability (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2204.07219

zbMATH Keywords

bipartite graphsconditional expectationsmaximal inequalitycoherent opinions

Mathematics Subject Classification ID

Graph theory (05C99) Probability theory and stochastic processes (60-XX)

Related Items (1)

Doob's estimate for coherent random variables and maximal operators on trees

Cites Work

• Unnamed Item
• Unnamed Item
• Existence of probability measures with given marginals
• Ramsey problems involving degrees in edge-colored complete graphs of vertices belonging to monochromatic subgraphs
• Coherent combination of experts' opinions. (With discussion)
• Bounds on the probability of radically different opinions
• The maximal difference among expert's opinions
• A maximal inequality for skew fields
• Can Coherent Predictions be Contradictory?
• Probability Inequalities for Sums of Bounded Random Variables
• Notes on Spreads of Degrees in Graphs

This page was built for publication: A combinatorial proof of the Burdzy-Pitman conjecture