Aggregation models on hypergraphs
From MaRDI portal
Publication:2628244
DOI10.1016/j.aop.2016.12.001zbMath1364.82071arXiv1608.00167OpenAlexW2483222287WikidataQ58295657 ScholiaQ58295657MaRDI QIDQ2628244
Marco Molari, Pierluigi Contucci, Emanuele Mingione, Diego Alberici
Publication date: 13 June 2017
Published in: Annals of Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1608.00167
Applications of graph theory (05C90) Statistical mechanics of polymers (82D60) Dynamic lattice systems (kinetic Ising, etc.) and systems on graphs in time-dependent statistical mechanics (82C20) Coloring of graphs and hypergraphs (05C15)
Related Items (3)
Networks beyond pairwise interactions: structure and dynamics ⋮ Topological graph persistence ⋮ Mean-Field Monomer-Dimer Models. A Review
Cites Work
- Matchings on infinite graphs
- On the use of size functions for shape analysis
- Topological persistence and simplification
- ON THE EUCLIDEAN STRUCTURE OF RELATIVISTIC FIELD THEORY
- Exponential random simplicial complexes
- Small-correlation expansions for the inverse Ising problem
- The number of matchings in random graphs
- Space-Time Approach to Non-Relativistic Quantum Mechanics
- Statistical theory of the adsorption of double molecules
This page was built for publication: Aggregation models on hypergraphs
