A combinatorial proof of the Burdzy-Pitman conjecture
From MaRDI portal
Publication:2686004
Recommendations
Cites work
- A maximal inequality for skew fields
- Bounds on the probability of radically different opinions
- Can coherent predictions be contradictory?
- Coherent combination of experts' opinions. (With discussion)
- Existence of probability measures with given marginals
- Large networks and graph limits
- Notes on spreads of degrees in graphs
- Probability Inequalities for Sums of Bounded Random Variables
- Ramsey problems involving degrees in edge-colored complete graphs of vertices belonging to monochromatic subgraphs
- Szemerédi's regularity lemma revisited
- The maximal difference among expert's opinions
Cited in
(11)- A purely combinatorial proof of the Hadwiger Debrunner \((p,q)\) conjecture
- A combinatorical proof of Kneser's conjecture
- A proof of the equivalence of Tutte's theorem and Tutte-Berge's formula
- scientific article; zbMATH DE number 108289 (Why is no real title available?)
- A combinatorial proof of the skew K-saturation theorem
- scientific article; zbMATH DE number 796185 (Why is no real title available?)
- Doob's estimate for coherent random variables and maximal operators on trees
- A combinatorial proof of the Burdzy-Pitman conjecture
- Contradictory predictions with multiple agents
- On the existence of extreme coherent distributions with no atoms
- Coherent distributions on the square-extreme points and asymptotics
This page was built for publication: A combinatorial proof of the Burdzy-Pitman conjecture
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2686004)