English
Related papers

Related papers: Macroscopic loops in the loop O(n) model via the X…

200 papers

Certain models with rank-$3$ tensor degrees of freedom have been shown by Gurau and collaborators to possess a novel large $N$ limit, where $g^2 N^3$ is held fixed. In this limit the perturbative expansion in the quartic coupling constant,…

High Energy Physics - Theory · Physics 2017-02-22 Igor R. Klebanov , Grigory Tarnopolsky

We define a new large $N$ limit for general $\text{O}(N)^{R}$ or $\text{U}(N)^{R}$ invariant tensor models, based on an enhanced large $N$ scaling of the coupling constants. The resulting large $N$ expansion is organized in terms of a…

High Energy Physics - Theory · Physics 2019-04-23 Frank Ferrari , Vincent Rivasseau , Guillaume Valette

We obtain exact densities of contractible and non-contractible loops in the O(1) model on a strip of the square lattice rolled into an infinite cylinder of finite even circumference $L$. They are also equal to the densities of critical…

Mathematical Physics · Physics 2021-04-14 A. M. Povolotsky

In a seminal paper on finding large matchings in sparse random graphs, Karp and Sipser proposed two algorithms for this task. The second algorithm has been intensely studied, but due to technical difficulties, the first algorithm has…

Combinatorics · Mathematics 2018-11-14 Michael Anastos , Alan Frieze

Conjectures for analytical expressions for correlations in the dense O$(1)$ loop model on semi infinite square lattices are given. We have obtained these results for four types of boundary conditions. Periodic and reflecting boundary…

Statistical Mechanics · Physics 2009-11-10 S. Mitra , B. Nienhuis , J. de Gier , M. T. Batchelor

Let $M_n$ be the topological moduli space of all parallel n-cables of long framed oriented knots in 3-space. We construct in a combinatorial way for each natural number $n>1$ a 1-cocycle $R_n$ which represents a non trivial class in…

Geometric Topology · Mathematics 2019-01-17 Thomas Fiedler

Using localization, matrix model and saddle-point techniques, we determine exact behavior of circular Wilson loop in N=2 superconformal (quiver) gauge theories. Focusing at planar and large `t Hooft couling limits, we compare its asymptotic…

High Energy Physics - Theory · Physics 2011-02-02 Soo-Jong Rey , Takao Suyama

In the nonlinear O(N) sigma model at N=3 unexpected cutoff effects have been found before with standard discretizations and lattice spacings. Here the situation is analyzed further employing additional data for the step scaling function of…

High Energy Physics - Lattice · Physics 2009-11-11 Francesco Knechtli , Bjoern Leder , Ulli Wolff

We use localization techniques to compute the expectation values of supersymmetric Wilson loops in Chern-Simons theories with matter. We find the path-integral reduces to a non-Gaussian matrix model. The Wilson loops we consider preserve a…

High Energy Physics - Theory · Physics 2010-12-21 Anton Kapustin , Brian Willett , Itamar Yaakov

We consider uniform random permutations of length $n$ conditioned to have no cycle longer than $n^\beta$ with $0<\beta<1$, in the limit of large $n$. Since in unconstrained uniform random permutations most of the indices are in cycles of…

Probability · Mathematics 2018-12-21 Volker Betz , Helge Schäfer , Dirk Zeindler

Within the non-perturbative 1/N expansion, we discuss numerical methods for calculating multi-loop Feynman graph needed to derive physical scattering amplitudes. We apply higher order 1/N methods to the scalar sector of the standard model,…

High Energy Physics - Phenomenology · Physics 2009-10-31 A. Ghinculov , T. Binoth

For ${\cal N}=2^*$ theory with $U(N)$ gauge group we evaluate expectation values of Wilson loops in representations described by a rectangular Young tableau with $n$ rows and $k$ columns. The evaluation reduces to a two-matrix model and we…

High Energy Physics - Theory · Physics 2018-02-14 James T. Liu , Leopoldo A. Pando Zayas , Shan Zhou

We derive exact formulas for circular Wilson loops in the $\mathcal{N}=4$ and $\mathcal{N}=2^{* }$ theories with gauge groups $U(N)$ and $SU(N)$ in the $k$-fold symmetrized product representation. The formulas apply in the limit of large…

High Energy Physics - Theory · Physics 2022-09-14 D. Rodriguez-Gomez , J. G. Russo

Perturbative computations of the expectation value of the Wilson loop in N=4 supersymmetric Yang-Mills theory are reported. For the two special cases of a circular loop and a pair of anti-parallel lines, it is shown that the sum of an…

High Energy Physics - Theory · Physics 2009-10-31 J. K. Erickson , G. W. Semenoff , K. Zarembo

Various topics related to the $O(N)$ model in one spacetime dimension (i.e. ordinary quantum mechanics) are considered. The focus is on a pedagogical presentation of quantum field theory methods in a simpler context where many exact results…

High Energy Physics - Theory · Physics 2022-03-22 Daniel Schubring

The O(n) vector model with logarithmic action on a lattice of coordination 3 is related to a gas of self-avoiding loops on the lattice. This formulation allows for analytical continuation in n: critical behaviour is found in the real…

Statistical Mechanics · Physics 2011-02-16 Sergio Caracciolo , Andrea Sportiello

We prove that the density of $\frac{X_1+\cdot\cdot\cdot+X_n-nE[X_1]}{\sqrt{n}}$, where $\{X_n\}_{n\geq 1}$ is a sequence of independent and identically distributed random variables taking values on an abstract Wiener space, converges in…

Probability · Mathematics 2016-07-18 Alberto Lanconelli

We investigate two models in non-commutative (NC) field theory by means of Monte Carlo simulations. Even if we start from the Euclidean lattice formulation, such simulations are only feasible after mapping the systems onto dimensionally…

High Energy Physics - Theory · Physics 2009-11-07 W. Bietenholz , F. Hofheinz , J. Nishimura

The Planar Graph Metric Compression Problem is to compactly encode the distances among $k$ nodes in a planar graph of size $n$. Two na\"ive solutions are to store the graph using $O(n)$ bits, or to explicitly store the distance matrix with…

Data Structures and Algorithms · Computer Science 2017-03-16 Amir Abboud , Pawel Gawrychowski , Shay Mozes , Oren Weimann

We investigate the minimum number of cycles of specified lengths in planar $n$-vertex triangulations $G$. It is proven that this number is $\Omega(n)$ for any cycle length at most $3 + \max \{ {\rm rad}(G^*), \lceil…

Combinatorics · Mathematics 2025-06-13 On-Hei Solomon Lo , Carol T. Zamfirescu