Detection of hubs in complex networks by the Laplacian matrix

DOI10.1007/S42952-020-00087-0zbMATH Open1485.62068OpenAlexW3091579479MaRDI QIDQ2131998FDOQ2131998

Authors: Younghee Hong, Iksoo Chang, Choongrak Kim 

Publication date: 27 April 2022

Published in: Journal of the Korean Statistical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s42952-020-00087-0

Recommendations

• The Laplacian spectra of graphs and complex networks
• Detection of core-periphery structure in networks using spectral methods and geodesic paths
• Structural Analysis of Laplacian Spectral Properties of Large-Scale Networks
• Identification of node centrality based on Laplacian energy of networks
• Estimating sparse networks with hubs
• The spectrum of the graph Laplacian as a tool for analyzing structure and evolution of networks
• `Hubs-repelling' Laplacian and related diffusion on graphs/networks
• Detecting the topologies of complex networks with stochastic perturbations
• Laplacian centrality: A new centrality measure for weighted networks

zbMATH Keywords

adjacency matrixeigenvalueeigenvectorconditional dependency

Mathematics Subject Classification ID

Estimation in multivariate analysis (62H12) Probabilistic graphical models (62H22) Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Cites Work

• Sparse estimation of a covariance matrix
• Introduction to Graphical Modelling
• High-dimensional graphs and variable selection with the Lasso
• On the distribution of the largest eigenvalue in principal components analysis
• Title not available (Why is that?)
• Model selection and estimation in the Gaussian graphical model
• Partial correlation estimation by joint sparse regression models
• DISTRIBUTION OF EIGENVALUES FOR SOME SETS OF RANDOM MATRICES
• Latent variable graphical model selection via convex optimization
• High-dimensional covariance estimation by minimizing \(\ell _{1}\)-penalized log-determinant divergence
• A new status index derived from sociometric analysis
• Estimating sparse precision matrix: optimal rates of convergence and adaptive estimation
• Adaptive thresholding for sparse covariance matrix estimation
• An overview of the estimation of large covariance and precision matrices
• Networks. An introduction.
• On orthogonal and symplectic matrix ensembles
• Multivariate analysis and Jacobi ensembles: largest eigenvalue, Tracy-Widom limits and rates of convergence
• Adaptive covariance matrix estimation through block thresholding
• Characteristic vectors of bordered matrices with infinite dimensions
• Minimax bounds for sparse PCA with noisy high-dimensional data
• Tracy-Widom law for the extreme eigenvalues of sample correlation matrices
• Network centrality: an introduction
• Edge universality of correlation matrices
• Model Checking on Trees with Path Equivalences
• Graph Spectra for Complex Networks
• Recent developments in high dimensional covariance estimation and its related issues, a review

Cited In (4)

• A fast approach to the detection of all-purpose hubs in complex networks with chemical applications
• A Nonlinear Spectral Method for Core--Periphery Detection in Networks
• Probing complex networks from measured time series
• `Hubs-repelling' Laplacian and related diffusion on graphs/networks

Uses Software

• spcov
• MIM

This page was built for publication: Detection of hubs in complex networks by the Laplacian matrix

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2131998)