主 题: 题目请看摘要
报告人: 肖益民 ((密西根大学))
时 间: 0000-00-00
地 点: 理科楼1479厂
题目：搁别苍别飞补濒&苍产蝉辫;罢别肠丑苍颈辩耻别蝉&苍产蝉辫;颈苍&苍产蝉辫;贵谤补肠迟补濒蝉,&苍产蝉辫;厂尘补濒濒&苍产蝉辫;叠补濒濒&苍产蝉辫;笔谤辞产补产颈濒颈迟颈别蝉&苍产蝉辫;补苍诲&苍产蝉辫;狈别迟飞辞谤诲&苍产蝉辫;罢谤补蹿蹿颈肠&苍产蝉辫;惭辞诲别濒颈苍驳.&苍产蝉辫;
摘要：
Renewal techniques have been quite useful in studying the
asymptotic behavior of covering and packing functions---as well as Minkowski measurability of---self similar sets that satisfy the open set condition. They also arise in certain counting problems in ergodic theory. In this talk, we present some further applications of the renewal theorems in proving the existence ofconstants in small ball probabilities, as well as long-range dependence in some network traffic models.
