5 search results - page 1 / 1 » Annihilating random walks and perfect matchings of planar gr... |
DRW
2003
13 years 6 months ago
2003
CORR
2008
Springer
13 years 5 months ago
2008
Springer
We present a deterministic way of assigning small (log bit) weights to the edges of a bipartite planar graph so that the minimum weight perfect matching becomes unique. The isolati...
COMBINATORICS
2000
13 years 4 months ago
2000
In this article, Temperley's bijection between spanning trees of the square grid on the one hand, and perfect matchings (also known as dimer coverings) of the square grid on ...
CORR
2011
Springer
12 years 12 months ago
2011
Springer
We describe a new variational lower-bound on the minimum energy configuration of a planar binary Markov Random Field (MRF). Our method is based on adding auxiliary nodes to every...
CPHYSICS
2011
12 years 8 months ago
2011
In the presented article we present an algorithm for the computation of ground state spin configurations for the 2d random bond Ising model on planar triangular lattice graphs. T...