Skip to content
AI News HubLIVE
Original source2 min read

Constraint-Preserving Flow Matching for Spectral Graph Generation

Summary

The paper introduces Laplacian-Constrained Stiefel Flow Matching (LaSFM) to preserve the Laplacian nullspace constraint alongside eigenvector orthonormality and positive eigenvalues during spectral graph generation, and extends it to property-guided generation with improved spectral and graph-level metrics.

SourcearXiv Machine LearningAuthor: Anita Yang, Ken-ichi Kawarabayashi, Yohan Jung
Constraint-Preserving Flow Matching for Spectral Graph Generation
Report an error

The correction channel is not available yet. You can copy the article reference below for later.

Correction instructions
Read article

[Submitted on 3 Nov 2026]

Title:Constraint-Preserving Flow Matching for Spectral Graph Generation

View a PDF of the paper titled Constraint-Preserving Flow Matching for Spectral Graph Generation, by Anita Yang and 2 other authors

View PDF HTML (experimental)

Abstract:Spectral graph generation models graphs through the eigenvalues and eigenvectors of their Laplacians, providing a compact and continuous alternative to direct graph construction. However, these eigensystems must retain the structural properties of graph Laplacians. Existing approaches preserve eigenvector orthonormality but do not enforce the Laplacian nullspace constraint, potentially producing eigensystems inconsistent with Laplacian structure. To address this, we introduce Laplacian-Constrained Stiefel Flow Matching (LaSFM), which preserves the nullspace condition alongside eigenvector orthonormality and positive eigenvalues during generation. We characterize the underlying constrained Stiefel manifold and formulate flow matching on it. We further extend LaSFM to property-guided generation, steering samples toward desired graph properties while maintaining these constraints. Experiments demonstrate improved performance on both spectral and graph-level metrics, along with better alignment with target properties.

Subjects:

Machine Learning (cs.LG); Artificial Intelligence (cs.AI)

Cite as: arXiv:2611.05436 [cs.LG]

(or arXiv:2611.05436v1 [cs.LG] for this version)

https://doi.org/10.48550/arXiv.2611.05436

arXiv-issued DOI via DataCite

Submission history

From: Anita Yang [view email] [v1] Tue, 3 Nov 2026 09:51:49 UTC (1,142 KB)

Full-text links:

Access Paper:

View a PDF of the paper titled Constraint-Preserving Flow Matching for Spectral Graph Generation, by Anita Yang and 2 other authors

View PDF

HTML (experimental)

TeX Source

view license

Additional Features

Audio Summary

Current browse context:

cs.LG

new | recent | 2026-11

Change to browse by:

cs cs.AI

References & Citations

SciX

Google Scholar

Semantic Scholar

Loading...

Data provided by:

Bibliographic Tools

Bibliographic and Citation Tools

Bibliographic Explorer Toggle

Bibliographic Explorer (What is the Explorer?)

Connected Papers Toggle

Connected Papers (What is Connected Papers?)

Litmaps Toggle

Litmaps (What is Litmaps?)

scite.ai Toggle

scite Smart Citations (What are Smart Citations?)

Code, Data, Media

Code, Data and Media Associated with this Article

alphaXiv Toggle

alphaXiv (What is alphaXiv?)

Links to Code Toggle

CatalyzeX Code Finder for Papers (What is CatalyzeX?)

DagsHub Toggle

DagsHub (What is DagsHub?)

GotitPub Toggle

Gotit.pub (What is GotitPub?)

Huggingface Toggle

Hugging Face (What is Huggingface?)

ScienceCast Toggle

ScienceCast (What is ScienceCast?)

Demos

Demos

Replicate Toggle

Replicate (What is Replicate?)

Spaces Toggle

Hugging Face Spaces (What is Spaces?)

Spaces Toggle

TXYZ.AI (What is TXYZ.AI?)

Related Papers

Recommenders and Search Tools

Link to Influence Flower

Influence Flower (What are Influence Flowers?)

Core recommender toggle

CORE Recommender (What is CORE?)

IArxiv recommender toggle

IArxiv Recommender (What is IArxiv?)

Author

Venue

Institution

Topic

About arXivLabs

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)

Key points and analysis

Article intelligence

ResearchersAdvanced

Key points

  • Existing spectral graph generation preserves eigenvector orthonormality but not the Laplacian nullspace constraint, risking inconsistent eigensystems.
  • LaSFM formulates flow matching on a constrained Stiefel manifold that enforces the nullspace condition, orthonormality, and positive eigenvalues.
  • The method extends to property-guided generation, steering samples toward desired graph properties while maintaining constraints.
  • Experiments show improved spectral and graph-level performance and better alignment with target properties.

Highlights and analysis are generated automatically and may contain errors. Check the original source.