2 research outputs found
The statistical mechanics of combinatorial optimization problems with site disorder
We study the statistical mechanics of a class of problems whose phase space
is the set of permutations of an ensemble of quenched random positions.
Specific examples analyzed are the finite temperature traveling salesman
problem on several different domains and various problems in one dimension such
as the so called descent problem. We first motivate our method by analyzing
these problems using the annealed approximation, then the limit of a large
number of points we develop a formalism to carry out the quenched calculation.
This formalism does not require the replica method and its predictions are
found to agree with Monte Carlo simulations. In addition our method reproduces
an exact mathematical result for the Maximum traveling salesman problem in two
dimensions and suggests its generalization to higher dimensions. The general
approach may provide an alternative method to study certain systems with
quenched disorder.Comment: 21 pages RevTex, 8 figure
Hamiltonian walks on Sierpinski and n-simplex fractals
We study Hamiltonian walks (HWs) on Sierpinski and --simplex fractals. Via
numerical analysis of exact recursion relations for the number of HWs we
calculate the connectivity constant and find the asymptotic behaviour
of the number of HWs. Depending on whether or not the polymer collapse
transition is possible on a studied lattice, different scaling relations for
the number of HWs are obtained. These relations are in general different from
the well-known form characteristic of homogeneous lattices which has thus far
been assumed to hold for fractal lattices too.Comment: 22 pages, 6 figures; final versio