2007
DOI: 10.1215/ijm/1258131103
|View full text |Cite
|
Sign up to set email alerts
|

The spectrum of the averaging operator on a network (metric graph)

Abstract: A network is a countable, connected graph X viewed as a one-complex, where each edge [x, y] = [y, x] (x, y ∈ X 0 , the vertex set) is a copy of the unit interval within the graph's one-skeleton X 1 and is assigned a positive conductance c(xy). A reference "Lebesgue" measure on X 1 is built up by using Lebesgue measure with total mass c(xy) on each edge [x, y]. There are three natural operators on X: the transition operator P acting on functions on X 0 (the reversible Markov chain associated with c), the averag… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
13
0

Year Published

2012
2012
2018
2018

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 9 publications
(13 citation statements)
references
References 15 publications
(24 reference statements)
0
13
0
Order By: Relevance
“…We believe that, with some suitable modifications, similar relationships should exist for other type of operators, like the averaging operator [44] or the fourth order or mixed order operators appearing in the description of beams [45,20]. We hope to clarify the situation in subsequent works.…”
Section: Theorem 17mentioning
confidence: 84%
“…We believe that, with some suitable modifications, similar relationships should exist for other type of operators, like the averaging operator [44] or the fourth order or mixed order operators appearing in the description of beams [45,20]. We hope to clarify the situation in subsequent works.…”
Section: Theorem 17mentioning
confidence: 84%
“…It is well-known that D −1 A is the transition matrix associated with a random walk on the graph and it has been shown in [CW07] that an interesting interplay exists between the spectral properties of D −1 A and those of a certain bounded, self-adjoint operator A over L 2 (G), where G is the quantum graph associated with G. Such an A can be interpreted as the operator that maps functions over a quantum graph G into their average over balls of radius 1 with respect to the canonical structure of a quantum graph as a metric measure space. Spectral relations between D −1 A and A as well as a representation of A in terms of the quantum graph Laplacian via self-adjoint functional calculus have been proved in [CW07,LP16]. The considerations in [CW07] suggest that the correct quantum graph counterpart of our (unnormalized!)…”
Section: Quasilinear Evolutionmentioning
confidence: 99%
“…Furthermore, for all x ∈ X 0 and u, v ∼ x consider the functionals l xuv on dom S given by l xuv F = F(xv, 0) − F(xu, 0). By (12), all these functionals are continuous in the graph norm of S, hence their kernels are closed in the graph norm of S. As S is the restriction of S to the intersection of these kernels, it is a closed operator.…”
Section: Spectral Analysis Of Lmentioning
confidence: 99%
“…it is an unbounded self-adjoint operator in L 2 (X 1 , m 1 ), see Theorem 4 below. Finally, the third operator A is the averaging operator over unit balls introduced in [12] in generalizing the notion of a transition operator [38]; it acts as…”
Section: Introductionmentioning
confidence: 99%