Geometric Representations of Random Hypergraphs

References

• Adler, R. J., and Bobrowski, O. (2014), “Distance Functions, Critical Points, and the Topology of Random Cech Complexes,” Homology, Homotopy and Applications, 16, 311–344.
   Web of Science ®Google Scholar
• Adler, R. J., Bobrowski, O., Borman, M. S., Subag, E., and Weinberger, S. (2010), “Persistent Homology for Random Fields and Complexes,” Institute of Mathematical Statistics Collections, 6, 124–143.
   Google Scholar
• Adler, R. J., Bobrowski, O., and Weinberger, S. (2014), “Crackle: The Persistent Homology of Noise,” Discrete and Computational Geometry, 52, 680–704.
   Web of Science ®Google Scholar
• Airoldi, E. M., Costa, T. B., and Chan, S. H. (2013), “Stochastic Blockmodel Approximation of a Graphon: Theory and Consistent Estimation,” Advances in Neural Information Processing Systems (NIPS), 26, 398.1–389.9.
   Google Scholar
• Atay-Kayis, A., and Massam, H. (2005), “A Monte Carlo Method to Compute the Marginal Likelihood in Non Decomposable Graphical Gaussian Models,” Biometrika, 92, 317–335.
   Web of Science ®Google Scholar
• Azari, H., and Airoldi, E. M. (2012), “Graphlet Decomposition of a Weighted Network,” Journal of Machine Learning Research, 22, 54–63.
   Google Scholar
• Besag, J. E. (1974), “Spatial Interaction and the Statistical Analysis of Lattice Systems” (with discussion), Journal of the Royal Statistical Society, Series B, 36, 192–236.
   Google Scholar
• ——— (1975), “Statistical Analysis of Non-Lattice Data,” Journal of the Royal Statistical Society, Series D, 24, 179–195.
   Google Scholar
• Bobrowski, O., and Mukherjee, S. (2001), “The Topology of Probability Distributions on Manifolds,” Probability Theory and Related Fields, 161, 651–686.
   Web of Science ®Google Scholar
• Boyd, S., Gosh, A., Prabhakar, B., and Shah, D. (2005), “Mixing Times for Random Walks on Geometric Random Graphs,” Technical Report, Stanford University.
   Google Scholar
• Brooks, S. P., Giudici, P., and Roberts, G. O. (2003), “Efficient Construction of Reversible Jump Markov Chain Monte Carlo Proposal Distributions,” Journal of the Royal Statistical Society, Series B, 65, 3–55.
   Google Scholar
• Bryant, J. L. (1972), “Approximating Embeddings of Polyhedra in Codimension Three,” Transactions of the American Mathematical Society, 170, 85–95.
   Web of Science ®Google Scholar
• Carvalho, C. M., Massam, H., and West, M. (2007), “Simulation of Hyper-Inverse Wishart Distributions in Graphical Models,” Biometrika, 94, 719–733.
   Web of Science ®Google Scholar
• Clayton, D. G. (1978), “A Model for Association in Bivariate Life Tables and its Applications in Epidemiological Studies of Familial Tendency in Chronic Disease Incidence,” Biometrika, 65, 141–151.
   Web of Science ®Google Scholar
• Condit, R. (1998), Tropical Census Plot, Berlin: Springer.
   Google Scholar
• Cron, A., and West, M. (2012), “Models of Random Sparse Eigenmatrices Matrices With Application to Bayesian Factor Analysis,” available at ftp://stat.duke.edu/pub/WorkingPapers/12-01.pdf
   Google Scholar
• Dawid, A. P., and Lauritzen, S. L. (1993), “Hyper Markov Laws in the Statistical Analysis of Decomposable Graphical Models,” The Annals of Statistics, 21, 1272–1317.
   Web of Science ®Google Scholar
• Dey, T. K., and Pach, J. (1998), “Extremal Problems for Geometric Hypergraphs,” Discrete and Computational Geometry, 19, 473–484.
   Web of Science ®Google Scholar
• Edelsbrunner, H., and Harer, J. (2008), “Persistent Homology— A Survey,” in Surveys on Discrete and Computational Geometry: Twenty Years Later of Contemporary Mathematics (Vol. 453), eds. J. E. Goodman, J. Pach, and R. Pollack, Providence, RI: American Mathematical Society, pp. 257–282.
   Google Scholar
