Kolmogorov–Smirnov-Based Edge Centrality Measure for Metric Graphs
In this work, we introduce an edge centrality measure for the Helmholtz equation on metric graphs, a particular flow network, based on spectral edge energy density. This measure identifies influential edges whose removal significantly changes the energy flow on the network, as indicated by statistic...
Saved in:
Main Authors: | Christina Durón, Hannah Kravitz, Moysey Brio |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2025-05-01
|
Series: | Dynamics |
Subjects: | |
Online Access: | https://www.mdpi.com/2673-8716/5/2/16 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Solving Edges Deletion Problem of Complete Graphs
by: Anwar N. Jasim, et al.
Published: (2024-12-01)
by: Anwar N. Jasim, et al.
Published: (2024-12-01)
Similar Items
-
Fault-Tolerant Edge Metric Dimension of Zero-Divisor Graphs of Commutative Rings
by: Omaima Alshanquiti, et al.
Published: (2025-06-01) -
Fisher–Kolmogorov–Petrovskii–Piscounov Equation with Delay
by: S. V. Aleshin, et al.
Published: (2015-04-01) -
SECURE METRIC DIMENSION OF ALTERNATE SNAKE GRAPHS
by: Basma Mohamed, et al.
Published: (2025-05-01) -
Dynamical Properties of the Fisher–Kolmogorov–Petrovskii–Piscounov Equation with Deviation of the Spatial Variable
by: S. V. Aleshin, et al.
Published: (2015-10-01) -
Kolmogorov GAM Networks Are All You Need!
by: Sarah Polson, et al.
Published: (2025-05-01)