Zobrazeno 1 - 10
of 141
pro vyhledávání: '"Rojas, Cristóbal"'
We revisit the problem of algorithmically deciding whether a given infinite connected graph has an Eulerian path, namely, a path that uses every edge exactly once. It has been recently observed that this problem is $D_3^0$-complete for graphs that ha
Externí odkaz:
http://arxiv.org/abs/2409.03113
We revisit the classical result of Morris et al.~(AAAI'19) that message-passing graphs neural networks (MPNNs) are equal in their distinguishing power to the Weisfeiler--Leman (WL) isomorphism test. Morris et al.~show their simulation result with ReL
Externí odkaz:
http://arxiv.org/abs/2402.03966
Using tools from computable analysis we develop a notion of effectiveness for general dynamical systems as those group actions on arbitrary spaces that contain a computable representative in their topological conjugacy class. Most natural systems one
Externí odkaz:
http://arxiv.org/abs/2401.07973
Autor:
Rojas, Cristobal, Sablik, Mathieu
We study the computational problem of rigorously describing the asymptotic behaviour of topological dynamical systems up to a finite but arbitrarily small pre-specified error. More precisely, we consider the limit set of a typical orbit, both as a sp
Externí odkaz:
http://arxiv.org/abs/2311.15234
Autor:
Rose, Valentino Delle, Kozachinskiy, Alexander, Rojas, Cristóbal, Petrache, Mircea, Barceló, Pablo
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 neural network architectures, whose capabilities and performance can be
Externí odkaz:
http://arxiv.org/abs/2303.12853
This paper contributes to the study of CPAC learnability -- a computable version of PAC learning -- by solving three open questions from recent papers. Firstly, we prove that every improperly CPAC learnable class is contained in a class which is prop
Externí odkaz:
http://arxiv.org/abs/2302.04731
In peer review systems, reviewers are often asked to evaluate various features of submissions, such as technical quality or novelty. A score is given to each of the predefined features and based on these the reviewer has to provide an overall quantit
Externí odkaz:
http://arxiv.org/abs/2211.02144
We study the question of constructive approximation of the harmonic measure $\omega_x^\Omega$ of a connected bounded domain $\Omega$ with respect to a point $x\in\Omega$. In particular, using a new notion of computable harmonic approximation, we show
Externí odkaz:
http://arxiv.org/abs/2011.10010