Related papers: Introducing Loopedia
Graph neural networks achieve high accuracy in link prediction by jointly leveraging graph topology and node attributes. Topology, however, is represented indirectly; state-of-the-art methods based on subgraph classification label nodes…
Software libraries for Topological Data Analysis (TDA) offer limited support for interactive visualization. Most libraries only allow to visualize topological descriptors (e.g., persistence diagrams), and lose the connection with the…
The \emph{index set} of a computable structure $\mathcal{A}$ is the set of indices for computable copies of $\mathcal{A}$. We determine the complexity of the index sets of various mathematically interesting structures, including arbitrary…
We show that the von Neumann entropy (from herein referred to as the von Neumann index) of a graph's trace normalized combinatorial Laplacian provides structural information about the level of centralization across a graph. This is done by…
A scalable semi-supervised node classification method on graph-structured data, called GraphHop, is proposed in this work. The graph contains attributes of all nodes but labels of a few nodes. The classical label propagation (LP) method and…
Advances in voice-controlled assistants paved the way into the consumer market. For professional or industrial use, the capabilities of such assistants are too limited or too time-consuming to implement due to the higher complexity of data,…
The problem of node-similarity in networks has motivated a plethora of such measures between node-pairs, which make use of the underlying graph structure. However, higher-order relations cannot be losslessly captured by mere graphs and…
As we said in our previous work [4], the main idea of our research is to introduce a class of Lie groupoids by means of co-adjoint representation of a Lie groupoid on its isotropy Lie algebroid, which we called coadjoint Lie groupoids. In…
We report on a new method for the numerical evaluation of loop integrals, based on the Feynman Tree Theorem. The loop integrals are replaced by phase-space integration over fictitious extra on-shell particles. This integration can be…
We propose a novel unsupervised approach for linking records across arbitrarily many files, while simultaneously detecting duplicate records within files. Our key innovation is to represent the pattern of links between records as a {\em…
The entropy of a graph was first introduced by Rashevsky \cite{Rashevsky} and Trucco \cite{Trucco} to interpret as the structural information content of the graph and serve as a complexity measure. In this paper, we first state a number of…
A recursive algebraic method which allows to obtain the Feynman or Schwinger parametric representation of a generic L-loops and (E+1) external lines diagram, in a scalar $\phi ^{3}\oplus \phi ^{4}$ theory, is presented. The representation…
Graph mining to extract interesting components has been studied in various guises, e.g., communities, dense subgraphs, cliques. However, most existing works are based on notions of frequency and connectivity and do not capture subjective…
Two programs for the computation of perturbative expansions of quantum field theory amplitudes are provided. feyngen can be used to generate Feynman graphs for Yang-Mills, QED and $\varphi^k$ theories. Using dedicated graph theoretic tools…
Mirror graphs were introduced by Bre\v{s}ar et al. in 2004 as an intriguing class of graphs: vertex-transitive, isometrically embeddable into hypercubes, having a strong connection with regular maps and polytope structure. In this article…
Large Language Models (LLMs) show strong reasoning and text generation capabilities, prompting their use in scientific literature analysis, including novelty assessment. While evaluating novelty of scientific papers is crucial for peer…
A new class of integrable maps, obtained as lattice versions of polynomial dynamical systems is introduced. These systems are obtained by means of a discretization procedure that preserves several analytic and algebraic properties of a…
The program package XLOOPS calculates massive one- and two-loop Feynman diagrams. It consists of five parts: i) a graphical user interface ii) routines for generating diagrams from particle input iii) procedures for calculating one-loop…
Network data mining has become an important area of study due to the large number of problems it can be applied to. This paper presents NOESIS, an open source framework for network data mining that provides a large collection of network…
The behavior of complex systems is determined not only by the topological organization of their interconnections but also by the dynamical processes taking place among their constituents. A faithful modeling of the dynamics is essential…