The Spectrum of the Averaging Operator on a Network (metric Graph)
نویسنده
چکیده
A network is a countable, connected graph X viewed as a one-complex, where each edge [x, y] = [y, x] (x, y ∈ X, the vertex set) is a copy of the unit interval within the graph’s one-skeleton X and is assigned a positive conductance c(xy). A reference “Lebesgue” measure X is built up by using Lebesgue measure with total mass c(xy) on each edge xy. There are three natural operators on X: the transition operator P acting on functions on X (the reversible Markov chain associated with c), the averaging operator A over spheres of radius 1 on X, and the Laplace operator ∆ on X (with Kirchhoff conditions weighted by c at the vertices). The relation between the `-spectrum of P and the H-spectrum of ∆ was described by Cattaneo [4]. In this note we describe the relation between the `-spectrum of P and the L-spectrum of A.
منابع مشابه
Existence and uniqueness of the solution for a general system of operator equations in $b-$metric spaces endowed with a graph
The purpose of this paper is to present some coupled fixed point results on a metric space endowed with two $b$-metrics. We shall apply a fixed point theorem for an appropriate operator on the Cartesian product of the given spaces endowed with directed graphs. Data dependence, well-posedness and Ulam-Hyers stability are also studied. The results obtained here will be applied to prove the existe...
متن کاملThe spectrum of the averaging operator on a network ( metric graph )
A network is a countable, connected graph X viewed as a one-complex, where each edge [x, y] = [y, x] (x, y ∈ X, the vertex set) is a copy of the unit interval within the graph’s one-skeleton X and is assigned a positive conductance c(xy). A reference “Lebesgue” measure X is built up by using Lebesgue measure with total mass c(xy) on each edge xy. There are three natural operators on X: the tran...
متن کاملADAPTIVE ORDERED WEIGHTED AVERAGING FOR ANOMALY DETECTION IN CLUSTER-BASED MOBILE AD HOC NETWORKS
In this paper, an anomaly detection method in cluster-based mobile ad hoc networks with ad hoc on demand distance vector (AODV) routing protocol is proposed. In the method, the required features for describing the normal behavior of AODV are defined via step by step analysis of AODV and independent of any attack. In order to learn the normal behavior of AODV, a fuzzy averaging method is used fo...
متن کاملOn two-dimensional Cayley graphs
A subset W of the vertices of a graph G is a resolving set for G when for each pair of distinct vertices u,v in V (G) there exists w in W such that d(u,w)≠d(v,w). The cardinality of a minimum resolving set for G is the metric dimension of G. This concept has applications in many diverse areas including network discovery, robot navigation, image processing, combinatorial search and optimization....
متن کاملThe Existence Theorem for Contractive Mappings on $wt$-distance in $b$-metric Spaces Endowed with a Graph and its Application
In this paper, we study the existence and uniqueness of fixed points for mappings with respect to a $wt$-distance in $b$-metric spaces endowed with a graph. Our results are significant, since we replace the condition of continuity of mapping with the condition of orbitally $G$-continuity of mapping and we consider $b$-metric spaces with graph instead of $b$-metric spaces, under which can be gen...
متن کامل