Aggregation models on hypergraphs

Following a newly introduced approach by Rasetti and Merelli we investigate the possibility to extract topological information about the space where interacting systems are modelled. From the statistical datum of their observable quantities, like the correlation functions, we show how to reconstruct the activities of their constitutive parts which embed the topological information. The procedure is implemented on a class of polymer models on hypergraphs with hard-core interactions. We show that the model fulfils a set of iterative relations for the partition function that generalise those introduced by Heilmann and Lieb for the monomer-dimer case. After translating those relations into structural identities for the correlation functions we use them to test the precision and the robustness of the inverse problem. Finally the possible presence of a further interaction of peer-to-peer type is considered and a criterion to discover it is identified.

[1]  Marc Lelarge,et al.  Matchings on infinite graphs , 2011, 1102.0712.

[2]  W. DeGrado,et al.  A thermodynamic scale for the helix-forming tendencies of the commonly occurring amino acids. , 1990, Science.

[3]  A. Barra,et al.  Integration indicators in immigration phenomena. A statistical mechanics perspective , 2013 .

[4]  M. Sipser,et al.  Maximum matching in sparse random graphs , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[5]  E. Aurell,et al.  Inverse Ising inference using all the data. , 2011, Physical review letters.

[6]  Lenka Zdeborová,et al.  The number of matchings in random graphs , 2006, ArXiv.

[7]  Emanuela Merelli,et al.  Topological Field Theory of Data: Mining Data Beyond Complex Networks , 2016 .

[8]  H. Edelsbrunner,et al.  Persistent Homology — a Survey , 2022 .

[9]  G. Bianconi.  Statistical mechanics of multiplex networks: entropy and overlap. , 2013, Physical review. E, Statistical, nonlinear, and soft matter physics.

[10]  Dmitri V. Krioukov,et al.  Exponential random simplicial complexes , 2015, 1502.05032.

[11]  G. Petri,et al.  Homological scaffolds of brain functional networks , 2014, Journal of The Royal Society Interface.

[12]  K. Symanzik.  Euclidean Quantum Field Theory. I: Equations For A Scalar Model , 2015 .

[13]  T. Chang.  Statistical theory of the adsorption of double molecules , 1939 .

[14]  O. J. Heilmann,et al.  Monomers and Dimers , 1970 .

[15]  David P. Casasent.  Intelligent Robots and Computer Vision XXVIII: Algorithms and Techniques , 2011 .

[16]  R. Monasson,et al.  Small-correlation expansions for the inverse Ising problem , 2008, 0811.3574.

[17]  Patrizio Frosini,et al.  On the use of size functions for shape analysis , 1993, [1993] Proceedings IEEE Workshop on Qualitative Vision.

[18]  Patrizio Frosini,et al.  Measuring shapes by size functions , 1992, Other Conferences.

[19]  Ginestra Bianconi,et al.  Generalized network structures: The configuration model and the canonical ensemble of simplicial complexes. , 2016, Physical review. E.

[20]  Herbert Edelsbrunner,et al.  Topological persistence and simplification , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[21]  O. J. Heilmann,et al.  Theory of monomer-dimer systems , 1972 .

[22]  R. Feynman.  Space-Time Approach to Non-Relativistic Quantum Mechanics , 1948 .

[23]  J. Hertz,et al.  Ising model for neural data: model quality and approximate methods for extracting functional connectivity. , 2009, Physical review. E, Statistical, nonlinear, and soft matter physics.

[24]  Geoffrey E. Hinton,et al.  A Learning Algorithm for Boltzmann Machines , 1985, Cogn. Sci..