English
Related papers

Related papers: Loop statistics in the toroidal honeycomb dimer mo…

200 papers

The behavior of a family of dissipative dynamical systems representing transformations of two-dimensional torus is studied on a discrete lattice and compared with that of conservative hyperbolic automorphisms of the torus. Applying…

Computational Physics · Physics 2011-06-21 L. Yu. Barash

This article deals with limit theorems for certain loop variables for loop soups whose intensity approaches infinity. We first consider random walk loop soups on finite graphs and obtain a central limit theorem when the loop variable is the…

Probability · Mathematics 2020-02-04 Federico Camia , Yves Le Jan , Tulasi Ram Reddy

The dimer model is a classical statistical mechanics model which is exactly solvable in two dimensions, but about which little is known in higher dimensions. In analogy with large $N$ limits in lattice gauge theory, we study a large $N$…

Probability · Mathematics 2026-02-23 Richard Kenyon , Catherine Wolfram

The second part of the paper is devoted to enumeration of $r$-regular toroidal maps up to all homeomorphisms of the torus (unsensed maps). We describe in detail the periodic orientation reversing homeomorphisms of the torus which turn out…

Combinatorics · Mathematics 2017-09-12 Evgeniy Krasko , Alexander Omelchenko

Perturbations due to round-off errors in computer modeling are discontinuous and therefore one cannot use results like KAM theory about smooth perturbations of twist maps. We elaborate a special approximation scheme to construct two smooth…

chao-dyn · Physics 2008-02-03 M. Blank , T. Kruger , L. Pustyl'nikov

Extending a proposal of Defant and Kravitz [Discrete Mathematics, \textbf{1}, 347 (2024)], we define Hitomezashi patterns and loops on a torus and provide several structural results for such loops. For a given pattern, our main theorems…

Combinatorics · Mathematics 2024-01-17 Qiuyu Ren , Shengtong Zhang

We present a general result which shows that the winding of the branches in a uniform spanning tree on a planar graph converge in the limit of fine mesh size to a Gaussian free field. The result holds true assuming only convergence of…

Probability · Mathematics 2018-11-28 Nathanaël Berestycki , Benoit Laslier , Gourab Ray

In this note, we give a closed formula for the partition function of the dimer model living on a (2 x n) strip of squares or hexagons on the torus for arbitrary even n. The result is derived in two ways, by using a Potts model like…

Combinatorics · Mathematics 2007-09-12 D. Orlando , S. Reffert

The rotor-router model on a graph describes a discrete-time walk accompanied by the deterministic evolution of configurations of rotors randomly placed on vertices of the graph. We prove the following property: if at some moment of time,…

Mathematical Physics · Physics 2016-02-25 Vl. V. Papoyan , V. S. Poghosyan , V. B. Priezzhev

We consider self-loops and multiple edges in the configuration model as the size of the graph tends to infinity. The interest in these random variables is due to the fact that the configuration model, conditioned on being simple, is a…

Probability · Mathematics 2017-02-06 Omer Angel , Remco van der Hofstad , Cecilia Holmgren

We study the problem HomsTo$H$ of counting, modulo 2, the homomorphisms from an input graph to a fixed undirected graph $H$. A characteristic feature of modular counting is that cancellations make wider classes of instances tractable than…

Computational Complexity · Computer Science 2015-08-27 Andreas Göbel , Leslie Ann Goldberg , David Richerby

In this paper we complete the study of the phase diagram and conformational states of a stiff homopolymer. It is known that folding of a sufficiently stiff chain results in formation of a torus. We find that the phase diagram obtained from…

Soft Condensed Matter · Physics 2009-10-31 Yu. A. Kuznetsov , E. G. Timoshenko

We consider the disordered monomer-dimer model on cylinder graphs $\mathcal{G}_n$, i.e., graphs given by the Cartesian product of the line graph on $n$ vertices, and a deterministic graph. The edges carry i.i.d. random weights, and the…

Probability · Mathematics 2024-06-21 Partha S. Dey , Kesav Krishnan

We investigate bifurcation of closed orbits with a fixed energy level for a class of nearly integrable Hamiltonian systems with two degrees of freedom. More precisely, we make a joint use of Moser invariant curve theorem and…

Dynamical Systems · Mathematics 2023-10-05 Alberto Boscaggin , Walter Dambrosio , Guglielmo Feltrin

Dimer coverings (or perfect matchings) of a finite graph are classical objects of graph theory appearing in the study of exactly solvable models of statistical mechanics. We introduce more general dimer labelings which form a topological…

Geometric Topology · Mathematics 2012-11-30 Vladimir Turaev

We consider a random dynamical system obtained by switching between the flows generated by two smooth vector fields on the 2d-torus, with the random switchings happening according to a Poisson process. Assuming that the driving vector…

Dynamical Systems · Mathematics 2018-03-22 Yuri Bakhtin , Tobias Hurth , Sean D. Lawley , Jonathan C. Mattingly

In the dimer model, a configuration consists of a perfect matching of a fixed graph. If the underlying graph is planar and bipartite, such a configuration is associated to a height function. For appropriate "critical" (weighted) graphs,…

Probability · Mathematics 2014-07-24 Julien Dubédat

The category of exploded torus fibrations is an extension of the category of smooth manifolds in which some adiabatic limits look smooth. (For example, the limits considered in tropical geometry appear smooth, also degenerations…

Symplectic Geometry · Mathematics 2008-01-14 Brett Parker

We investigate the effects of non-commutative geometry on the topological aspects of gauge theory using a non-perturbative formulation based on the twisted reduced model. The configuration space is decomposed into topological sectors…

High Energy Physics - Theory · Physics 2011-07-19 Hajime Aoki , Jun Nishimura , Yoshiaki Susaki

The XOR-Ising model on a graph consists of random spin configurations on vertices of the graph obtained by taking the product at each vertex of the spins of two independent Ising models. In this paper, we explicitly relate loop…

Probability · Mathematics 2014-09-05 Cédric Boutillier , Béatrice de Tilière