Exponential random simplicial complexes

DOI10.1088/1751-8113/48/46/465002MaRDI QIDQ3458280zbMATH OpenOpenAlexWikidataFDO

Authors Or Eisenberg, Dmitri Krioukov, Konstantin M. Zuev

Publication date 18 December 2015

Published in Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1502.05032

zbMATH Keywords

exponential random graphs modelmaximum-entropy distributionsnetwork modelsrandom graphsrandom simplicial complexes

Mathematics Subject Classification ID

Graph theory (05C99) Stochastic network models in operations research (90B15)

Abstract: Exponential random graph models have attracted significant research attention over the past decades. These models are maximum-entropy ensembles under 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 $mathbfDelta$ with statistically independent simplices. Our analysis is simplified by the observation that any distribution $mathbbP(O)$ on any collection of objects $mathcalO=O$, including graphs and simplicial complexes, is maximum-entropy under the constraint that the expected value of $-lnmathbbP(O)$ is equal to the entropy of the distribution. With the help of this observation, we prove that ensemble $mathbfDelta$ is maximum-entropy under two types of constraints that fix the expected numbers of simplices and their boundaries.

Recommendations

• Random Simplicial Complexes: Models and Phenomena
• scientific article; zbMATH DE number 6108165
• Random Simplicial Complexes
• Simplicial complex entropy
• Large random simplicial complexes. I

Cites work

• A survey of statistical network models
• An Exponential Family of Probability Distributions for Directed Graphs
• Collective dynamics of `small-world' networks
• Consensus formation on a simplicial complex of opinions
• Consistency under sampling of exponential random graph models
• Emergence of Scaling in Random Networks
• Estimating and understanding exponential random graph models
• Homological connectivity of random 2-complexes
• Large random simplicial complexes. I
• Lectures on Complex Networks
• Logit models and logistic regressions for social networks. I: An introduction to Markov graphs and \(p^*\)
• Markov Graphs
• Networks, crowds and markets. Reasoning about a highly connected world.
• Networks. An introduction.
• On a General Class of Models for Interaction
• Renormalization group analysis of the small-world network model
• Sharp vanishing thresholds for cohomology of random flag complexes
• Statistical analysis of network data. Methods and models
• Topological data analysis
• Topology of random clique complexes

Cited in

(16)

• Simplicial complex entropy
• Network geometry and complexity
• Secant varieties of toric varieties arising from simplicial complexes
• Robust chaos of cubic polynomial discrete maps with application to pseudorandom number generators
• Aggregation models on hypergraphs
• Emergent network modularity
• Structure of international trade hypergraphs
• Random Simplicial Complexes: Models and Phenomena
• Random recursive hypergraphs
• Simplicial SIR rumor propagation models with delay in both homogeneous and heterogeneous networks
• Algebraic and combinatorial expansion in random simplicial complexes
• What Are Higher-Order Networks?
• Simplicial epidemic model with individual resource
• Latent Space Modeling of Hypergraph Data
• Goodness-of-fit via count statistics in dense random simplicial complexes
• Networks beyond pairwise interactions: structure and dynamics

This page was built for publication: Exponential random simplicial complexes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3458280)