Related papers: Weighted Analytic Torsion for Weighted Digraphs
In this paper, we study the exact learning problem for weighted graphs, where we are given the vertex set, $V$, of a weighted graph, $G=(V,E,w)$, but we are not given $E$. The problem, which is also known as graph reconstruction, is to…
We exploit the equality of Bergman analytic content and torsional rigidity of a simply connected domain to develop a new method for calculating these quantities. This method is particularly suitable for the case when the region in question…
A {\it semi-proper orientation} of a given graph $G$ is a function $(D,w)$ that assigns an orientation $D(e)$ and a positive integer weight $ w(e)$ to each edge $e$ such that for every two adjacent vertices $v$ and $u$, $S_{(D,w)}(v) \neq…
The problem of continuation of a partially defined metric can be efficiently studied using graph theory. Let $G=G(V,E)$ be an undirected graph with the set of vertices $V$ and the set of edges $E$. A necessary and sufficient condition under…
Inspired by the work of Boris Vertman on refined analytic torsion for manifolds with boundary, in this paper we extend the construction of the Cappell-Miller analytic torsion to manifolds with boundary. We also compare it with the refined…
An edge irregular total $k$-labelling $f : V(G)\cup E(G)\rightarrow \{1,2,\dots,k\}$ of a graph $G$ is a labelling of the vertices and the edges of $G$ in such a way that any two different edges have distinct weights. The weight of an edge…
We present an analog to classic potential theory on weighted graphs. With nodes partitioned into exterior, boundary and interior nodes and an appropriate decomposition of the Laplacian, we define discrete analogues to the trace operators,…
In this paper, we study a deformation theory of rigid analytic spaces. We develop a theory of cotangent complexes for rigid geometry which fits in with our deformations. We then use the complexes to give a cohomological description of…
We analyze a general model of weighted graphs, introduced by de Panafieu and Ravelomanana (2014) and similar to the "inhomogeneous graph model" of S\"oderberg (2002). Each vertex receives a "type" among a set of $q$ possibilities as well as…
Let $(X,T)$ and $(Y,S)$ be two subshifts so that $Y$ is a factor of $X$. For any asymptotically sub-additive potential $\Phi$ on $X$ and $\ba=(a,b)\in\R^2$ with $a>0$, $b\geq 0$, we introduce the notions of $\ba$-weighted topological…
As the popularity of graph data increases, there is a growing need to count the occurrences of subgraph patterns of interest, for a variety of applications. Many graphs are massive in scale and also fully dynamic (with insertions and…
In real-world networks, predicting the weight (strength) of links is as crucial as predicting the existence of the links themselves. Previous studies have primarily used shallow graph features for link weight prediction, limiting the…
We establish a weighted simultaneous Khintchine-type theorem, both convergence and divergence, for all nondegenerate manifolds, which answers a problem posed in [Math. Ann., 337(4):769-796, 2007]. This extends the main results of [Acta…
In this paper, we study the task of detecting the edge dependency between two weighted random graphs. We formulate this task as a simple hypothesis testing problem, where under the null hypothesis, the two observed graphs are statistically…
We give a bi-criteria approximation algorithm for the Minimum Nonuniform Partitioning problem, recently introduced by Krauthgamer, Naor, Schwartz and Talwar (2014). In this problem, we are given a graph $G=(V,E)$ on $n$ vertices and $k$…
We prove an extension of the Regularity Lemma with vertex and edge weights which can be applied for a large class of graphs. The applications involve random graphs and a weighted version of the Erd\H{o}s-Stone theorem. We also provide means…
We define a divisor theory for graphs and tropical curves endowed with a weight function on the vertices; we prove that the Riemann-Roch theorem holds in both cases. We extend Baker's Specialization Lemma to weighted graphs.
This paper introduces a new extension of Riemannian elastic curve matching to a general class of geometric structures, which we call (weighted) shape graphs, that allows for shape registration with partial matching constraints and…
It is well-known and easy to show that even the following version of the directed travelling salesman problem is NP-complete: Given a strongly connected complete digraph $D=(V,A)$, a cost function $w: A\rightarrow \{0,1\}$ and a natural…
Magnitude homology is a bigraded homology theory for finite graphs defined by Hepworth and Willerton, categorifying the power series invariant known as magnitude which was introduced by Leinster. We analyze the structure and implications of…