Greedy pathlengths and small world graphs

DOI10.1016/j.laa.2006.01.001zbMath1095.68083OpenAlexW2008395946MaRDI QIDQ2496645

Desmond J. Higham

Publication date: 20 July 2006

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2006.01.001

zbMATH Keywords

continuum limitgreedy algorithmdifferential equationMarkov chainfinite differencemean hitting timesmall world phenomenon

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10) Numerical methods for initial value problems involving ordinary differential equations (65L05)

Related Items (3)

Centrality Analysis for Modified Lattices ⋮ Unravelling small world networks ⋮ Average case analysis of the Markov chain small-world model

Cites Work

• Small-world characteristics of internet topologies and implications on multicast scaling
• Small worlds
• Solving Ordinary Differential Equations I
• The small-world phenomenon
• The Diameter of a Cycle Plus a Random Matching
• Markov Chains
• RELEVANT CYCLES IN CHEMICAL REACTION NETWORKS
• The Structure and Function of Complex Networks
• A Matrix Perturbation View of the Small World Phenomenon
• Packet delay in models of data networks
• Collective dynamics of ‘small-world’ networks
• Exploring complex networks

This page was built for publication: Greedy pathlengths and small world graphs