arXivDaily arXiv每日学术速递 周一至周五更新
arXiv math/0405355math.PRmath.CO

Deviation inequality for monotonic Boolean functions with application to a number of k-cycles in a random graph

Dmitry Panchenko

英文摘要:

Using Talagrand's concentration inequality on the discrete cube {0,1}^m we show that given a real-valued function Z(x)on {0,1}^m that satisfies certain monotonicity conditions one can control the deviations of Z(x) above its median by a local Lipschitz norm of Z(x) at the point x. As one application, we give a simple proof of a nearly optimal deviation inequality for the number of k-cycles in a random graph.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