Degree-based moment estimation for ordered networks

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.

[1]  W. Hoeffding.  Probability Inequalities for sums of Bounded Random Variables , 1963 .

[2]  A. Mukherjea,et al.  Real and Functional Analysis , 1978 .

[3]  M. Loève.  Probability Theory II , 1978 .

[4]  P. Holland,et al.  An Exponential Family of Probability Distributions for Directed Graphs , 1981 .

[5]  Christopher Winship,et al.  REGRESSION MODELS WITH ORDINAL VARIABLES , 1984 .

[6]  D. Kleinbaum,et al.  Regression models for ordinal responses: a review of methods and applications. , 1997, International journal of epidemiology.

[7]  B. Snel,et al.  Comparative assessment of large-scale data sets of protein–protein interactions , 2002, Nature.

[8]  Jie Wu,et al.  Small Worlds: The Dynamics of Networks between Order and Randomness , 2003 .

[9]  Gary D. Bader,et al.  An automated method for finding molecular complexes in large protein interaction networks , 2003, BMC Bioinformatics.

[10]  A. Barabasi,et al.  Functional and topological characterization of protein interaction networks , 2004, Proteomics.

[11]  D. Goodman.  Rural Europe Redux? Reflections on Alternative Agro‐Food Networks and Paradigm Change , 2004 .

[12]  P. Pattison,et al.  New Specifications for Exponential Random Graph Models , 2006 .

[13]  Gueorgi Kossinets,et al.  Empirical Analysis of an Evolving Social Network , 2006, Science.

[14]  G. Seyfang.  Ecological Citizenship and Sustainable Consumption: Examining Local Organic Food Networks. , 2006 .

[15]  A. Barabasi,et al.  Analysis of a large-scale weighted network of one-to-one human communication , 2007, physics/0702158.

[16]  Edoardo M. Airoldi,et al.  A Survey of Statistical Network Models , 2009, Found. Trends Mach. Learn..

[17]  M. Schweinberger.  Instability, Sensitivity, and Degeneracy of Discrete Exponential Families , 2011, Journal of the American Statistical Association.

[18]  Allan Sly,et al.  Random graphs with a given degree sequence , 2010, 1005.1136.

[19]  Persi Diaconis,et al.  A Sequential Importance Sampling Algorithm for Generating Random Graphs with Prescribed Degrees , 2011, Internet Math..

[20]  Stephen E. Fienberg,et al.  A Brief History of Statistical Models for Network Analysis and Open Challenges , 2012 .

[21]  Pavel N Krivitsky,et al.  Exponential-family random graph models for valued networks. , 2011, Electronic journal of statistics.

[22]  Haiyuan Yu,et al.  Detecting overlapping protein complexes in protein-protein interaction networks , 2012, Nature Methods.

[23]  Ricardo Llano-González.  Fowler, J. & Christakis, N. (2009). Connected: the surprising power of our social networks and how they shape our lives. New York: Little, Brown and Company. , 2012 .

[24]  C. Hillar,et al.  Maximum entropy distributions on graphs , 2013, 1301.3321.

[25]  T. Yan,et al.  A central limit theorem in the β-model for undirected random graphs with a diverging number of vertices , 2012, 1202.3307.

[26]  Mauricio Sadinle.  The Strength of Arcs and Edges in Interaction Networks: Elements of a Model-Based Approach , 2012, 1211.0312.

[27]  C. Udriste,et al.  Maximum Entropy Distributions , 2014 .

[28]  T. Yan,et al.  Asymptotics in Undirected Random Graph Models Parameterized by the Strengths of Vertices , 2015 .

[29]  Hong Qin,et al.  Asymptotic normality in the maximum entropy models on graphs with an increasing number of parameters , 2013, J. Multivar. Anal..