English
Related papers

Related papers: Gaskets of $O(2)$ loop-decorated random planar map…

200 papers

We consider the robust chromatic number $\chi_1(G)$ of planar graphs $G$ and show that there exists an infinite family of planar graphs $G$ with $\chi_1(G) = 3$, thus solving a recent problem of Bacs\'{o}~et~al. (The robust chromatic number…

Combinatorics · Mathematics 2024-12-24 František Kardoš , Borut Lužar , Roman Soták

We derive the exact critical line of the O($n$) loop model on the martini lattice as a function of the loop weight $n$.A finite-size scaling analysis based on transfer matrix calculations is also performed.The numerical results coincide…

Statistical Mechanics · Physics 2012-07-20 Chengxiang Ding , Zhe Fu , Wenan Guo

We prove that infinitely renormalizable contracting Lorenz maps with bounded geometry or the so-called {\it a priori bounds} satisfies the slow recurrence condition to the singular point $c$ at its two critical values $c_1^-$ and $c_1^+$.…

Dynamical Systems · Mathematics 2025-07-25 Haoyang Ji , Qihan Wang

In this paper, we study intermittent behaviors of coupled piecewise-expanding map lattices with two nodes and a weak coupling. We show that the successive phase transition between ordered and disordered phases occurs for almost every orbit.…

Dynamical Systems · Mathematics 2017-11-07 Tiexiang Li , Wen-wei Lin , Yiqian Wang , Shing-Tung Yau

For non-negative integers $(d_n(k))_{k \ge 1}$ such that $\sum_{k \ge 1} d_n(k) = n$, we sample a bipartite planar map with $n$ faces uniformly at random amongst those which have $d_n(k)$ faces of degree $2k$ for every $k \ge 1$ and we…

Probability · Mathematics 2020-07-20 Cyril Marzouk

We construct a holographic map from the loop equation of large-N QCD in d=2 and d=4, for planar self-avoiding loops, to the critical equation of an equivalent effective action. The holographic map is based on two ingredients: an already…

High Energy Physics - Theory · Physics 2009-11-11 Marco Bochicchio

We consider a one-parameter family of invertible maps of a two-dimensional lattice, obtained by applying round-off to planar rotations. All orbits of these maps are conjectured to be periodic. We let the angle of rotation approach pi/2, and…

Dynamical Systems · Mathematics 2014-06-02 Heather Reeve-Black

We describe random loop models and their relations to a family of quantum spin systems on finite graphs. The family includes spin 1/2 Heisenberg models with possibly anisotropic spin interactions and certain spin 1 models with…

Mathematical Physics · Physics 2013-08-23 Daniel Ueltschi

In this paper we consider random dynamical systems formed by concatenating maps acting on the unit interval $[0,1]$ in an iid fashion. Considered as a stationary Markov process, the random dynamical system possesses a unique stationary…

Dynamical Systems · Mathematics 2024-11-20 Romain Aimino , Matthew Nicol , Andrew Török

For any constants $d\ge 1$, $\epsilon >0$, $t>1$, and any $n$-point set $P\subset\mathbb{R}^d$, we show that there is a geometric graph $G=(P,E)$ having $O(n\log^2 n\log\log n)$ edges with the following property: For any $F\subseteq P$,…

Computational Geometry · Computer Science 2019-01-08 Prosenjit Bose , Paz Carmi , Vida Dujmovic , Pat Morin

We discuss duality properties of critical Boltzmann planar maps such that the degree of a typical face is in the domain of attraction of a stable distribution with parameter $\alpha\in(1,2]$. We consider the critical Bernoulli bond…

Probability · Mathematics 2018-02-07 Nicolas Curien , Loïc Richier

By means of numerical simulations we investigate the configurational properties of densely and fully packed configurations of loops in the negative-weight percolation (NWP) model. In the presented study we consider 2d square, 2d honeycomb,…

Disordered Systems and Neural Networks · Physics 2015-05-19 O. Melchert , A. K. Hartmann

We show that the strongly regular graph on non-isotropic points of one type of the polar spaces of type $U(n, 2)$, $O(n, 3)$, $O(n, 5)$, $O^+(n, 3)$, and $O^-(n, 3)$ are not determined by its parameters for $n \geq 6$. We prove this by…

Combinatorics · Mathematics 2019-07-16 Ferdinand Ihringer , Akihiro Munemasa

This continues the investigation of a combinatorial model for the variation of dynamics in the family of rational maps of degree two, by concentrating on those varieties in which one critical point is periodic. We prove some general results…

Dynamical Systems · Mathematics 2009-09-25 Mary Rees

The purpose of this paper is to study the limiting distribution of special {\it additive functionals} on random planar maps, namely the number of occurrences of a given {\it pattern}. The main result is a central limit theorem for these…

Combinatorics · Mathematics 2024-06-11 Michael Drmota , Eva-Maria Hainzl , Nick Wormald

We study the multicritical behavior arising from the competition of two distinct types of ordering characterized by O(n) symmetries. For this purpose, we consider the renormalization-group flow for the most general $O(n_1)\oplus…

Statistical Mechanics · Physics 2009-11-07 Pasquale Calabrese , Andrea Pelissetto , Ettore Vicari

The effectiveness of the perturbative renormalization group approach at fixed space dimension d in the theory of critical phenomena is analyzed. Three models are considered: the O(N) model, the cubic model and the antiferromagnetic model…

Statistical Mechanics · Physics 2011-12-30 B. Delamotte , M. Dudka , Yu. Holovatch , D. Mouhanna

We consider the population of critical points generated from the critical point of the master function with no variables, which is associated with the trivial representation of the twisted affine Lie algebra $A^{(2)}_{2n}$. The population…

Algebraic Geometry · Mathematics 2017-02-22 Alexander Varchenko , Tyler Woodruff

In this article, we study orientably-regular maps of Euler characteristic $-2p^2$ and classify those that admit a group of orientation-preserving automorphisms of order $10p^2$, where $p$ is a prime number. Along the way, we classify all…

Combinatorics · Mathematics 2026-04-06 Tomás Foncea E. , Sebastián Reyes-Carocca

We discuss the problem of embedding graphs in the plane with restrictions on the vertex mapping. In particular, we introduce a technique for drawing planar graphs with a fixed vertex mapping that bounds the number of times edges bend. An…

Computational Geometry · Computer Science 2012-06-05 Taylor Gordon
‹ Prev 1 4 5 6 7 8 10 Next ›