Valentino Delle Rose

collaborators

3 papers

math.LO2026

Paths, Ends and The Separation Problem for Infinite Graphs

Nicanor Carrasco-Vargas, Valentino Delle Rose, CristÃ³bal Rojas

We introduce and study the Separation Problem for infinite graphs, which involves determining whether a connected graph splits into at least two infinite connected components after…

cs.LG2025

On statistical learning of graphs

Vittorio Cipriani, Valentino Delle Rose, Luca San Mauro +1

We study PAC and online learnability of hypothesis classes formed by copies of a countably infinite graph G, where each copy is induced by permuting G's vertices. This corresponds…

cs.LG2025

Three iterations of $(d - 1)$ -WL test distinguish non isometric clouds of $d$ -dimensional points

Valentino Delle Rose, Alexander Kozachinskiy, CristÃ³bal Rojas +2

The Weisfeiler--Lehman (WL) test is a fundamental iterative algorithm for checking isomorphism of graphs. It has also been observed that it underlies the design of several graph ne…

Paths, Ends and The Separation Problem for Infinite Graphs

On statistical learning of graphs

Three iterations of (d−1)-WL test distinguish non isometric clouds of d-dimensional points

Three iterations of $(d - 1)$ -WL test distinguish non isometric clouds of $d$ -dimensional points