On the Definiteness of the Weighted Laplacian and its Connection to
Effective Resistance
release_7qpo74pebncizpptpbimjyauxu
by
Daniel Zelazo, Mathias Bürger
2014
Abstract
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 transformations. For a graph with a single negative weight edge, we
show that the weighted Laplacian becomes indefinite if the magnitude of the
negative weight is less than the inverse of the effective resistance between
the two incident nodes. This result is extended to multiple negative weight
edges. The utility of these results are demonstrated in a weighted consensus
network where appropriately placed negative weight edges can induce a
clustering behavior for the protocol.
In text/plain
format
Archived Files and Locations
application/pdf 578.6 kB
file_r654repv4baplggawjfkbum6km
|
arxiv.org (repository) web.archive.org (webarchive) |
1408.2187v1
access all versions, variants, and formats of this works (eg, pre-prints)