English
Related papers

Related papers: Two-dimensional interacting self-avoiding walks: n…

200 papers

Motivated by the recent synthesis of two insulating Li$_2$IrO$_3$ polymorphs, where Ir$^{4+}$ $S_{eff}$=1/2 moments form 3D ("harmonic") honeycomb structures with threefold coordination, we study magnetic Hamiltonians on the resulting…

Strongly Correlated Electrons · Physics 2014-11-26 Itamar Kimchi , James G. Analytis , Ashvin Vishwanath

In [BEI] we introduced a Levy process on a hierarchical lattice which is four dimensional, in the sense that the Green's function for the process equals 1/x^2. If the process is modified so as to be weakly self-repelling, it was shown that…

Mathematical Physics · Physics 2007-05-23 David C. Brydges , John Z. Imbrie

Phase transitions in the Hubbard model and ionic Hubbard model at half-filling on the honeycomb lattice are investigated in the strong coupling perturbation theory which corresponds to an expansion in powers of the hopping $t$ around the…

Strongly Correlated Electrons · Physics 2016-02-12 E. Adibi , S. A. Jafari

We study the two-point functions of a general class of random-length random walks on finite boxes in $\ZZ^d$ with $d\ge3$, and provide precise asymptotics for their behaviour. We show that the finite-box two-point function is asymptotic to…

Mathematical Physics · Physics 2023-10-11 Youjin Deng , Timothy M. Garoni , Jens Grimm , Zongzheng Zhou

We consider long-range percolation, Ising model, and self-avoiding walk on $\mathbb{Z}^d$, with couplings decaying like $|x|^{-(d+\alpha)}$ where $0 < \alpha \le 2$, above the upper critical dimensions. In the spread-out setting where the…

Probability · Mathematics 2025-12-23 Yucheng Liu

Counting the number of N-step self-avoiding walks (SAWs) on a lattice is one of the most difficult problems of enumerative combinatorics. Once we give up calculating the exact number of them, however, we have a chance to apply powerful…

Statistical Mechanics · Physics 2013-10-04 Nobu C. Shirai , Macoto Kikuchi

We consider a random walk on a supercritical Galton-Watson tree with leaves, where the transition probabilities of the walk are determined by biases that are randomly assigned to the edges of the tree. The biases are chosen independently on…

Probability · Mathematics 2012-05-03 Alan Hammond

We study self-avoiding walk on graphs whose automorphism group has a transitive nonunimodular subgroup. We prove that self-avoiding walk is ballistic, that the bubble diagram converges at criticality, and that the critical two-point…

Probability · Mathematics 2018-11-15 Tom Hutchcroft

We study the phase transitions of the frustrated $J_1$-$J_2$ Ising model on the honeycomb lattice using the non-perturbative first principle Monte Carlo simulations. Here $J_1 < 0$ and $J_2 > 0$ are the nearest and next-to-nearest…

High Energy Physics - Lattice · Physics 2025-09-16 Shang-Wei Li , Yuan-Heng Tseng , Fu-Jiun Jiang

Phase transitions are a central theme of statistical mechanics, and of probability more generally. Lattice spin models represent a general paradigm for phase transitions in finite dimensions, describing ferromagnets and even some fluids…

Probability · Mathematics 2017-07-04 Hugo Duminil-Copin

We study the recurrence behaviour of random walks on partially oriented honeycomb lattices. The vertical edges are undirected while the orientation of the horizontal edges is random: depending on their distribution, we prove a.s. transience…

Probability · Mathematics 2019-03-13 Gianluca Bosi , Massimo Campanino

A previous paper (hep-lat/9311011) proposed a new kind of random walk on a spherically-symmetric lattice in arbitrary noninteger dimension $D$. Such a lattice avoids the problems associated with a hypercubic lattice in noninteger dimension.…

High Energy Physics - Lattice · Physics 2009-10-22 C. M. Bender , S. Boettcher , M. Moshe

Various Monte Carlo techniques are used to determine the complete phase diagrams of the square well model for the attractive ranges $\lambda = 1.15$ and $\lambda = 1.25$. The results for the latter case are in agreement with earlier Monte…

Statistical Mechanics · Physics 2009-11-10 D. L. Pagan , J. D. Gunton

We study self-avoiding walks on the square lattice restricted to a square box of side $L$ weighted by a length fugacity without restriction of their end points. This models a confined polymer in dilute solution. The model admits a phase…

Statistical Mechanics · Physics 2022-07-22 C. J. Bradly , A. L. Owczarek

We demonstrate that the recently proposed Interacting Growth Walk (cond-mat/0108097) does not have the contact-scaling behaviour of Self-Avoiding Walk (M. Baiesi, E. Orlandini and A. L. Stella, Phys. Rev. Lett. 87, 070602 (2001)) at finite…

Condensed Matter · Physics 2007-05-23 S. L. Narasimhan , P. S. R. Krishna , K. P. N. Murthy , M. Ramanadham

We study by computer simulation a recently introduced generalised model of self-interacting self-avoiding trails on the square lattice that distinguishes two topologically different types of self-interaction: namely crossings where the…

Statistical Mechanics · Physics 2013-02-01 A. Bedini , A. L. Owczarek , T. Prellberg

We consider the biased random walk on a tree constructed from the set of finite self-avoiding walks on a lattice, and use it to construct probability measures on infinite self-avoiding walks. The limit measure (if it exists) obtained when…

Probability · Mathematics 2019-12-25 Vincent Beffara , Cong Bang Huynh

For any integers $k\geq 2$, $q\geq 1$ and any finite set $\mathcal{A}=\{{\boldsymbol{\alpha}}_1,\cdots,{\boldsymbol{\alpha}}_q\}$, where ${ \boldsymbol{\alpha}_t}=(\alpha_{t,1},\cdots,\alpha_{t,k})~(1\leq t\leq q)$ with…

Number Theory · Mathematics 2022-10-17 Kui Liu , Meijie Lu , Xianchang Meng

Transfer-matrix methods, with the help of finite-size scaling and conformal invariance concepts, are used to investigate the critical behavior of two-dimensional square-lattice Ising spin-1/2 systems with first- and second-neighbor…

Statistical Mechanics · Physics 2011-10-03 S. L. A. de Queiroz

Several kinds of walks on complex networks are currently used to analyze search and navigation in different systems. Many analytical and computational results are known for random walks on such networks. Self-avoiding walks (SAWs) are…

Disordered Systems and Neural Networks · Physics 2009-11-10 Carlos P. Herrero
‹ Prev 1 8 9 10 Next ›