# Dong Yao : Two problems in probability theory

This talk will be concerned with two problems. The first is the zeros of the derivatives of. Kac random polynomials K_n, which is a random polynomial with i.i.d. coefficients. It has been shown that the empirical measure of zeros of K_n will converge to the uniform measure on the unit circle of complex plane. Same convergence holds true for nay fixed order of derivative of K_n. In a joint work with Renjie Feng, we show if we consider the N_n-th order of derivative of K_n, then asymptotic behavior of empirical measure of this derivative will depend on the limit of \frac{N_n}{n}. In particular, as long as this ratio is greater than 0, the phenomenon of Â?zeros clustering around unit circleÂ? breaks down. The second talk is about Average Nearest Neighbor Degree (ANND), which is a measure for the degree-degree correlation for complex network. We shall be concerned with the probabilistic properties of ANND in the configuration model. We prove if the variable X generating the network has order of moment larger than 2, then the ANND(k) will converge uniformly to μ2/μ1, where μ2 is the second moment of X, and μ1 is the first moment. For the case that X has infinite variance, we show the pointwise (i.e., for fixed k) scaled convergence of ANND(k) to a stable random variable. This is joint work with Nelly Litvak and Pim van der Hoorn. More recently, Clara Stegehuis showed that when X is sample from the Pareto distribution, then one can obtain a complete spectrum of ANND(k) for the erased configuration model.

**Category**: Graduate/Faculty Seminar**Duration**: 01:14:59**Date**: November 20, 2017 at 11:55 AM**Views**: 197-
**Tags:**seminar, Graduate/faculty Seminar

## 0 Comments