Sampling for Conditional Inference on Network Data

REFERENCES

• Albert , R. , Jeong , H. and Barabási , A. L. 2000 . “Error and Attack Tolerance of Complex Networks,” . Nature , 406 : 378 – 382 .
   PubMed Web of Science ®Google Scholar
• Baird , D. and Ulanowicz , R. E. 1989 . “The Seasonal Dynamics of the Chesapeake Bay Ecosystem,” . Ecological Monographs , 59 : 329 – 364 .
   Web of Science ®Google Scholar
• Bayati , M. , Kim , J. H. and Saberi , A. 2010 . “A Sequential Algorithm for Generating Random Graphs,” . Algorithmica , 58 : 860 – 910 .
   Web of Science ®Google Scholar
• Bender , E. A. and Canfield , E. R. 1978 . “The Asymptotic Number of Labeled Graphs With Given Degree Sequences,” . Journal of Combinatorial Theory, Series A , 24 : 296 – 307 .
   Web of Science ®Google Scholar
• Blanchet , J. H. 2009 . “Efficient Importance Sampling for Binary Contingency Tables,” . The Annals of Applied Probability , 19 : 949 – 982 .
   Web of Science ®Google Scholar
• Blitzstein , J. and Diaconis , P. 2010 . “A Sequential Importance Sampling Algorithm for Generating Random Graphs With Prescribed Degrees,” . Internet Mathematics , 6 : 489 – 522 .
   Google Scholar
• Bollobas , B. 2001 . Random Graphs (2nd ed.) , New York : Cambridge University Press .
   Google Scholar
• Borgatti , S. P. , Mehra , A. , Brass , D. J. and Labianca , G. 2009 . “Network Analysis in the Social Sciences,” . Science , 323 : 892 – 895 .
   PubMed Web of Science ®Google Scholar
• Chen , S. X. and Liu , J. S. 1997 . “Statistical Applications of the Poisson-Binomial and Conditional Bernoulli Distributions,” . Statistica Sinica , 7 : 875 – 892 .
   Web of Science ®Google Scholar
• Chen , X. H. , Dempster , A. P. and Liu , J. S. 1994 . “Weighted Finite Population Sampling to Maximize Entropy,” . Biometrika , 81 : 457 – 469 .
   Web of Science ®Google Scholar
• Del Genio , C. I. , Kim , H. , Toroczkai , Z. and Bassler , K. E. 2010 . “Efficient and Exact Sampling of Simple Graphs With Given Arbitrary Degree Sequence,” . PLoS ONE , 5 : e10012
   PubMed Web of Science ®Google Scholar
• Diaconis , P. and Sturmfels , B. 1998 . “Algebraic Methods for Sampling From Conditional Distributions,” . The Annals of Statistics , 26 : 363 – 397 .
   Web of Science ®Google Scholar
• Erdős , P. and Gallai , T. 1960 . “Graphen mit Punkten vorgeschriebenen Grades,” . Matematikai Lapok , 11 : 264 – 274 . [Graphs with Prescribed Degrees of Vertices],
   Google Scholar
• Goldenberg , A. , Zheng , A. X. , Fienberg , S. E. and Airoldi , E. M. 2009 . “A Survey of Statistical Network Models,” . Foundations and Trends in Machine Learning , 2 : 129 – 233 .
   Google Scholar
• Handcock , M. S. , Hunter , D. R. , Butts , C. T. , Goodreau , S. M. and Morris , M. 2008 . “statnet: Software Tools for the Representation, Visualization, Analysis and Simulation of Network Data,” . Journal of Statistical Software , 24 : 1 – 11 .
   PubMedGoogle Scholar
• Holland , P. W. and Leinhardt , S. 1981 . “An Exponential Family of Probability Distributions for Directed Graphs” (with discussion), . Journal of the American Statistical Association , 76 : 33 – 65 .
   Web of Science ®Google Scholar
