We study the classical $XY$-model on random geometric graphs $\mathcal{G}_{n, \varepsilon}$, which are obtained by sampling $n \in \mathbb{N}$ independent points in a finite domain $\Omega \subset \mathbb{R}^d$, $d \geq 2$, and connecting two points by and edge if their distance is of order $\varepsilon>0$. We refer to $\mathcal{G}_{n, \varepsilon}$ as the random environment. Letting $\varepsilon \to 0$ as $n \to \infty$ at a sufficiently slow rate, these graphs capture the geometry of $\Omega$. Denoting the inverse temperature by $\beta$, we show that in the limit $\beta \to \infty$ at a rate depending on $n$ and $\varepsilon$, the $XY$-model on $\mathcal{G}_{n, \varepsilon}$ exhibits long range order in the sense that we prove a lower bound away from zero on the two-point function. Our result is quenched in the random environment: long-range order holds with large probability, converging to one as $n \to \infty$. To prove the statement, we show that with high probability the environment is sufficiently regular to apply a convexity argument and the Brascamp--Lieb inequality.
Let $r\geq3$ be fixed, and let $\mathbf{G}_n$ be the set of all simple graphs with vertex set $[n]=\{1,\ldots,n\}$. We consider an exponential random graph model which gives higher probability to $G \in \mathbf{G}_n$ than to $H \in \mathbf{G}_n$ if $G$ has fewer $r$-cliques than $H$. But all graphs in $\mathbf{G}_n$ ha...
Let $\lambda_1\geq\lambda_2\geq\cdots\geq\lambda_n$ be the eigenvalues of a simple graph $G$ of order $n$. The HL-index of $G$ is defined by $R(G)=\max\|\lambda_h|,|\lambda_\ell|\}$ with $h=\lfloor(n+1)/2\rfloor$ and $\ell=\lceil(n+1)/2\rceil$.In this paper, we prove that if $G$ is $ K_4$-minor-free or $ K _ {2,3} $-mi...
Let $G$ be a graph together with a total order $\prec$ on its edges. We say that $\prec$ is realizable in $\mathbb{R}^d$ if there is a placement of the vertices of $G$ in $\mathbb{R}^d$ such that the Euclidean lengths of the edges induce exactly the order $\prec$. Almendra-Hern\'andez and Mart\'inez-Sandoval proved tha...
Gerardo L. Maldonado, Leonardo Martínez-Sandoval, Miguel Raggi et al.· 0 citations
Let $d,K,N\in \mathbb{N}$ with $K\geq 3$ and $d\geq 4K+4$. Let $\Delta\subset \mathbb{Z}^d$ be the vertex set of a nondegenerate $(K-1)$-simplex, and let $A\subseteq[N]^d$ contain no nontrivial similar copy of $\Delta$. We prove that \[ |A|\ll_{\Delta,d} N^d\exp\!\left(-c_{\Delta,d}\sqrt{\log N}\right) \] improving upo...
Andrew Lott, Á. Magyar, N. R. Ponagandla· 0 citations
For graphs $G$ and $H$, let $\mathbf N(G,H)$ denote the number of unlabeled, not necessarily induced copies of $H$ in $G$, and let $\mathbf N_{\mathcal P}(n,H)$ be the maximum of $\mathbf N(G,H)$ over all $n$-vertex planar graphs $G$. We prove that, for every fixed integer $m\geq 3$, $$\mathbf N_{\mathcal P}(n,C_{2m+1}...
For a graph $H$ and a family of graphs $\mathcal F$, let $\text{ex}(n,H,\mathcal F)$ denote the maximum number of copies of $H$ in an $\mathcal F$-free graph on $n$ vertices. For every integer $i\ge 3$, let $C_i$ denote the cycle of length $i$. For $r\ge 3$, set $\mathscr {C}_r=\{C_3,C_4,\ldots,C_r\},$ and set $\mathsc...
Zhen Liu, Chuan-Shu Wu· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
