Related papers: Classification of weighted graphs up to blowing-up…

Attack trees and attack graphs are both common graphical threat models used by organizations to better understand possible cybersecurity threats. These models have been primarily seen as separate entities, to be used and researched in…

We present a concept called the branch-depth of a connectivity function, that generalizes the tree-depth of graphs. Then we prove two theorems showing that this concept aligns closely with the notions of tree-depth and shrub-depth of graphs…

We consider a class of random, weighted networks, obtained through a redefinition of patterns in an Hopfield-like model and, by performing percolation processes, we get information about topology and resilience properties of the networks…

We define and prove isomorphisms between three combinatorial classes involving labeled trees. We also give an alternative proof by means of generating functions.

An edge-weighting of a graph is called vertex-coloring if the weighted degrees yield a proper vertex coloring of the graph. It is conjectured that for every graph without isolated edge, a vertex-coloring edge-weighting with the set {1,2,3}…

A weighted graph is a graph in which every edge is assigned a non-negative real number. In a weighted graph, the weight of a path is the sum of the weights of its edges, and the weighed degree of a vertex is the sum of the weights of the…

We define compactifications of vector spaces which are functorial with respect to certain linear maps. These "many-body" compactifications are manifolds with corners, and the linear maps lift to b-maps in the sense of Melrose. We derive a…

We suggest a classification scheme for subfactorizable fusion bialgebras, particularly for exchange relation planar algebras. This scheme begins by transforming infinite diagrammatic consistency equations of exchange relations into a finite…

The quiver Hopf algebras are classified by means of ramification systems with irreducible representations. This leads to the classification of Nichols algebras over group algebras and pointed Hopf algebras of type one.

This paper introduces Weighted Optimal Classification Forests (WOCFs), a new family of classifiers that takes advantage of an optimal ensemble of decision trees to derive accurate and interpretable classifiers. We propose a novel…

We describe the notion of a \emph{weighting} along a submanifold $N\subset M$, and explore its differential-geometric implications. This includes a detailed discussion of weighted normal bundles, weighted deformation spaces, and weighted…

We show that the edges of any planar graph of maximum degree at most $9$ can be partitioned into $4$ linear forests and a matching. Combined with known results, this implies that the edges of any planar graph $G$ of odd maximum degree…

The matrices of spanning rooted forests are studied as a tool for analysing the structure of networks and measuring their properties. The problems of revealing the basic bicomponents, measuring vertex proximity, and ranking from preference…

We define a class of Euclidean distances on weighted graphs, enabling to perform thermodynamic soft graph clustering. The class can be constructed form the "raw coordinates" encountered in spectral clustering, and can be extended by means…

In this paper, we extend the ideas of graph pebbling to oriented graphs and find a classification for all graphs with fully traversable pebbling assignments that are isomorphic to their assignment graph. We then give some cases in which a…

Using only the combinatorics of its defining ribbon graph, we classify the two-term tilting complexes, as well as their indecomposable summands, of a Brauer graph algebra. As an application, we determine precisely the class of Brauer graph…

In the present paper, we focus on a weighted version of the Bounded Negativity Conjecture which predicts that for every smooth projective surface in characteristic zero the self-intersection numbers of reduced and irreducible curves are…

This is a survey on the state-of-the-art of the classification of finite-dimensional complex Hopf algebras. This general question is addressed through the consideration of different classes of such Hopf algebras. Pointed Hopf algebras…

Random Forests (RF) and Extreme Gradient Boosting (XGBoost) are two of the most widely used and highly performing classification and regression models. They aggregate equally weighted CART trees, generated randomly in RF or sequentially in…

We study varieties that contain unranked tree languages over all alphabets. Trees are labeled with symbols from two alphabets, an unranked operator alphabet and an alphabet used for leaves only. Syntactic algebras of unranked tree languages…