21 citations · 114 across the 18 of their papers we have counts for
Showing cond-mat.stat-mechShow all
3 papers · 1 filter
cond-mat.stat-mech2011
Searching for Nodes in Random Graphs
David Lancaster
We consider the problem of searching for a node on a labelled random graph according to a greedy algorithm that selects a route to the desired node using metric information on the…
cond-mat.stat-mech2003★ 3 cited
Two Combinatorial Models with identical Statics yet different Dynamics
David Lancaster
Motivated by the problem of sorting, we introduce two simple combinatorial models with distinct Hamiltonians yet identical spectra (and hence partition function) and show that the…
cond-mat.stat-mech2001
Cluster Growth in a Growing Tree Network
David Lancaster
We analyze a simple model for growing tree networks and find that although it never percolates, there is an anomalously large cluster at finite size. We study the growth of both th…