Related papers: Weighted Analytic Torsion for Weighted Digraphs

A way to associate unweighted graphs from weighted ones is presented, such that linear stable equilibria of the Kuramoto homogeneous model associated to both graphs coincide, i.e., equilibria of the system $\dot\theta_i = \sum_{j \sim i}…

Let $I=I(D)$ be the edge ideal of a weighted oriented graph $D$, let $G$ be the underlying graph of $D$, and let $I^{(n)}$ be the $n$-th symbolic power of $I$ defined using the minimal primes of $I$. We prove that $I^2=I^{(2)}$ if and only…

Let $\overline{M}$ be a compact Riemann surface and let $g^{TM}$ be a metric over $\overline{M} \setminus D_M$, where $D_M \subset \overline{M}$ is a finite set of points. We suppose that $g^{TM}$ is equal to the Poincar\'e metric over a…

A statistically principled way of conducting weighted network analysis is still lacking. Comparison of different populations of weighted networks is hard because topology is inherently dependent on wiring cost, where cost is defined as the…

In this paper, various kinds of invariants of directed graphs are summarized. In the first topic, the invariant w(G) for a directed graph G is introduced, which is primarily defined by S. Chen and X.M. Chen to solve a problem of weak…

A digraph $D$ is called {\bf noneven} if it is possible to assign weights of 0,1 to its arcs so that $D$ contains no cycle of even weight. A noneven digraph $D$ corresponds to one or more nonsingular sign patterns. Given an $n \times n$…

The theory of dependency graphs is a powerful toolbox to prove asymptotic normality of sums of random variables. In this article, we introduce a more general notion of weighted dependency graphs and give normality criteria in this context.…

To a higher rank directed graph $(\Lambda, d)$, in the sense of Kumjian and Pask, one can associate natural noncommutative analytic Toeplitz algebras, both weakly closed and norm closed. We introduce methods for the classification of these…

Consider a flat vector bundle F over compact Riemannian manifold M and let f be a self-indexing Morse function on M. Let g be a smooth Euclidean metric on F. Set g_t=exp(-2tf)g and let \rho(t) be the Ray-Singer analytic torsion of F…

An independent set in a graph G is a set of vertices no two of which are joined by an edge. A vertex-weighted graph associates a weight with every vertex in the graph. A vertex-weighted graph G is called a unique independence…

We show that, given a $ k $-tangle $ \tau $ in a graph $ G $, there always exists a weight function $ w\colon V(G)\to\mathbb{N} $ such that a separation $ (A,B) $ of $ G $ of order $ {<}k $ lies in $ \tau $ if and only if $ w(A)<w(B) $,…

We study the behaviour of analytic torsion under smooth fibrations. Namely, let F \to E \to^{f} B be a smooth fiber bundle of connected closed oriented smooth manifolds and let $V$ be a flat vector bundle over $E$. Assume that $E$ and $B$…

We consider the complexity of counting weighted graph homomorphisms defined by a symmetric matrix $A$. Each symmetric matrix $A$ defines a graph homomorphism function $Z_A(\cdot)$, also known as the partition function. Dyer and Greenhill…

A total weighting of a graph $G$ is a mapping $f$ which assigns to each element $z \in V(G) \cup E(G)$ a real number $f(z)$ as its weight. The vertex sum of $v$ with respect to $f$ is $\phi_f(v)=\sum_{e \in E(v)}f(e)+f(v)$. A total…

The interlace polynomials introduced by Arratia, Bollobas and Sorkin extend to invariants of graphs with vertex weights, and these weighted interlace polynomials have several novel properties. One novel property is a version of the…

Riemannian Geometry, Topology and Dynamics permit to introduce partially defined holomorphic functions on the variety of representations of the fundamental group of a manifold. The functions we consider are the complex valued Ray-Singer…

We solve the following problem: Can an undirected weighted graph G be parti- tioned into two non-empty induced subgraphs satisfying minimum constraints for the sum of edge weights at vertices of each subgraph? We show that this is possible…

We use higher parallel transport -- more precisely, the integration A_{infty}-functor constructed by Block-Smith and Arias Abad-Schaetz -- to define Reidemeister torsion for flat superconnections. We hope that the combinatorial Reidemeister…

The aspect ratio of a (positively) weighted graph $G$ is the ratio of its maximum edge weight to its minimum edge weight. Aspect ratio commonly arises as a complexity measure in graph algorithms, especially related to the computation of…

Discrete structures like graphs make it possible to naturally and flexibly model complex phenomena. Since graphs that represent various types of information are increasingly available today, their analysis has become a popular subject of…