← Back to all news
arXiv Machine Learning By Soham Dan

Two-Sample Testing for Random Graphs without Vertex Correspondence

Read the original on arXiv Machine Learning →

arXiv:2610. 07503v1 Announce Type: cross Abstract: Two populations of graphs often have to be compared without any correspondence between their vertices, for instance when networks come from different communities, or when a graph generative model is evaluated against held-out graphs.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

Related stories

arXiv AI
Sep 4

AutoGraphForge: Towards Automated Graph Theory Discovery

AutoGraphForge is a computational pipeline designed to automate the discovery, refutation, formalization, and proving of graph-theoretic conjectures. It generates conjectures using a Graffiti3 generator, filters out known results with a novelty filter, tests candidates against a large dataset of graphs, and refines surviving conjectures through counterexample search. The pipeline then translates each conjecture into Lean 4, verifies proofs with neural provers, and integrates the results into a formal library.

By J\'an Pastorek
More like this →
arXiv Machine Learning
Jun 18

Robust Detection of Planted Subgraphs in Semi-Random Models

arXiv:2508. 02158v2 Announce Type: replace-cross Abstract: Detection of planted subgraphs in Erd\"os-R\'enyi random graphs has been extensively studied, leading to a rich body of results characterizing both statistical and computational thresholds.

By Dor Elimelech, Wasim Huleihel
More like this →
arXiv Machine Learning
Jun 30

Lost in Aggregation: On a Fundamental Expressivity Limit of Message-Passing Graph Neural Networks

arXiv:2603. 14846v3 Announce Type: replace Abstract: We define an information-complexity property for aggregation functions, capturing a vast range of practical aggregations, and prove that any Message-Passing Graph Neural Network (MP-GNN) model with such aggregations induces only a polynomial number of equivalence classes on all graphs - while the number of non-isomorphic graphs is super-exponential (in number of vertices).

By Eran Rosenbluth
More like this →