A combinatorial proof of the burdzy-pitman conjecture

HIGHLIGHTS

• who: Please see https://doi.org/10.1214/23-ECP512 from the (UNIVERSITY) have published the paper: A combinatorial proof of the Burdzy-Pitman conjecture, in the Journal: (JOURNAL)
• what: For n u2265 k > n the authors show that 1 |deg(ui ) - deg(vj )| u2265 k u2264 2k(n - k). Later in the same section the authors provide an elementary example showing that the bound (1.2) is sharp. The authors show how to transform the Theorem 1.1 to Theorem 1.2.

SUMMARY

Let (Ω, F, P) be a probability space . . .

 



If you want to have access to all the content you need to log in!

Thanks :)

Username or Email

Password

Remember me

Lost your password?

If you don't have an account, you can create one here.