Higher order assortativity in complex networks
From MaRDI portal
Publication:1683104
DOI10.1016/j.ejor.2017.04.028zbMath1375.90068arXiv1602.03650OpenAlexW2268106831MaRDI QIDQ1683104
Rosanna Grassi, Anna Torriero, Silvana Stefani, Alberto Arcagni
Publication date: 6 December 2017
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1602.03650
Programming involving graphs or networks (90C35) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Deterministic network models in operations research (90B10) Case-oriented studies in operations research (90B90) Random walks on graphs (05C81)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Influence of assortativity and degree-preserving rewiring on the spectra of networks
- Control and voting power in corporate networks: Concepts and computational aspects
- Parallel concepts in graph theory
- Higher order connectivity index of starlike trees
- A utility-based link prediction method in social networks
- Clustering data that are graph connected
- Modeling centrality measures in social network analysis using bi-criteria network flow optimization problems
- Cooperative game theoretic centrality analysis of terrorist networks: the cases of Jemaah Islamiyah and Al Qaeda
- Evolution of social networks
- Emergence of Scaling in Random Networks
- Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters
- Extremal Properties of Graphs and Eigencentrality in Trees with a Given Degree Sequence
- Assortativity in complex networks
- Degree-Degree Dependencies in Random Graphs with Heavy-Tailed Degrees
- Towards a Theory of Scale-Free Graphs: Definition, Properties, and Implications
- The Distribution Theory of Runs
