Aggregation models on hypergraphs

  title={Aggregation models on hypergraphs},
  author={Diego Alberici and Pierluigi Contucci and Emanuele Mingione and Marco Molari},
  journal={arXiv: Statistical Mechanics},

Figures from this paper

Networks beyond pairwise interactions: structure and dynamics

Topological graph persistence

Abstract Graphs are a basic tool in modern data representation. The richness of the topological information contained in a graph goes far beyond its mere interpretation as a one-dimensional

Mean-Field Monomer-Dimer Models. A Review

A collection of rigorous results for a class of mean-field monomer-dimer models is presented. It includes a Gaussian representation for the partition function that is shown to considerably simplify

Human-AI ecosystem with abrupt changes as a function of the composition

This analysis focuses on exploring how the relative fraction of artificial intelligence agents affect that ecosystem and finds evidence that for suitable values of the interaction parameters, arbitrarily small changes in such percentage may trigger dramatic changes for the system that can be either in one of the two polarised states or in an undecided state.



Exponential random simplicial complexes

This work introduces and analyzes the most general random simplicial complex ensemble with statistically independent simplices, and proves that ensemble is maximum-entropy subject to the two types of constraints which fix the expected numbers of simplices and their boundaries.

Topological Field Theory of Data: Mining Data Beyond Complex Networks

A Philosophical Introduction It has become increasingly obvious that very detailed, intricate interactions and interdependencies among and within large systems are often central to most of the

Generalized network structures: The configuration model and the canonical ensemble of simplicial complexes.

The structure of simplicial complexes is characterized using their generalized degrees that capture fundamental properties of one, two, three, or more linked nodes using the configuration model and the canonical ensemble, enforcing the sequence of generalized degrees of the nodes and the order of the expected generalized degrees.

Statistical mechanics of multiplex networks: entropy and overlap.

  • G. Bianconi
  • Computer Science
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2013
A statistical mechanics framework is introduced to describe multiplex ensembles in which the existence of a link in one layer is correlated with theexistence of a links in another layer, which implies that a typical multiplex of the ensemble can have a significant overlap of the links in the different layers.

Theory of monomer-dimer systems

We investigate the general monomer-dimer partition function,P(x), which is a polynomial in the monomer activity,x, with coefficients depending on the dimer activities. Our main result is thatP(x) has

The number of matchings in random graphs

This work derives an algorithm to compute the leading order of the logarithm of the number of solutions, of matchings with a given size, and an analytic result for the entropy in regular and Erdös–Rényi random graph ensembles.

Topological Persistence and Simplification

Fast algorithms for computing persistence and experimental evidence for their speed and utility are given for topological simplification within the framework of a filtration, which is the history of a growing complex.

Homological scaffolds of brain functional networks

The results show that the homological structure of the brain's functional patterns undergoes a dramatic change post-psilocybin, characterized by the appearance of many transient structures of low stability and of a small number of persistent ones that are not observed in the case of placebo.

Inverse Ising inference using all the data.

We show that a method based on logistic regression, using all the data, solves the inverse Ising problem far better than mean-field calculations relying only on sample pairwise correlation functions,

Ising model for neural data: model quality and approximate methods for extracting functional connectivity.

P pairwise Ising models for describing the statistics of multineuron spike trains are studied, using data from a simulated cortical network and the quality of these models is studied by comparing their entropies with that of the data, finding that they perform well for small subsets of the neurons in the network, but the fit quality starts to deteriorate as the subset size grows.