user2316602
  • Member for 7 years, 2 months
  • Last seen this week
Spectral methods with linear programming
1 votes

I do not think that this can be done with linear programming. However, there is a generalisation of linear programming called semidefinite programming which allows you to do this. I think you should ...

View answer
Relative estimation of Bernoulli parameter -- reference request
0 votes

I was finally able to find a reference, though it took me way too long. This paper [1] shows an algorithm that does exactly this, see Theorem 5 in that paper. The idea does not come from this paper, ...

View answer
Inequality $1+x \geq e^{f(x)}$?
Accepted answer
0 votes

As correctly pointed out in the comments, I can use $\ln(1+x)$ and clearly, nothing "better" can exist. However, I have found the inequality $1-x \geq e^{-\frac{x}{1-x}}$ which holds for $x \leq 1$. ...

View answer
Max matching size in a random graph
0 votes

I would like to expand on the answer of D Poole, specifically to show the concentration of $Y$. It is actually really easy if we use the method of bounded differences: Theorem Suppose that $X_1$, $...

View answer