Unravelling small world networks

DOI10.1016/S0377-0427(03)00471-0zbMath1028.65034MaRDI QIDQ1408397

Desmond J. Higham

Publication date: 15 September 2003

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

numerical resultsinverse problemLaplacianMaximum likelihoodBandwidthBioinformaticsRandom graphAdjacency matrixSparse matrixMinimum degreeCuthill-McKeeEnvelopeGenome datasetsProteome networksReorderingSmall world phenomenonTwo-sumworld reordering problem

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Random graphs (graph-theoretic aspects) (05C80) Combinatorics on words (68R15) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items (4)

Metaheuristic algorithms for the bandwidth reduction of large-scale matrices ⋮ A variable neighborhood search and simulated annealing hybrid for the profile minimization problem ⋮ A Hypergraph Partitioning Model for Profile Minimization ⋮ Mathematical programming models for some smallest-world problems

Cites Work

• Unnamed Item
• Unnamed Item
• An improved spectral bisection algorithm and its application to dynamic load balancing
• Two improved algorithms for envelope and wavefront reduction
• Greedy pathlengths and small world graphs
• From the Cover: The structure of scientific collaboration networks
• Small worlds
• An Analysis of Spectral Envelope Reduction via Quadratic Assignment Problems
• RELEVANT CYCLES IN CHEMICAL REACTION NETWORKS
• A Matrix Perturbation View of the Small World Phenomenon
• A spectral algorithm for envelope reduction of sparse matrices
• Collective dynamics of ‘small-world’ networks
• Exploring complex networks

This page was built for publication: Unravelling small world networks