Exponential random simplicial complexes

Exponential random graph models have attracted significant research attention over the past decades. These models are maximum-entropy ensembles subject to the constraints that the expected values of a set of graph observables are equal to given values. Here we extend these maximum-entropy ensembles to random simplicial complexes, which are more adequate and versatile constructions to model complex systems in many applications. We show that many random simplicial complex models considered in the literature can be casted as maximum-entropy ensembles under certain constraints. We introduce and analyze the most general random simplicial complex ensemble with statistically independent simplices. Our analysis is simplified by the observation that any distribution on any collection of objects including graphs and simplicial complexes, is maximum-entropy subject to the constraint that the expected value of is equal to the entropy of the distribution. With the help of this observation, we prove that ensemble is maximum-entropy subject to the two types of constraints which fix the expected numbers of simplices and their boundaries.

[1]  Herbert Edelsbrunner,et al.  Computational Topology - an Introduction , 2009 .

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

[3]  M. Newman,et al.  Statistical mechanics of networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[4]  Ove Frank,et al.  http://www.jstor.org/about/terms.html. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained , 2007 .

[5]  James R. Munkres,et al.  Elements of algebraic topology , 1984 .

[6]  SOCIAL GROUPS , 1976 .

[7]  M. Farber,et al.  Large random simplicial complexes, I , 2015, 1503.06285.

[8]  M. Newman,et al.  Renormalization Group Analysis of the Small-World Network Model , 1999, cond-mat/9903357.

[9]  Matthew Kahle,et al.  Sharp vanishing thresholds for cohomology of random flag complexes , 2012, 1207.0149.

[10]  Kerk F. Kee,et al.  Social Groups, Social Media, and Higher Dimensional Social Structures: A Simplicial Model of Social Aggregation for Computational Communication Research , 2013 .

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

[12]  K. Dill,et al.  Principles of maximum entropy and maximum caliber in statistical physics , 2013 .

[13]  A. Zomorodian.  Advances in Applied and Computational Topology , 2012 .

[14]  Stephen E. Fienberg,et al.  Β Models for Random Hypergraphs with a given Degree Sequence , 2014, ArXiv.

[15]  Moo K. Chung,et al.  Topological Data Analysis , 2012 .

[16]  Edoardo M. Airoldi,et al.  Statistical Network Analysis: Models, Issues, and New Directions - ICML 2006 Workshop on Statistical Network Analysis, Pittsburgh, PA, USA, June 29, 2006, Revised Selected Papers , 2007, SNA@ICML.

[17]  Herbert Edelsbrunner,et al.  Modeling with Simplicial Complexes , 1994, Canadian Conference on Computational Geometry.

[18]  Eric D. Kolaczyk,et al.  Statistical Analysis of Network Data , 2009 .

[19]  G. Bianconi,et al.  Complex quantum network geometries: Evolution and phase transitions. , 2015, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

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

[22]  Abubakr Muhammad,et al.  Coverage and hole-detection in sensor networks via homology , 2005, IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005..

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

[24]  Sergey N. Dorogovtsev,et al.  Lectures on Complex Networks , 2010 .

[25]  Matthew Kahle,et al.  Topology of random clique complexes , 2006, Discret. Math..

[26]  A. Rinaldo,et al.  CONSISTENCY UNDER SAMPLING OF EXPONENTIAL RANDOM GRAPH MODELS. , 2011, Annals of statistics.

[27]  M. Farber,et al.  Random Simplicial Complexes , 2014, 1412.5805.

[28]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[29]  A. Rapoport,et al.  Connectivity of random nets , 1951 .

[30]  R. Ho.  Algebraic Topology , 2022 .

[31]  M. Farber,et al.  Homological Domination in Large Random Simplicial Complexes , 2015, 1503.03253.

[32]  Nathan Linial,et al.  Homological Connectivity Of Random 2-Complexes , 2006, Comb..

[33]  Garry Robins,et al.  An introduction to exponential random graph (p*) models for social networks , 2007, Soc. Networks.

[34]  Zoltán Toroczkai,et al.  Reducing degeneracy in maximum entropy models of networks. , 2014, Physical review letters.

[35]  B. Bollobás.  The evolution of random graphs , 1984 .

[36]  Ginestra Bianconi,et al.  Complex Quantum Network Manifolds in Dimension d > 2 are Scale-Free , 2015, Scientific Reports.

[37]  Ram Ramanathan,et al.  Broadcasting in multi-radio multi-channel wireless networks using simplicial complexes , 2011, Wireless Networks.

[38]  Carolyn J. Anderson,et al.  A p* primer: logit models for social networks , 1999, Soc. Networks.

[39]  Ginestra Bianconi,et al.  Entropy measures for networks: toward an information theory of complex topologies. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[40]  David Strauss.  On a general class of models for interaction , 1986 .

[41]  S. Redner,et al.  Connectivity of growing random networks. , 2000, Physical review letters.

[42]  Ginestra Bianconi,et al.  Emergent Complex Network Geometry , 2014, Scientific Reports.

[43]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[44]  E. David,et al.  Networks, Crowds, and Markets: Reasoning about a Highly Connected World , 2010 .

[45]  Milan Rajkovic,et al.  Simplicial Complex of Opinions on Scale-Free Networks , 2009, CompleNet.

[46]  A. Rbnyi.  ON THE EVOLUTION OF RANDOM GRAPHS , 2001 .

[47]  L. Wasserman.  Topological Data Analysis , 2016, 1609.08227.

[48]  Milan Rajkovic,et al.  Consensus Formation on Simplicial Complex of Opinions , 2012, ArXiv.

[49]  Mark Newman,et al.  Networks: An Introduction , 2010 .

[50]  Tom A. B. Snijders,et al.  Markov Chain Monte Carlo Estimation of Exponential Random Graph Models , 2002, J. Soc. Struct..

[51]  P. Diaconis,et al.  Estimating and understanding exponential random graph models , 2011, 1102.2650.

[52]  Matthew Kahle.  Topology of random simplicial complexes: a survey , 2013, 1301.7165.

[53]  S. Wasserman,et al.  Logit models and logistic regressions for social networks: I. An introduction to Markov graphs andp , 1996 .

[54]  E. Todeva.  Networks , 2007 .

[55]  S. N. Dorogovtsev,et al.  Structure of growing networks with preferential linking. , 2000, Physical review letters.