Unravelling small world networks

DOI10.1016/S0377-0427(03)00471-0zbMATH Open1028.65034MaRDI QIDQ1408397FDOQ1408397

Authors: Desmond J. Higham 

Publication date: 15 September 2003

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

Recommendations

• Spectral reordering of a range-dependent weighted random graph
• Periodic reordering
• scientific article; zbMATH DE number 1950482
• A Matrix Perturbation View of the Small World Phenomenon
• Small-world graphs: characterization and alternative constructions

zbMATH Keywords

inverse problemnumerical resultsLaplacianMaximum likelihoodRandom graphAdjacency matrixBandwidthSparse matrixBioinformaticsMinimum degreeCuthill-McKeeEnvelopeGenome datasetsProteome networksReorderingSmall world phenomenonTwo-sumworld reordering problem

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Collective dynamics of `small-world' networks
• Exploring complex networks
• Small worlds
• The structure of scientific collaboration networks
• Title not available (Why is that?)
• RELEVANT CYCLES IN CHEMICAL REACTION NETWORKS
• A spectral algorithm for envelope reduction of sparse matrices
• Two improved algorithms for envelope and wavefront reduction
• A Matrix Perturbation View of the Small World Phenomenon
• An improved spectral bisection algorithm and its application to dynamic load balancing
• An Analysis of Spectral Envelope Reduction via Quadratic Assignment Problems
• Greedy pathlengths and small world graphs

Cited In (8)

• Metaheuristic algorithms for the bandwidth reduction of large-scale matrices
• Mathematical programming models for some smallest-world problems
• A variable neighborhood search and simulated annealing hybrid for the profile minimization problem
• SMALL-WORLD EFFECT IN GEOGRAPHICAL ATTACHMENT NETWORKS
• Periodic reordering
• A hypergraph partitioning model for profile minimization
• Assessing experimentally derived interactions in a small world
• Spectral reordering of a range-dependent weighted random graph

This page was built for publication: Unravelling small world networks

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