Communicability angle and the spatial efficiency of networks
From MaRDI portal
Recommendations
- Communication in complex networks
- Updating and downdating techniques for optimizing network communicability
- Tuned communicability metrics in networks. The case of alternative routes for urban traffic
- Network bipartitioning in the anti-communicability Euclidean space
- Networks that optimize a trade-off between efficiency and dynamical resilience
Cites work
- \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
- Communicability graph and community structures in complex networks
- Expander graphs and their applications
- Expander graphs in pure and applied mathematics
- Harmony in the small-world
- scientific article; zbMATH DE number 432759 (Why is no real title available?)
- scientific article; zbMATH DE number 4006288 (Why is no real title available?)
- scientific article; zbMATH DE number 2115090 (Why is no real title available?)
- Hyperspherical embedding of graphs and networks in communicability spaces
- Isoperimetric inequalities, growth, and the spectrum of graphs
- Network properties revealed through matrix functions
- On the Cutting Edge: Simplified O(n) Planarity by Edge Addition
- Penny-packing and two-dimensional codes
- Spanning trees of finite Sierpiński graphs
- The communicability distance in graphs
- The Structure and Function of Complex Networks
Cited in
(18)- Communication aspects of networks based on geometric incidence relations
- Monitoring effective connectivity in the preterm brain: a graph approach to study maturation
- Random neighborhood graphs as models of fracture networks on rocks: structural and dynamical analysis
- Communication in complex networks
- Every nonsingular spherical Euclidean distance matrix is a resistance distance matrix
- Network bipartitioning in the anti-communicability Euclidean space
- Tuned communicability metrics in networks. The case of alternative routes for urban traffic
- ``Melting of complex networks. A mathematical model of complex networks resilience to external stress
- Edge modification criteria for enhancing the communicability of digraphs
- The mutual potential of proteins and interaction networks
- The Range of Topological Effects on Communication
- The electron density function of the Hückel (tight-binding) model
- Flow-Based Algorithms for Improving Clusters: A Unifying Framework, Software, and Performance
- Matrix functions in network analysis
- Communicability cosine distance: similarity and symmetry in graphs/networks
- Forman-Ricci communicability curvature of graphs and networks
- Geometries of mixed graphs in complex vector spaces. Hierarchies and clusters in complex networks
- The geometry of the Hückel/tight-binding method for modeling molecular systems
This page was built for publication: Communicability angle and the spatial efficiency of networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2832109)
