Hubs-biased resistance distances on graphs and networks
From MaRDI portal
Publication:2247702
DOI10.1016/J.JMAA.2021.125728zbMATH Open1478.05039arXiv2101.07103OpenAlexW3207592738MaRDI QIDQ2247702FDOQ2247702
Ernesto Estrada, Delio Mugnolo
Publication date: 17 November 2021
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/2101.07103
Recommendations
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Distance in graphs (05C12)
Cites Work
- Title not available (Why is that?)
- Complex networks: structure and dynamics
- The Structure and Function of Complex Networks
- The Laplacian Spectrum of a Graph II
- Title not available (Why is that?)
- Alternative modes of questioning in the analytic hierarchy process
- On resistance-distance and Kirchhoff index
- Laplacian matrices of graphs: A survey
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Maximizing the sum of the squares of the degrees of a graph
- The Laplacian Spectrum of a Graph
- Kirchhoffian indices for weighted digraphs
- Title not available (Why is that?)
- Old and new results on algebraic connectivity of graphs
- On the spectral gap of a quantum graph
- Minimizing Effective Resistance of a Graph
- Effective graph resistance
- Sums of powers of the degrees of a graph
- Random Walks on Regular and Irregular Graphs
- Commute times for a directed graph using an asymmetric Laplacian
- Zagreb indices of graphs
- Random walks and diffusion on networks
- Title not available (Why is that?)
- `Hubs-repelling' Laplacian and related diffusion on graphs/networks
- A New Notion of Effective Resistance for Directed Graphs—Part I: Definition and Properties
- Hubs-attracting Laplacian and Related Synchronization on Networks
- Diffusive Spreading in Nature, Technology and Society
- Comparison of mean hitting times for a degree-biased random walk
- Spectra of Laplacian Matrices of Weighted Graphs: Structural Genericity Properties
- Effective Resistance Preserving Directed Graph Symmetrization
- A Metric on Directed Graphs and Markov Chains Based on Hitting Probabilities
Cited In (5)
- The resistance perturbation distance: a metric for the analysis of dynamic networks
- A physics perspective on the resistance distance for graphs
- Higher Order Difference Operators and Associated Relative Reproducing Kernel Hilbert Spaces
- Degree-biased advection–diffusion on undirected graphs/networks
- Resistance distance distribution in large sparse random 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)
