DeepAI AI Chat
Log In Sign Up

A Statistical Approach to Broken Stick Problems

07/16/2022
by   Rahul Mukerjee, et al.
0

Let a stick be broken at random at n-1 points to form n pieces. We consider three problems on forming k-gons with k out of these n pieces, and show how a statistical approach, through a linear transformation of variables, yields simple solutions that also allow fast computation.

READ FULL TEXT

page 1

page 2

page 3

page 4

07/25/2022

Improved Bounds for Sampling Solutions of Random CNF Formulas

Let Φ be a random k-CNF formula on n variables and m clauses, where each...
03/08/2020

The rencontre problem

Let {X^1_k}_k=1^∞, {X^2_k}_k=1^∞, ..., {X^d_k}_k=1^∞ be d independent se...
01/20/2019

Four Deviations Suffice for Rank 1 Matrices

We prove a matrix discrepancy bound that strengthens the famous Kadison-...
09/01/2022

A correlation inequality for random points in a hypercube with some implications

Let ≺ be the product order on ℝ^k and assume that X_1,X_2,…,X_n (n≥3) ar...
12/08/2021

Sparse Representations of Solutions to a class of Random Boundary Value Problems

In the present study, we consider sparse representations of solutions to...
05/26/2017

A refined and asymptotic analysis of optimal stopping problems of Bruss and Weber

The classical secretary problem has been generalized over the years into...
08/10/2016

Estimation from Indirect Supervision with Linear Moments

In structured prediction problems where we have indirect supervision of ...