Zobrazeno 1 - 10
of 16
pro vyhledávání: '"Böker, Jan"'
Representing graphs by their homomorphism counts has led to the beautiful theory of homomorphism indistinguishability in recent years. Moreover, homomorphism counts have promising applications in database theory and machine learning, where one would
Externí odkaz:
http://arxiv.org/abs/2310.09009
Numerous recent works have analyzed the expressive power of message-passing graph neural networks (MPNNs), primarily utilizing combinatorial techniques such as the $1$-dimensional Weisfeiler-Leman test ($1$-WL) for the graph isomorphism problem. Howe
Externí odkaz:
http://arxiv.org/abs/2306.03698
Autor:
Böker, Jan, Anders, Frithjof B.
Publikováno v:
Phys. Rev. B 105, 235127 (2022)
By combining Wilson's numerical renormalization group with a modified Bloch-Redfield approach we are able to eliminate the artificial broadening of the Lehmann representation of quantum impurity spectral functions required by the standard numerical r
Externí odkaz:
http://arxiv.org/abs/2204.03453
Autor:
Böker, Jan
Publikováno v:
Electronic Journal of Combinatorics Volume 30, Issue 4 (2023), P4.35
The color refinement algorithm is mainly known as a heuristic method for graph isomorphism testing. It has surprising but natural characterizations in terms of, for example, homomorphism counts from trees and solutions to a system of linear equations
Externí odkaz:
http://arxiv.org/abs/2112.09001
Autor:
Böker, Jan
We introduce the tree distance, a new distance measure on graphs. The tree distance can be computed in polynomial time with standard methods from convex optimization. It is based on the notion of fractional isomorphism, a characterization based on a
Externí odkaz:
http://arxiv.org/abs/2104.14213
Autor:
Böker, Jan, Anders, Frithjof B.
Publikováno v:
Phys. Rev. B 102, 075149 (2020)
The continuous coupling function in quantum impurity problems is exactly partitioned into a part represented by a finite size Wilson chain and a part represented by a set of additional reservoirs, each coupled to one Wilson chain site. These addition
Externí odkaz:
http://arxiv.org/abs/2006.07936
Autor:
Böker, Jan
Recent results show that the structural similarity of graphs can be characterized by counting homomorphisms to them: the Tree Theorem states that the well-known color-refinement algorithm does not distinguish two graphs G and H if and only if, for ev
Externí odkaz:
http://arxiv.org/abs/1903.12432
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Böker, Jan Wilhelm
Publikováno v:
Saarbrücken/Wadern : Schloss Dagstuhl-Leibniz-Zentrum für Informatik, Leibniz international proceedings in informatics 198, 17 pages803851 bytes (2021). doi:10.4230/LIPIcs.ICALP.2021.32
48th International Colloquium on Automata, Languages, and Programming : ICALP 2021, July 12-16, 2021, Glasgow, Scotland (virtual conference) / edited by Nikhil Bansal, Emanuela Merelli, James Worrell
48th International Colloquium on Automata, Languages, and Programming : ICALP 2021, July 12-16, 2021, Glasgow, Scotland (virtual conference) / edited by Nikhil Bansal, Emanuela Merelli, James Worrell48. International Colloquium on Automata, Languages, and Programming, ICALP 2021, online, 2021-07-12-2021-07-16
48th International Colloquium on Automata, Languages, and Programming : ICALP 2021, July 12-16, 2021, Glasgow, Scotland (virtual conference) / edited by Nikhil Bansal, Emanuela Merelli, James Worrell
48th International Colloquium on Automata, Languages, and Programming : ICALP 2021, July 12-16, 2021, Glasgow, Scotland (virtual conference) / edited by Nikhil Bansal, Emanuela Merelli, James Worrell48. International Colloquium on Automata, Languages, and Programming, ICALP 2021, online, 2021-07-12-2021-07-16
48th International Colloquium on Automata, Languages, and Programming : ICALP 2021, July 12-16, 2021, Glasgow, Scotland (virtual conference) / edited by Nikhil Bansal, Emanuela Merelli, James Worrell 48th International Colloquium on Automata, Languag
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0ce61d6b2cb95856847581262e3513b1