English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

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.

On the definiteness of the weighted Laplacian and its connection to effective resistance