相关论文: Absence of zeros implies strong spatial mixing
We propose a distribution-free approach to the study of random geometric graphs. The distribution of vertices follows a Poisson point process with intensity function $nf(\cdot)$, where $n\in \mathbb{N}$, and $f$ is a probability density…
Livine and Bonzom recently proposed a geometric formula for a certain set of complex zeros of the partition function of the Ising model defined on planar graphs. Remarkably, the zeros depend locally on the geometry of an immersion of the…
Graph homomorphism has been studied intensively. Given an m x m symmetric matrix A, the graph homomorphism function is defined as \[Z_A (G) = \sum_{f:V->[m]} \prod_{(u,v)\in E} A_{f(u),f(v)}, \] where G = (V,E) is any undirected graph. The…
We initiate the study of distribution testing for probability distributions over the edges of a graph, motivated by the closely related question of ``edge-distribution-free'' graph property testing. The main results of this paper are…
We consider properties of edge-colored vertex-ordered graphs, i.e., graphs with a totally ordered vertex set and a finite set of possible edge colors. We show that any hereditary property of such graphs is strongly testable, i.e., testable…
We first consider the class K of graphs on a zero-dimensional metrizable compact space with continuous chromatic number at least three. We provide a concrete basis of size continuum for K made up of countable graphs, comparing them with the…
We classify the resolution graphs of weighted homogeneous surface singularities which admit rational homology disk smoothings. The nonexistence of rational homology disk smoothings is shown by symplectic geometric methods, while the…
For a graph $G$ and a set of graphs $\mathcal{H}$, we say that $G$ is {\em $\mathcal{H}$-free} if no induced subgraph of $G$ is isomorphic to a member of $\mathcal{H}$. Given an integer $P>0$, a graph $G$, and a set of graphs $\mathcal{F}$,…
We show fully polynomial time randomized approximation schemes (FPRAS) for counting matchings of a given size, or more generally sampling/counting monomer-dimer systems in planar, not-necessarily-bipartite, graphs. While perfect matchings…
We develop a theory of \emph{sharp measure zero} sets that parallels Borel's \emph{strong measure zero}, and prove a theorem analogous to Galvin-Myscielski-Solovay Theorem, namely that a set of reals has sharp measure zero if and only if it…
We study asymptotic distribution of zeros of random holomorphic sections of high powers of positive line bundles defined over projective homogenous manifolds. We work with a wide class of distributions that includes real and complex…
A large driver of the complexity of graph learning is the interplay between structure and features. When analyzing the expressivity of graph neural networks, however, existing approaches ignore features in favor of structure, making it…
We describe a method for generating graphs that provide difficult examples for practical Graph Isomorphism testers. We first give the theoretical construction, showing that we can have a family of graphs without any non-trivial…
Graded rings provide a natural algebraic framework for encoding symmetry via decompositions into homogeneous components indexed by a group, together with multiplication rules reflecting the group operation. Among graded rings, strongly…
We consider the problem of detecting sparse heterogeneous mixtures from a nonparametric perspective, and develop distribution-free tests when all effects have the same sign. Specifically, we assume that the null distribution is symmetric…
In this paper, we characterize chordal and perfect zero-divisor graphs of finite posets. Also, it is proved that the zero-divisor graphs of finite posets and the complement of zero-divisor graphs of finite $0$-distributive posets satisfy…
We explore the dynamics of graph maps with zero topological entropy. It is shown that a continuous map $f$ on a topological graph $G$ has zero topological entropy if and only if it is locally mean equicontinuous, that is the dynamics on…
For graphs $G$ and $H$, a \emph{homomorphism} from $G$ to $H$ is an edge-preserving mapping from the vertex set of $G$ to the vertex set of $H$. For a fixed graph $H$, by \textsc{Hom($H$)} we denote the computational problem which asks…
A \emph{unichord} in a graph is an edge that is the unique chord of a cycle. A \emph{square} is an induced cycle on four vertices. A graph is \emph{unichord-free} if none of its edges is a unichord. We give a slight restatement of a known…
We relate the structure factor $S(\mathbf{k} \to \mathbf{0})$ in a system of jammed hard spheres of number density $\rho$ to its complexity per particle $\Sigma(\rho)$ by the formula $S(\mathbf{k} \to \mathbf{0})=-1/…