Related papers: Linear Systems on Edge-Weighted Graphs
The purpose of this paper is to prove some results on the absence of bound states for certain nonlinear Schr\"odinger equations on noncompact metric graphs with localized nonlinearity. In particular, we show how the topological and metric…
Various kinds of spread of influence occur in real world social and virtual networks. These phenomena are formulated by activation processes and irreversible dynamic monopolies in combinatorial graphs representing the topology of the…
We prove that every graph has a spectral sparsifier with a number of edges linear in its number of vertices. As linear-sized spectral sparsifiers of complete graphs are expanders, our sparsifiers of arbitrary graphs can be viewed as…
An arithmetical structure on a graph is given by a labeling of the vertices which satisfies certain divisibility properties. In this note, we look at several families of graphs and attempt to give counts on the number of arithmetical…
This work studies the denoising of piecewise smooth graph signals that exhibit inhomogeneous levels of smoothness over a graph, where the value at each node can be vector-valued. We extend the graph trend filtering framework to denoising…
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) $,…
Linear codes with few weights have applications in secret sharing, authentication codes, association schemes and strongly regular graphs. In this paper, several classes of two-weight and three-weight linear codes are presented and their…
We introduce the weighted random graph (WRG) model, which represents the weighted counterpart of the Erdos-Renyi random graph and provides fundamental insights into more complicated weighted networks. We find analytically that the WRG is…
A set $R \subseteq V(G)$ is a resolving set of a graph $G$ if for all distinct vertices $v,u \in V(G)$ there exists an element $r \in R$ such that $d(r,v) \neq d(r,u)$. The metric dimension $\dim(G)$ of the graph $G$ is the minimum…
We provide a selected overview of methodology and theory for estimation and inference on the edge weights in high-dimensional directed and undirected Gaussian graphical models. For undirected graphical models, two main explicit…
In this paper, we develop the idea to partition the edges of a weighted graph in order to uncover overlapping communities of its nodes. Our approach is based on the construction of different types of weighted line graphs, i.e. graphs whose…
In communication field, an important issue is to group users and base stations to as many as possible subnetworks satisfying certain interference constraints. These problems are usually formulated as a graph partition problems which…
We introduce a new class of graphical models that generalizes Lauritzen-Wermuth-Frydenberg chain graphs by relaxing the semi-directed acyclity constraint so that only directed cycles are forbidden. Moreover, up to two edges are allowed…
Let {\cal G}=(G,w) be a positive-weighted simple finite graph, that is, let G be a simple finite graph endowed with a function w from the set of the edges of G to the set of the positive real numbers. For any subgraph G' of G, we define…
It is a consequence of the Jacobi Inversion Theorem that a line bundle over a Riemann surface M of genus g has a meromorphic section having at most g poles, or equivalently, the divisor class of a divisor D over M contains a divisor having…
Two problems in the search of metric characteristics on weighted undirected graphs with non-negative edge weights are being considered. The first problem: a weighted undirected graph with non-negative edge weight is given. The radius,…
We show that problems which have finite integer index and satisfy a requirement we call treewidth-bounding admit linear kernels on the class of $H$-topological-minor free graphs, for an arbitrary fixed graph $H$. This builds on earlier…
The Riemann-Roch theorem is of utmost importance in the algebraic geometric theory of compact Riemann surfaces. It tells us how many linearly independent meromorphic functions there are having certain restrictions on their poles. The aim of…
Conventionally used exponential random graphs cannot directly model weighted networks as the underlying probability space consists of simple graphs only. Since many substantively important networks are weighted, this limitation is…
Let ${\cal G}=(G,w)$ be a weighted simple finite connected graph, that is, let $G$ be a simple finite connected graph endowed with a function $w$ from the set of the edges of $G$ to the set of real numbers. For any subgraph $G'$ of $G$, we…