A test on the L-moments of the degree distribution of a Barabási-Albert network for detecting nodal and edge degradation

[1]  A Note on Order Statistics , 1971 .

[2]  J. Hosking.  L‐Moments: Analysis and Estimation of Distributions Using Linear Combinations of Order Statistics , 1990 .

[3]  Duncan J. Watts,et al.  Collective dynamics of ‘small-world’ networks , 1998, Nature.

[4]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[5]  J. R. Wallis,et al.  Probability Weighted Moments: Definition and Relation to Parameters of Several Distributions Expressable in Inverse Form , 1979 .

[6]  L. K. Chan.  On a Characterization of Distributions by Expected Values of Extreme Order Statistics , 1967 .

[7]  M. Newman,et al.  The structure of scientific collaboration networks. , 2000, Proceedings of the National Academy of Sciences of the United States of America.

[8]  Mark E. J. Newman,et al.  Power-Law Distributions in Empirical Data , 2007, SIAM Rev..

[9]  Michael Small,et al.  How is that complex network complex? , 2014, 2014 IEEE International Symposium on Circuits and Systems (ISCAS).

[10]  D S Callaway,et al.  Network robustness and fragility: percolation on random graphs. , 2000, Physical review letters.

[11]  Q. J. Wang.  DIRECT SAMPLE ESTIMATORS OF L MOMENTS , 1996 .

[12]  J. Royston.  Some Techniques for Assessing Multivarate Normality Based on the Shapiro‐Wilk W , 1983 .

[13]  W. Zachary,et al.  An Information Flow Model for Conflict and Fission in Small Groups , 1977, Journal of Anthropological Research.

[14]  A. Seheult,et al.  Exact variance structure of sample L-moments , 2004 .

[15]  Li Wang,et al.  Impact of Degree Heterogeneity on Attack Vulnerability of Interdependent Networks , 2016, Scientific Reports.

[16]  Albert-László Barabási,et al.  Error and attack tolerance of complex networks , 2000, Nature.

[17]  M. Newman,et al.  Finding community structure in networks using the eigenvectors of matrices. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[18]  Beom Jun Kim,et al.  Attack vulnerability of complex networks. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[19]  M. E. J. Newman,et al.  Power laws, Pareto distributions and Zipf's law , 2005 .

[20]  Richard F. Deckro,et al.  Parameter specification for the degree distribution of simulated Barabási–Albert graphs , 2017 .

[21]  Lada A. Adamic,et al.  The political blogosphere and the 2004 U.S. election: divided they blog , 2005, LinkKDD '05.

[22]  G. P. Sillitto.  INTERRELATIONS BETWEEN CERTAIN LINEAR SYSTEMATIC STATISTICS OF SAMPLES FROM ANY CONTINUOUS POPULATION , 1951 .

[23]  C. Mallows.  Bounds on Distribution Functions in Terms of Expectations of Order- Statistics , 1973 .

[24]  T. Killingback,et al.  Attack Robustness and Centrality of Complex Networks , 2013, PloS one.

[25]  Donald E. Knuth,et al.  The Stanford GraphBase - a platform for combinatorial computing , 1993 .

[26]  D. Lusseau,et al.  The bottlenose dolphin community of Doubtful Sound features a large proportion of long-lasting associations , 2003, Behavioral Ecology and Sociobiology.

[27]  F. Downton,et al.  Linear estimates with polynomial coefficients. , 1966, Biometrika.

[28]  G. P. Sillitto.  Derivation of approximants to the inverse distribution function of a continuous univariate population from the order statistics of a sample , 1969 .

[29]  Stanley Wasserman,et al.  Social Network Analysis: Methods and Applications , 1994 .

[30]  Albert-László Barabási,et al.  Internet: Diameter of the World-Wide Web , 1999, Nature.

[31]  Konstantin Avrachenkov,et al.  Cooperative Game Theory Approaches for Network Partitioning , 2017, COCOON.

[32]  Filippo Radicchi,et al.  Percolation in real interdependent networks , 2015, Nature Physics.

[33]  Matthias Dehmer,et al.  Entropy and the Complexity of Graphs Revisited , 2012, Entropy.

[34]  Zhi-Dan Zhao,et al.  Emergence of scaling in human-interest dynamics , 2013, Scientific Reports.

[35]  Jure Leskovec,et al.  Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters , 2008, Internet Math..

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

[37]  Richard F. Deckro,et al.  A random graph generation algorithm for the analysis of social networks , 2014 .