21 citations · 114 across the 18 of their papers we have counts for
19 papers
Efficient computations of continuous action densities of states for lattice models
Biagio Lucini, Olmo Francesconi, Markus Holzmann +2
The Logarithmic Linear Relaxation (LLR) algorithm is an efficient method for computing densities of states for systems with a continuous spectrum. A key feature of this method is e…
Ergodic sampling of the topological charge using the density of states
Guido Cossu, David Lancaster, Biagio Lucini +2
In lattice calculations, the approach to the continuum limit is hindered by the severe freezing of the topological charge, which prevents ergodic sampling in configuration space. I…
Random Walks between Leaves of Random Networks
David Lancaster
We consider random walks that start and are absorbed on the leaves of random networks and study the length of such walks. For the networks we investigate, Erdos-Renyi random graphs…
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…
Fluctuations in the Site Disordered Traveling Salesman Problem
David S. Dean, David Lancaster
We extend a previous statistical mechanical treatment of the traveling salesman problem by defining a discrete "site disordered'' problem in which fluctuations about saddle points…
The Centred Traveling Salesman at Finite Temperature
David Lancaster
A recently formulated statistical mechanics method is used to study the phase transition occurring in a generalisation of the Traveling Salesman Problem (TSP) known as the centred…