• Edelsbrunner, H., and Harer, J. (2009), “Lecture Notes From the Course ‘Computational Topology’,” available at http://www.cs.duke.edu/courses/fall06/cps296.1/
   Google Scholar
• Edelsbrunner, H., and Mücke, E. P. (1994), “Three-Dimensional Alpha Shapes,” ACM Transactions on Graphics, 13, 43–72.
   Web of Science ®Google Scholar
• Fan, J., Feng, Y., and Wu, Y. (2009), “Network Exploration via the Adaptive Lasso and Scad Penalties,” The Annals of Applied Statistics, 3, 521–541.
   PubMed Web of Science ®Google Scholar
• Flügge, A. J., Olhede, S. C., and Murrell, D. J. (2014), “A Method to Detect Subcommunities From Multivariate Spatial Associations,” Methods in Ecology and Evolution, 5, 1214–1224.
   Web of Science ®Google Scholar
• Giudici, P., and Green, P. J. (1999), “Decomposable Graphical Gaussian Model Determination,” Biometrika, 86, 785–801.
   Web of Science ®Google Scholar
• Goldenberg, A., Zheng, A. X., Fienberg, S. E., and Airoldi, E. M. (2010), “A Survey of Statistical Network Models,” Foundations and Trends in Machine Learning, 2, 129–233.
   Google Scholar
• Green, P. J. (1995), “Reversible Jump Markov Chain Monte Carlo Computation and Bayesian Model Determination,” Biometrika, 82, 711–732.
   Web of Science ®Google Scholar
• Hammersley, J. M., and Clifford, P. (1971), “Markov Fields on Finite Graphs and Lattices,” unpublished.
   Google Scholar
• Hastings, W. K. (1970), “Monte Carlo Sampling Methods Using Markov Chains and Their Applications,” Biometrika, 57, 97–109.
   Web of Science ®Google Scholar
• Heckerman, D., Geiger, D., and Chickering, D. M. (1995), “Learning Bayesian Networks: The Combination of Knowledge and Statistical Data,” Machine Learning, 20, 197–243.
   Web of Science ®Google Scholar
• Hernandez-Lobato, J. M., Lloyd, J. R., and Hernandez-Lobato, D. (2013), “Gaussian Process Conditional Copulas With Applications to Financial Time Series,” in NIPS, available at https://arxiv.org/abs/1307.0373.
   Google Scholar
• Hoff, P. D. (2007), “Extending the Rank Likelihood for Semiparametric Copula Estimation,” The Annals of Applied Statistics, 1, 265–283.
   Web of Science ®Google Scholar
• Hubbell, S. P., Condit, R., and Foster, R. B. (2005), “Barro Colorado Forest Census Data,” available at http://ctfs.arnarb.harvard.edu/webatlas/datasets/bci
   Google Scholar
• Hubbell, S. P., Foster, R. B., O’Brien, S. T., Wechsler, B., Wright, S. J., Harms, K. E., Condit, R., and Loo de Lao, S. (1999), “Light Gap Disturbances, Recruitment Limitation, and Tree Diversity in a Neotropical Forest,” Science, 283, 554–557.
   PubMed Web of Science ®Google Scholar
• Huber, M. L., and Wolpert, R. L. (2009), “Likelihood-Based Inference for Matérn Type III Repulsive Point Processes,” available at http://www.stat.duke.edu/ftp/pub/WorkingPapers/08-27.html
   Google Scholar
• Jones, B., Carvalho, C., Dobra, A., Hans, C., Carter, C. K., and West, M. (2005), “Experiments in Stochastic Computation for High-Dimensional Graphical Models,” Statistical Science, 20, 388–400.
   Web of Science ®Google Scholar
• Kahle, M. (2009), “Topology of Random Clique Complexes,” Discrete Mathematics, 309, 1658–1671.
   Web of Science ®Google Scholar
• Kahle, M. (2011), “Random Geometric Complexes,” Discrete & Computational Geometry, 45, 553–573.
   Web of Science ®Google Scholar
• Kahle, M., and Meckes, E. (2013), “Limit the Theorems for Betti Numbers of Random Simplicial Complexes,” Homology, Homotopy and Applications, 15, 343–374.
   Web of Science ®Google Scholar
• Kainen, P. C. (1974), “Some Recent Results in Topological Graph Theory,” Graphs and Combinatorics, 406, 76–108.
   Google Scholar
• Lauritzen, S. L. (1996), Graphical Models: Oxford Statistical Science Series (Vol. 17), Oxford, UK: Clarendon Press.
   Google Scholar
