相关论文: The Yang Lee Edge Singularity on Feynman Diagrams

We consider an inhomogeneous Erd\H{o}s-R\'enyi random graph ensemble with exponentially decaying random disconnection probabilities determined by an i.i.d. field of variables with heavy tails and infinite mean associated to the vertices of…

The problem of detecting edge correlation between two Erd\H{o}s-R\'enyi random graphs on $n$ unlabeled nodes can be formulated as a hypothesis testing problem: under the null hypothesis, the two graphs are sampled independently; under the…

In this paper, we derive decay estimates near isolated singularities of 3-dimensional (3d) Yang-Mills-Higgs fields defined on a fiber bundle, where the fiber space is a compact Riemannian manifold and the structure group is a connected…

We study the uniqueness of solutions to a class of heat equations with positive density posed on infinite weighted graphs. We separately consider the case when the density is bounded from below by a positive constant and the case of…

We investigate the ferromagnetic Ising model on the Erd\H{o}s-R\'enyi random graph $\mathbb{G}(n,m)$ with bounded average degree $d=2m/n$. Specifically, we determine the limiting distribution of $\log Z_{\mathbb{G}(n,m)}(\beta,B)$, where…

For a family $\mathcal{F}$ of graphs, let $ex(n,\mathcal{F})$ denote the maximum number of edges in an $n$-vertex graph which contains none of the members of $\mathcal{F}$ as a subgraph. A longstanding problem in extremal graph theory asks…

In this short note, we prove the uniqueness of exterior differentiation on locally finite graphs.

We show a direct matching between individual Feynman diagrams and integration measures in the scattering equation formalism of Cachazo, He and Yuan. The connection is most easily explained in terms of triangular graphs associated with…

We simulate the Ising model on a set of fixed random $\phi^3$ graphs, which corresponds to a {\it quenched} coupling to 2D gravity rather than the annealed coupling that is usually considered. We investigate the critical exponents in such a…

We study the dimer model on the square grid, with quenched random edge weights. Randomness is chosen to have a layered structure, similar to that of the celebrated McCoy-Wu disordered Ising model. Disorder has a highly non-trivial effect…

We quantize the regularity properties of classical graphs that determine spin models for singly-generated Yang-Baxter planar algebras, including the Kauffman polynomial, and construct explicit examples. A source of examples comes from…

We study homological properties of random quadratic monomial ideals in a polynomial ring $R = {\mathbb K}[x_1, \dots x_n]$, utilizing methods from the Erd\"{o}s-R\'{e}nyi model of random graphs. Here for a graph $G \sim G(n, p)$ we consider…

We present a method for computing the framing on the cohomology of graph hypersurfaces defined by the Feynman differential form. This answers a question of Bloch, Esnault and Kreimer in the affirmative for an infinite class of graphs for…

We study a recent model for edge exchangeable random graphs introduced by Crane and Dempsey; in particular we study asymptotic properties of the random simple graph obtained by merging multiple edges. We study a number of examples, and show…

We introduce the Density Formula for (topological) drawings of graphs in the plane or on the sphere, which relates the number of edges, vertices, crossings, and sizes of cells in the drawing. We demonstrate its capability by providing…

We define supersymmetric Yang-Mills theory on an arbitrary two-dimensional lattice (polygon decomposition) with preserving one supercharge. When a smooth Riemann surface $\Sigma_g$ with genus $g$ emerges as an appropriate continuum limit of…

We study the uniqueness question for two inverse problems on graphs. Both problems consist in finding (possibly complex) edge or nodal based quantities from boundary measurements of solutions to the Dirichlet problem associated with a…

Rank 1 inhomogeneous random graphs are a natural generalization of Erd\H{o}s R\'enyi random graphs. In this generalization each node is given a weight. Then the probability that an edge is present depends on the product of the weights of…

We prove a hardness of sampling result for the anti-ferromagnetic Ising model on random graphs of average degree $d$ for large constant $d$, proving that when the normalized inverse temperature satisfies $\beta>1$ (asymptotically…

We provide a simple characterization of the critical temperature for the Ising model on an arbitrary planar doubly periodic weighted graph. More precisely, the critical inverse temperature \beta for a graph G with coupling constants…