• Kashtan , N. , Itzkovitz , S. , Milo , R. and Alon , U. 2004 . “Efficient Sampling Algorithm for Estimating Subgraph Concentrations and Detecting Network Motifs,” . Bioinformatics , 20 : 1746 – 1758 .
   PubMed Web of Science ®Google Scholar
• King , O. D. 2004 . Comment on “Subgraphs in Random Networks,” by S. Itzkovitz et al. . Physical Review E , 70 : 058101
   Web of Science ®Google Scholar
• Kong , A. , Liu , J. S. and Wong , W. H. 1994 . “Sequential Imputations and Bayesian Missing Data Problems,” . Journal of the American Statistical Association , 89 : 278 – 288 .
   Web of Science ®Google Scholar
• Lehmann , E. L. 1986 . Testing Statistical Hypotheses , New York : Wiley .
   Google Scholar
• Lusseau , D. 2003 . “The Emergent Properties of a Dolphin Social Network,” . Proceedings of the Royal Society of London, Series B (Suppl.) , 270 : S186 – S188 .
   PubMed Web of Science ®Google Scholar
• Mahadev , N. V. R. and Peled , U. N. 1995 . Annals of Discrete Mathematics: Threshold Graphs and Related Topics (Vol. 56) , Amsterdam : North-Holland Publishing Co .
   Google Scholar
• McDonald , J. W. , Smith , P. W. F. and Forster , J. J. 2007 . “Markov Chain Monte Carlo Exact Inference for Social Networks,” . Social Networks , 29 : 127 – 136 .
   Web of Science ®Google Scholar
• McKay , B. D. 1985 . “Asymptotics for Symmetric 0-1 Matrices With Prescribed Row Sums,” . Ars Combinatoria , 19A : 15 – 26 .
   Web of Science ®Google Scholar
• McKay , B. D. and Wormald , N. C. 1990 . “Asymptotic Enumeration by Degree Sequence of Graphs of High Degree,” . European Journal of Combinatorics , 11 : 565 – 580 .
   Web of Science ®Google Scholar
• McKay , B. D. and Wormald , N. C. 1991 . “Asymptotic Enumeration by Degree Sequence of Graphs With Degrees o(n 1/2),” . Combinatorica , 11 : 369 – 382 .
   Web of Science ®Google Scholar
• Milo , R. , Shen-Orr , S. , Itzkovitz , S. , Kashtan , N. , Chklovskii , D. and Alon , U. 2002 . “Network Motifs: Simple Building Blocks of Complex Networks,” . Science , 298 : 824 – 827 .
   PubMed Web of Science ®Google Scholar
• Newman , M. E. J. 2003 . “The Structure and Function of Complex Networks,” . SIAM Review , 45 : 167 – 256 .
   Web of Science ®Google Scholar
• Roberts , J. M. 2000 . “Simple Methods for Simulating Sociomatrices With Given Marginal Totals,” . Social Networks , 22 : 273 – 283 .
   Web of Science ®Google Scholar
• Sloane , N. J. A. 1973 . A Handbook of Integer Sequences , Boston, , MA : Academic Press .
   Google Scholar
• Snijders , T. A. B. 1991 . “Enumeration and Simulation Methods for 0-1 Matrices With Given Marginals,” . Psychometrika , 56 : 397 – 417 .
   Web of Science ®Google Scholar
• Snijders , T. A. B. , Pattison , P. E. , Robins , G. L. and Handcock , M. S. 2006 . “New Specifications for Exponential Random Graph Models,” . Sociological Methodology , 36 : 99 – 153 .
   Web of Science ®Google Scholar
• Spirin , V. and Mirny , L. A. 2003 . “Protein Complexes and Functional Modules in Molecular Networks,” . Proceedings of the National Academy of Sciences , 100 : 12123 – 12128 .
   PubMed Web of Science ®Google Scholar
• Wasserman , S. S. and Pattison , P. E. 1996 . “Logit Models and Logistic Regression for Social Networks: I. An Introduction to Markov Graphs and p*,” . Psychometrika , 61 : 401 – 425 .
   Web of Science ®Google Scholar