相关论文: Noncommutative distances on graphs: An explicit ap…
In this paper we propose and study a new structural invariant for graphs, called distance-unbalanced\-ness, as a measure of how much a graph is (un)balanced in terms of distances. Explicit formulas are presented for several classes of…
Consider a finite directed graph without cycles in which the arrows are weighted. We present an algorithm for the computation of a new distance, called path-length-weighted distance, which has proven useful for graph analysis in the context…
In this paper, we extend the investigations regarding Birkhoff-James orthogonality of linear operators to bounded continuous functions on metric spaces. We introduce Birkhoff-James extensions of continuous functions and study them in…
We obtain a necessary and sufficient condition for a matrix $A$ to be Birkhoff-James orthogonal to any subspace $\mathscr W$ of $\mathbb M_n(\mathbb C)$. Using this we obtain an expression for the distance of $A$ from any unital $C^*$…
We study maximal distances in the commuting graphs of matrix algebras defined over algebraically closed fields. In particular, we show that the maximal distance can be attained only between two nonderogatory matrices. We also describe…
Using the tools of noncommutative geometry we calculate the distances between the points of a lattice on which the usual discretized Dirac operator has been defined. We find that these distances do not have the expected behaviour, revealing…
We define a distance metric between partitions of a graph using machinery from optimal transport. Our metric is built from a linear assignment problem that matches partition components, with assignment cost proportional to transport…
We survey theoretical, algorithmic, and computational results at the intersection of distance geometry problems and mathematical programming, both with and without adjacencies as part of the input. While mathematical programming methods can…
We report on some findings concerning Connes' noncommutative distance $d$ on a weighted undirected graph $G$. Our main result is the lower bound $\ell/\Delta(G)\le d$ where $\ell$ is the geodesic distance and $\Delta(G)$ the degree of $G$.…
Optimal transportation distances are valuable for comparing and analyzing probability distributions, but larger-scale computational techniques for the theoretically favorable quadratic case are limited to smooth domains or regularized…
The book covers basics of noncommutative geometry and its applications in topology, algebraic geometry and number theory. A brief survey of main parts of noncommutative geometry with historical remarks, bibliography and a list of exercises…
The comparison of graphs is a vitally important, yet difficult task which arises across a number of diverse research areas including biological and social networks. There have been a number of approaches to define graph distance however…
Given a set of well-formed terminal pairs on the external face of an undirected planar graph with unit edge weights, we give a linear-time algorithm for computing the union of non-crossing shortest paths joining each terminal pair, where…
In this paper, we define the non-commuting graph associated to a Lie algebra L and obtain some basic graph properties such as connectivity, diameter, girth, Hamiltonian and Eulerian. Moreover, planarity, outer planarity and isomorphism…
In this paper, we develop a geometric approach to study derived tame finite dimensional associative algebras, based on the theory of non-commutative nodal curves.
In this paper, we study Birkhoff-James orthogonality of bounded linear operators and give a complete characterization of Birkhoff-James orthogonality of bounded linear operators on infinite dimensional real normed linear spaces. As an…
We study the Hamiltonian path problem in C-shaped grid graphs, and present the necessary and sufficient conditions for the existence of a Hamiltonian path between two given vertices in these graphs. We also give a linear-time algorithm for…
We consider a non self-adjoint Laplacian on a directed graph with non symmetric edge weights. We analyse spectral properties of this Laplacian under a Kirchhoff assumption. Moreover we establish isoperimet-ric inequalities in terms of the…
Cette these etudie l'aspect metrique de la geometrie non commutative a travers la formulation de Connes de la distance entre etats d'une algebre. Sont etudies des exemples d'espaces finis et le modele standard ou le champs de Higgs…
Binary relations are one of the standard ways to encode, characterise and reason about graphs. Relation algebras provide equational axioms for a large fragment of the calculus of binary relations. Although relations are standard tools in…