• Linial, N., and Meshulam, R. (2006), “Homological Connectivity of Random 2-Complexes,” Combinatorica, 26, 475–487.
   Web of Science ®Google Scholar
• Mansinghka, V. K., Kemp, C., Tenenbaum, J. B., and Griffiths, T. L. (2006), “Structured Priors for Structure Learning,” in Uncertainty in Artificial Intelligence: Proceedings of the Twenty-Second Annual Conference (UAI 2006), eds. L. Bertossi, A. Hunter, and T. Schaub.
   Google Scholar
• Matheron, G. (1975), Random Sets and Integral Geometry ( With a Foreword by Geoffrey S. Watson), New York: Wiley.
   Google Scholar
• Matousek, J., Tancer, M., and Wagner, U. (2009), “Hardness of Embedding Simplicial Complexes in rd,” ACM-SIAM Symposium on Discrete Algorithms, 20.
   Google Scholar
• Meester, R., and Roy, R. (1996), Continuum Percolation, Cambridge, UK: Cambridge University Press.
   Google Scholar
• Molchanov, I. (2005), Theory of Random Sets, Berlin: Springer.
   Google Scholar
• Mukherjee, S., and Speed, T. P. (2008), “Network Inference Using Informative Priors,” PNAS, 105, 14313–14318.
   PubMed Web of Science ®Google Scholar
• Naiman, D. Q., and Wynn, H. P. (1997), “Abstract Tubes, Improved Inclusion Exclusion Identities and Inequalities and Importance Sampling,” The Annals of Statistics, 25, 1954–1983.
   Web of Science ®Google Scholar
• Nelsen, R. B. (1999), An Introduction to Copulas, New York: Springer.
   Google Scholar
• Ollmann, T. L. (1973), “On the Book Thicknesses of Various Graphs,” in Proceedings of the 4th Southeastern Conference on Combinatorics, Graph Theory and Computing, Congressus Numerantium VIII, p. 459.
   Google Scholar
• Owada, T., and Adler, R. J. (2015), “Limit Theorems for Point Processes Under Geometric Constraints (and Topological Crackle),” available at http://arxiv.org/abs/1503.08416
   Google Scholar
• Penrose, M. D. (2003), Random Geometric Graphs, Oxford, UK: Oxford University Press.
   Google Scholar
• Penrose, M. D., and Yukich, J. E. (2001), “Central Limit Theorems for Some Graphs in Computational Geometry,” The Annals of Applied Probability, 11, 1005–1041.
   Web of Science ®Google Scholar
• Pistone, G., Wynn, H., de Cabezón, G. S., and Smith, J. Q. (2009), “Junction Tubes and Improved Factorisations for Bayes Nets,” unpublished.
   Google Scholar
• Robert, C. P. (2001), The Bayesian Choice: From Decision-Theoretic Foundations to Computational Implementation (2nd ed.), New York: Springer.
   Google Scholar
• Robert, C. P., and Casella, G. (2004), Monte Carlo Statistical Methods (2nd ed.), New York: Springer.
   Google Scholar
• Roverato, Al. (2002), “Hyper Inverse Wishart Distribution for Non-Decomposable Graphs and Its Application to Bayesian Inference for Gaussian Graphical Models,” Scandinavian Journal of Statistics, 29, 341–411.
   Web of Science ®Google Scholar
• Scott, J. G, . and Carvalho, C. M. (2008), “Feature-Inclusion Stochastic Search for Gaussian Graphical Models,” Journal of Computational and Graphical Statistics, 17, 790–808.
   Web of Science ®Google Scholar
• Sisson, S. A. (2005), “Transdimensional Markov Chains: A Decade of Progress and Future Perspectives,” Journal of the American Statistical Association, 100, 1077–1089.
   Web of Science ®Google Scholar
• Strauss, D. J. (1975), “A Model for Clustering,” Biometrika, 62, 467–476.
   Web of Science ®Google Scholar
• Wong, K. K. F., Carter, C. K., and Kohn, R. (2003), “Hyper Inverse Wishart Distribution for Non-Decomposable Graphs and its Application to Bayesian Inference for Gaussian Graphical Models,” Biometrika, 90, 809–830.
   Google Scholar
• Yogeshwaran, D., and Adler, R. J. (2014), “On the Topology of Random Complexes Built Over Stationary Point Processes,” available at http://arxiv.org/abs/1211.0061
   Google Scholar