Related papers: Weighted Analytic Torsion for Weighted Digraphs

Topological metrics of graphs provide a natural way to describe the prominent features of various types of networks. Graph metrics describe the structure and interplay of graph edges and have found applications in many scientific fields. In…

We study the topology of a space parametrizing stable tropical curves of genus g with volume 1, showing that its reduced rational homology is canonically identified with both the top weight cohomology of M_g and also with the genus g part…

Graph Sampling provides an efficient yet inexpensive solution for analyzing large graphs. While extracting small representative subgraphs from large graphs, the challenge is to capture the properties of the original graph. Several sampling…

In this paper, we develop a diamond graph theory and apply the theory to the (co)homology of the Lie algebra generated by positive systems of the classical semi-simple Lie algebras over the field of complex numbers. As an application, we…

We derive normal approximation bounds in the Wasserstein distance for sums of weighted U-statistics, based on a general distance bound for functionals of independent random variables of arbitrary distributions. Those bounds are applied to…

Recently, Cappell and Miller extended the classical construction of the analytic torsion for de Rham complexes to coupling with an arbitrary flat bundle and the holomorphic torsion for $\bar{\partial}$-complexes to coupling with an…

We state the graph-theoretic computational problem of finding tight paths in a directed, edge-weighted graph, as well as its simplification of finding tight pairs. These problems are motivated by the need of algorithms that find so-called…

We develop a formulation for non-commutative derived analytic geometry built from differential graded (dg) algebras equipped with free entire functional calculus (FEFC), relating them to simplicial FEFC algebras and to locally…

We describe several general methods for calculating weights of mixed tilting sheaves. We introduce a notion called "non-cancellation property" which implies a strong uniqueness of mixed tilting sheaves and enables one to calculate their…

General factors are a generalization of matchings. Given a graph $G$ with a set $\pi(v)$ of feasible degrees, called a degree constraint, for each vertex $v$ of $G$, the general factor problem is to find a (spanning) subgraph $F$ of $G$…

For a graph $G=(V,E)$ and $v_{i}\in V$, denote by $d_{i}$ the degree of vertex $v_{i}$. Let $f(x, y)>0$ be a real symmetric function in $x$ and $y$. The weighted adjacency matrix $A_{f}(G)$ of a graph $G$ is a square matrix, where the…

A pair $(u, v)$ of (not necessarily distinct) vertices in a directed graph $D$ is called a reachable pair if there exists a directed path from $u$ to $v$. We define the weight of $D$ to be the number of reachable pairs of $D$, which equals…

We study the analytic torsion of the cone over an orientable odd dimensional compact connected Riemannian manifold W. We prove that the logarithm of the analytic torsion of the cone decomposes as the sum of the logarithm of the root of the…

An edge weighting problem of a graph G is an assignment of an integer weight to each edge e. Based on edge weighting problem, several types of vertex-coloring problems are put forward. A simple observation illuminates that edge weighting…

A novel partial order is defined on the space of digraphs or hypergraphs, based on assessing the cost of producing a graph via a sequence of elementary transformations. Leveraging work by Knuth and Skilling on the foundations of inference,…

An integral homology theory on the category of undirected reflexive graphs was constructed in [2]. A geometrical method to understand behaviors of $1$- and $2$-simplices under differential maps of the theory was developed in [3] and led us…

This is a short version of math.DG/0505537. For an acyclic representation of the fundamental group of a compact oriented odd-dimensional manifold, which is close enough to a unitary representation, we define a refinement of the Ray-Singer…

For a fixed graph $F$, let $ex_F(G)$ denote the size of the largest $F$-free subgraph of $G$. Computing or estimating $ex_F(G)$ for various pairs $F,G$ is one of the central problems in extremal combinatorics. It is thus natural to ask how…

In 2004, Karo\'nski, \L uczak and Thomason proposed $1$-$2$-$3$-conjecture: For every nice graph $G$ there is an edge weighting function $ w:E(G)\rightarrow\{1,2,3\} $ such that the induced vertex coloring is proper. After that, the total…

The concept of weights on the cohomology of algebraic varieties was initiated by fundamental ideas and work of A. Grothendieck and P. Deligne. It is deeply connected with the concept of motives and appeared first on the singular cohomology…