Higher order assortativity in complex networks
From MaRDI portal
Abstract: Assortativity was first introduced by Newman and has been extensively studied and applied to many real world networked systems since then. Assortativity is a graph metrics and describes the tendency of high degree nodes to be directly connected to high degree nodes and low degree nodes to low degree nodes. It can be interpreted as a first order measure of the connection between nodes, i.e. the first autocorrelation of the degree-degree vector. Even though assortativity has been used so extensively, to the author's knowledge, no attempt has been made to extend it theoretically. This is the scope of our paper. We will introduce higher order assortativity by extending the Newman index based on a suitable choice of the matrix driving the connections. Higher order assortativity will be defined for paths, shortest paths, random walks of a given time length, connecting any couple of nodes. The Newman assortativity is achieved for each of these measures when the matrix is the adjacency matrix, or, in other words, the correlation is of order 1. Our higher order assortativity indexes can be used for describing a variety of real networks, help discriminating networks having the same Newman index and may reveal new topological network features.
Recommendations
Cites work
- scientific article; zbMATH DE number 5977361 (Why is no real title available?)
- scientific article; zbMATH DE number 3150484 (Why is no real title available?)
- scientific article; zbMATH DE number 5005369 (Why is no real title available?)
- scientific article; zbMATH DE number 3641625 (Why is no real title available?)
- A utility-based link prediction method in social networks
- Assortativity in complex networks
- Clustering data that are graph connected
- Community structure in large networks: natural cluster sizes and the absence of large well-defined clusters
- Control and voting power in corporate networks: Concepts and computational aspects
- Cooperative game theoretic centrality analysis of terrorist networks: the cases of Jemaah Islamiyah and Al Qaeda
- Degree-Degree Dependencies in Random Graphs with Heavy-Tailed Degrees
- Emergence of Scaling in Random Networks
- Evolution of social networks
- Extremal properties of graphs and eigencentrality in trees with a given degree sequence
- Higher order connectivity index of starlike trees
- Influence of assortativity and degree-preserving rewiring on the spectra of networks
- Knowing the odds. An introduction to probability
- Modeling centrality measures in social network analysis using bi-criteria network flow optimization problems
- Parallel concepts in graph theory
- The Distribution Theory of Runs
- Towards a Theory of Scale-Free Graphs: Definition, Properties, and Implications
Cited in
(15)- High-order degree and combined degree in complex networks
- Higher-order assortativity for directed weighted networks and Markov chains
- Multi-hop assortativities for network classification
- Two-walks degree assortativity in graphs and networks
- Spatial associations in global household bicycle ownership
- Influence of assortativity and degree-preserving rewiring on the spectra of networks
- The transsortative structure of networks
- On degree-degree correlations in multilayer networks
- Assortativity in complex networks
- HOasso
- Assortativity measures for weighted and directed networks
- Degree distribution and assortativity in line graphs of complex networks
- Generalized rich-club ordering in networks
- Higher order clustering coefficients in Barabási-Albert networks
- An entropic edge assortativity measure
This page was built for publication: Higher order assortativity in complex networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1683104)
