Title题目 

Concentration inequalities for means of networked samples 

Speaker报告人 

Yuyi Wang 

Department of Computer Science, K.U.Leuven, Belgium 

Date日期 

2013-09-18 AM 10:30 Wednesday 

Venue地点 

Room 104, ITP/理论物理所104会议室 

Abstract摘要 

We improve concentration inequalities for means of non-i.i.d. random variables with networked structure. The method is based on a novel dependency structure and a relaxation of some NP-hard combinatorial optimization problem. We show that our concentration inequalities are always tighter than those established by the Hoeffding's breaking-up method. Applications are given to U-statistics, random strings and random graphs. 

Contact所内联系人 

周海军