Related papers: Weighted Analytic Torsion for Weighted Digraphs
In this paper we offer a metric similar to graph edit distance which measures the distance between two (possibly infinite)weighted graphs with finite norm (we define the norm of a graph as the sum of absolute values of its edges). The main…
We study graph products of groups from the viewpoint of measured group theory. We first establish a full measure equivalence classification of graph products of countably infinite groups over finite simple graphs with no transvection and no…
We study methods to manipulate weights in stress-graph embeddings to improve convex straight-line planar drawings of 3-connected planar graphs. Stress-graph embeddings are weighted versions of Tutte embeddings, where solving a linear system…
The complexity of a graph can be obtained as a derivative of a variation of the zeta function or a partial derivative of its generalized characteristic polynomial evaluated at a point [\textit{J. Combin. Theory Ser. B}, 74 (1998), pp.…
We equip the edges of a deterministic graph $H$ with independent but not necessarily identically distributed weights and study a generalized version of matchings (i.e. a set of vertex disjoint edges) in $H$ satisfying the property that…
This paper studies generalizations of the concept of acyclic orientations to arc-weighted orientations. These lead to four types of variations of strict degeneracy of graphs. Some of these variations are studied in the literature under…
Consider a graph $G = (V, E)$ and a function $f: V \rightarrow \{0, 1, 2\}$. A vertex $u$ with $f(u)=0$ is defined as \emph{undefended} by $f$ if it lacks adjacency to any vertex with a positive $f$-value. The function $f$ is said to be a…
By natural way the hierarchy structure is introduced on directed graphs with weighted adjacencies. Embedded system of algebras of subsets of the set of vertices of such digraph and it's consolidations, which vertices are the elementary sets…
Let $G$ be a connected edge-weighted graph of order $n$ and size $m$. Let $w:E(G)\rightarrow \mathbb{R}^{\geq 0}$ be the weighting function. We assume that $w$ is normalised, that is, $\sum_{e\in E(G)} w(e)=m$. The weighted distance…
Weighted graphs are ubiquitous throughout biology, chemistry, and the social sciences, motivating the development of generative models for abstract weighted graph data using deep neural networks. However, most current deep generative models…
We consider the problem of finding edges of a hidden weighted graph using a certain type of queries. Let $G$ be a weighted graph with $n$ vertices. In the most general setting, the $n$ vertices are known and no other information about $G$…
Recently Matthew Foreman and Benjamin Weiss showed in a series of papers that smooth ergodic diffeomorphisms of a compact manifold are unclassifiable up to measure-isomorphism. In this paper we show that the uniform circular systems used in…
Motivated by fractal geometry of self-affine carpets and sponges, Feng--Huang (2016) introduced weighted topological entropy and pressure for factor maps between dynamical systems, and proved variational principles for them. We introduce a…
We show that the refined analytic torsion is a holomorphic section of the determinant line bundle over the space of complex representations of the fundamental group of a closed oriented odd dimensional manifold. Further, we calculate the…
Python implementation of selected weighted graph algorithms is presented. The minimal graph interface is defined together with several classes implementing this interface. Graph nodes can be any hashable Python objects. Directed edges are…
In this article we demonstrate a way to extend the AbC (approximation by conjugation) method invented by Anosov and Katok from the smooth category to the category of real-analytic diffeomorphisms on the torus. We present a general framework…
Given a number field $F$ with ring of integers $\mathcal{O}_{F}$, one can associate to any torsion free subgroup of $\operatorname{SL}(2,\mathcal{O}_{F})$ of finite index a complete Riemannian manifold of finite volume with fibered cusp…
In a seminal paper, Alon and Tarsi have introduced an algebraic technique for proving upper bounds on the choice number of graphs (and thus, in particular, upper bounds on their chromatic number). The upper bound on the choice number of $G$…
Weighted hypergraphs are generalizations of weighted simplicial complexes. In recent years, weighted Laplacians of weighted simplicial complexes have been studied. In 2016, as a generalization of the homology of simplicial complexes, the…
A graph $G$ is $k$-$weighted-list-antimagic$ if for any vertex weighting $\omega\colon V(G)\to\mathbb{R}$ and any list assignment $L\colon E(G)\to2^{\mathbb{R}}$ with $|L(e)|\geq |E(G)|+k$ there exists an edge labeling $f$ such that…