Predicting Triadic Closure in Networks Using Communicability Distance Functions

DOI10.1137/140996768zbMath1320.05073arXiv1411.5599OpenAlexW2963489080MaRDI QIDQ2943520

Francesca Arrigo, Ernesto Estrada

Publication date: 3 September 2015

Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1411.5599

zbMATH Keywords

adjacency matrixnetwork analysismatrix functionstriadic closuretrianglescommunicability distance

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12) Matrix exponential and similar functions of matrices (15A16)

Related Items

A Hierarchy of Network Models Giving Bistability Under Triadic Closure, Some bounds for total communicability of graphs, Matrix functions in network analysis, Spectra of Laplacian Matrices of Weighted Graphs: Structural Genericity Properties, A framework for second-order eigenvector centralities and clustering coefficients, Community Detection in Networks via Nonlinear Modularity Eigenvectors

Uses Software

• Pajek
• Pajek datasets
• mftoolbox

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The communicability distance in graphs
• Communicability graph and community structures in complex networks
• Quadrature rule-based bounds for functions of adjacency matrices
• Bounds for the entries of matrix functions with applications to preconditioning
• Relaxing the uniformity and independence assumptions using the concept of fractal dimension
• Network Properties Revealed through Matrix Functions
• The Structure and Function of Complex Networks
• Triadic closure dynamics drives scaling laws in social multiplex networks
• Structure of triadic relations in multiplex networks
• Collective dynamics of ‘small-world’ networks
• Functions of Matrices
• Networks