Related papers: Infinite weighted graphs with bounded resistance m…
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…
The graphical notion of effective resistance has found wide-ranging applications in many areas of pure mathematics, applied mathematics and control theory. By the nature of its construction, effective resistance can only be computed in…
We study the map from conductances to edge energies for harmonic functions on finite graphs with Dirichlet boundary conditions. We prove that for any compatible acyclic orientation and choice of energies there is a unique choice of…
On a finite graph with a chosen partition of the vertex set into interior and boundary vertices, a $\lambda$-polyharmonic function is a complex function $f$ on the vertex set which satisfies $(\lambda \cdot I - P)^n f(x) = 0$ at each…
Using the technique of the metrization theorem of uniformities with countable bases, in this note we provide, test and compare an explicit algorithm to produce a metric $d(x,y)$ between the vertices $x$ and $y$ of an affinity weighted…
In this article we consider resistance matrix of a connected graph. For unweighted graph we study some necessary and sufficient conditions for resistance regular graphs. Also we find some relationship between Laplacian matrix and resistance…
This work presents a new method for symmetrization of directed graphs that constructs an undirected graph with equivalent pairwise effective resistances as a given directed graph. Consequently a graph metric, square root of effective…
We give identities for the voltage and resistance functions on a metrized graph to show how these functions behave under any edge deletion/contraction and the identification of any two vertices. This leads to explicit versions of Rayleigh's…
We consider a class of infinite weighted metric trees obtained as perturbations of self-similar regular trees. Possible definitions of the boundary traces of functions in the Sobolev space on such a structure are discussed by using…
We compute the joint large deviation rate functional in the limit of large time for the current flowing through the edges of a finite graph on which a boundary-driven system of stochastic particles evolves with zero-range dynamics.This…
Motivated by limits of critical inhomogeneous random graphs, we construct a family of sequences of measured metric spaces that we call continuous multiplicative graphs, that are expected to be the universal limit of graphs related to the…
In skew-product systems with contractive factors, all orbits asymptotically approach the graph of the so-called sync function; hence, the corresponding regularity properties primarily matter. In the literature, sync function Lipschitz…
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…
This work explores the definiteness of the weighted graph Laplacian matrix with negative edge weights. The definiteness of the weighted Laplacian is studied in terms of certain matrices that are related via congruent and similarity…
Successive divisions of compact metric spaces appear in many different areas of mathematics such as the construction of self-similar sets, Markov partitions associated with hyperbolic dynamical systems, dyadic cubes associated with a…
We study graph products of groups from the viewpoint of measured group theory. We first establish a full measure equivalence classification of graph products of countably infinite groups over finite simple graphs with no transvection and no…
A Riemann-Roch theorem on graph was initiated by M. Baker and S. Norine. In their article [2], a Riemann-Roch theorem on a finite graph with uniform vertex-weight and uniform edge-weight was established and it was suggested a Riemann-Roch…
A natural representation of random graphs is the random measure. The collection of product random measures, their transformations, and non-negative test functions forms a general representation of the collection of non-negative weighted…
Hypergraphs are structures that can be decomposed or described; in other words they are recursively countable. Here, we get exact and asymptotic enumeration results on hypergraphs by means of exponential generating functions. The number of…
In graph signal processing, data samples are associated to vertices on a graph, while edge weights represent similarities between those samples. We propose a convex optimization problem to learn sparse well connected graphs from data. We…