arXiv (All)
open access
Colorful Exponential Random Graph Models
05c1505c3560c0560f10combinatoricsdisordered-systems-and-neural-networksmathematical-physicsprobability
In this paper, we initiate the study of colored exponential random graph models (ERGMs), a class of exponential-family models for networks with multiple types of edge relations. Using the framework of probability graphons, we first derive a variational representation for the limiting free energy, wh
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Colorful Exponential Random Graph Models#809158
- From Message-Passing to Linearized Graph Sequence Models#178893
- The forced colouring function of a graph#1123499
- Rapid training of Hamiltonian graph networks using random features#144305
- On walk entropies in graphs. Response to Dehmer and Mowshowitz#76098
Record · ID 819150
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive