arXiv (All)
open access
Reinforcement Learning for Graph Generation under a Hard Assortativity Constraint
Generating graph ensembles with precisely controlled structural properties is central to investigating how network structure shapes function. Canonical ensembles impose constraints only in expectation (soft constraints), letting individual realizations fluctuate around the target, whereas enforcing
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
- Stable Filters for Generative Modeling of Graph Signals#1012925
- Stable Filters for Generative Modeling of Graph Signals#965420
- Plain Transformers are Surprisingly Powerful Link Predictors#1118471
- A Constraint-Aware Generative Framework for Synthetic Origin-Destination Demand in Logistics Networks#927641
- Force-Driven Graph Learning and Classification#294583
Record · ID 1014716
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