Degree-based moment estimation for ordered networks.
J. Syst. Sci. Complex 30: 721-733. • 2017
Publication Information
Authors
Li W., Yan T., Abd Elgawad, M. A. and Qin H.
Keywords
Not Available
Journal
J. Syst. Sci. Complex 30: 721-733.
Publisher
DOI: 10.1007/s11424- 017-5307-5.
Volume
Not Available
Issue
Not Available
Pages
Not Available
publication.type
International
Paper Link
Not Available
Supplementary Materials
Not Available
Abstract
The edges between vertices in networks take not only the common binary values, but
also the ordered values in some situations (e.g., the measurement of the relationship between people
from worst to best in social networks). In this paper, the authors study the asymptotic property of the
moment estimator based on the degrees of vertices in ordered networks whose edges are ordered random
variables. In particular, the authors establish the uniform consistency and the asymptotic normality
of the moment estimator when the number of parameters goes to infinity. Simulations and a real data
example are provided to illustrate asymptotic results.
also the ordered values in some situations (e.g., the measurement of the relationship between people
from worst to best in social networks). In this paper, the authors study the asymptotic property of the
moment estimator based on the degrees of vertices in ordered networks whose edges are ordered random
variables. In particular, the authors establish the uniform consistency and the asymptotic normality
of the moment estimator when the number of parameters goes to infinity. Simulations and a real data
example are provided to illustrate asymptotic results.
Staff Members - Benha University