Hubs-biased resistance distances on graphs and networks
From MaRDI portal
Publication:2247702
Abstract: We define and study two new kinds of "effective resistances" based on hubs-biased -- hubs-repelling and hubs-attracting -- models of navigating a graph/network. We prove that these effective resistances are squared Euclidean distances between the vertices of a graph. They can be expressed in terms of the Moore-Penrose pseudoinverse of the hubs-biased Laplacian matrices of the graph. We define the analogous of the Kirchhoff indices of the graph based of these resistance distances. We prove several results for the new resistance distances and the Kirchhoff indices based on spectral properties of the corresponding Laplacians. After an intensive computational search we conjecture that the Kirchhoff index based on the hubs-repelling resistance distance is not smaller than that based on the standard resistance distance, and that the last is not smaller than the one based on the hubs-attracting resistance distance. We also observe that in real-world brain and neural systems the efficiency of standard random walk processes is as high as that of hubs-attracting schemes. On the contrary, infrastructures and modular software networks seem to be designed to be navigated by using their hubs.
Recommendations
Cites work
- scientific article; zbMATH DE number 5977361 (Why is no real title available?)
- scientific article; zbMATH DE number 3934150 (Why is no real title available?)
- scientific article; zbMATH DE number 867649 (Why is no real title available?)
- scientific article; zbMATH DE number 3417498 (Why is no real title available?)
- scientific article; zbMATH DE number 964896 (Why is no real title available?)
- A New Notion of Effective Resistance for Directed Graphs—Part I: Definition and Properties
- A metric on directed graphs and Markov chains based on hitting probabilities
- Alternative modes of questioning in the analytic hierarchy process
- Commute times for a directed graph using an asymmetric Laplacian
- Comparison of mean hitting times for a degree-biased random walk
- Complex networks: structure and dynamics
- Degree resistance distance of unicyclic graphs
- Diffusive spreading in nature, technology and society
- Effective Resistance Preserving Directed Graph Symmetrization
- Effective graph resistance
- Hubs-attracting Laplacian and related synchronization on networks
- Kirchhoffian indices for weighted digraphs
- Laplacian matrices of graphs: A survey
- Maximizing the sum of the squares of the degrees of a graph
- Minimizing Effective Resistance of a Graph
- Old and new results on algebraic connectivity of graphs
- On resistance-distance and Kirchhoff index
- On the spectral gap of a quantum graph
- Random Walks on Regular and Irregular Graphs
- Random walks and diffusion on networks
- Spectra of Laplacian matrices of weighted graphs: structural genericity properties
- Sum of powers of the degrees of graphs: extremal results and bounds
- Sums of powers of the degrees of a graph
- The Laplacian Spectrum of a Graph
- The Laplacian Spectrum of a Graph II
- The Structure and Function of Complex Networks
- Zagreb indices of graphs
- `Hubs-repelling' Laplacian and related diffusion on graphs/networks
Cited in
(6)- The resistance perturbation distance: a metric for the analysis of dynamic networks
- Degree-biased advection–diffusion on undirected graphs/networks
- Resistance distance distribution in large sparse random graphs
- `Hubs-repelling' Laplacian and related diffusion on graphs/networks
- Higher Order Difference Operators and Associated Relative Reproducing Kernel Hilbert Spaces
- A physics perspective on the resistance distance for graphs
This page was built for publication: Hubs-biased resistance distances on graphs and networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2247702)
