English
Related papers

Related papers: Strong spatial mixing in homomorphism spaces

200 papers

We introduce (weak) oddomorphisms of graphs which are homomorphisms with additional constraints based on parity. These maps turn out to have interesting properties (e.g., they preserve planarity), particularly in relation to homomorphism…

Combinatorics · Mathematics 2022-06-22 David E. Roberson

Gibbs random fields corresponding to systems of real-valued spins (e.g. systems of interacting anharmonic oscillators) indexed by the vertices of unbounded degree graphs with a certain summability property are constructed. It is proven that…

Probability · Mathematics 2009-04-22 Yuri Kondratiev , Yuri Kozitsky , Tanja Pasurek

A mixed graph $G$ is a graph obtained from a simple undirected graph by orientating a subset of edges. $G$ is self-converse if it is isomorphic to the graph obtained from $G$ by reversing each directed edge. For two mixed graphs $G$ and $H$…

Combinatorics · Mathematics 2019-12-02 Wei Wang , Lihong Qiu , Jianguo Qian , Wei Wang

An $(m, n)$-colored-mixed graph $G=(V, A_1, A_2,\cdots, A_m, E_1, E_2,\cdots, E_n)$ is a graph having $m$ colors of arcs and $n$ colors of edges. We do not allow two arcs or edges to have the same endpoints. A homomorphism from an…

Combinatorics · Mathematics 2020-09-01 Fabien Jacques , Pascal Ochem

We prove that a Gibbs point process interacting via a finite-range, repulsive potential $\phi$ exhibits a strong spatial mixing property for activities $\lambda < e/\Delta_{\phi}$, where $\Delta_{\phi}$ is the potential-weighted connective…

Probability · Mathematics 2022-09-07 Marcus Michelen , Will Perkins

We show for a broad class of counting problems, correlation decay (strong spatial mixing) implies FPTAS on planar graphs. The framework for the counting problems considered by us is the Holant problems with arbitrary constant-size domain…

Data Structures and Algorithms · Computer Science 2012-07-17 Yitong Yin , Chihao Zhang

The hard-core model has attracted much attention across several disciplines, representing lattice gases in statistical physics and independent sets in discrete mathematics and computer science. On finite graphs, we are given a parameter…

Probability · Mathematics 2018-04-03 Antonio Blanca , Yuxuan Chen , David Galvin , Dana Randall , Prasad Tetali

We show that it is consistent relative to a weakly compact cardinal that strong homology is additive and compactly supported within the class of locally compact separable metric spaces. This complements work of Marde\v{s}i\'{c} and Prasolov…

Logic · Mathematics 2022-02-22 Nathaniel Bannister , Jeffrey Bergfalk , Justin Tatch Moore

The contribution of this work is twofold. The first part deals with a Hilbert-space version of McCann's celebrated result on the existence and uniqueness of monotone measure-preserving maps: given two probability measures $\rm P$ and $\rm…

Probability · Mathematics 2023-05-23 Alberto González-Sanz , Marc Hallin , Bodhisattva Sen

Traditional graph centrality measures effectively quantify node importance but fail to capture the structural uniqueness of multi-scale connectivity patterns -- critical for understanding network resilience and function. This paper…

Social and Information Networks · Computer Science 2025-11-03 R. Scott Johnson

We study the complexity of a class of promise graph homomorphism problems. For a fixed graph H, the H-colouring problem is to decide whether a given graph has a homomorphism to H. By a result of Hell and Ne\v{s}et\v{r}il, this problem is…

Computational Complexity · Computer Science 2025-04-11 Sergey Avvakumov , Marek Filakovský , Jakub Opršal , Gianluca Tasinato , Uli Wagner

Let $H$ be a fixed graph. What can be said about graphs $G$ that have no subgraph isomorphic to a subdivision of $H$? Grohe and Marx proved that such graphs $G$ satisfy a certain structure theorem that is not satisfied by graphs that…

Combinatorics · Mathematics 2022-05-10 Chun-Hung Liu , Robin Thomas

We propose a notion of contraction function for a family of graphs and establish its connection to the strong spatial mixing for spin systems. More specifically, we show that for anti-ferromagnetic Potts model on families of graphs…

Data Structures and Algorithms · Computer Science 2015-07-28 Yitong Yin , Chihao Zhang

Graph homomorphisms from the $\mathbb{Z}^d$ lattice to $\mathbb{Z}$ are functions on $\mathbb{Z}^d$ whose gradients equal one in absolute value. These functions are the height functions corresponding to proper $3$-colorings of…

Probability · Mathematics 2021-07-29 Nishant Chandgotia , Ron Peled , Scott Sheffield , Martin Tassy

Structural properties of finite digraphs $R$ and $S$ are studied which enforce $\# {\cal H}(G,R) \leq \# {\cal H}(G,S)$ for every finite digraph $G \in \mathfrak{ D }'$, where ${\cal H}(G,H)$ is the set of homomorphisms from $G$ to $H$, and…

Combinatorics · Mathematics 2020-11-03 Frank a Campo

Let $G$ be a compact and connected Lie group and $PU(\mathcal H)$ be the group of projective unitary operators on a separable Hilbert space $\mathcal H$ endowed with the strong operator topology. We study the space $hom_{st}(G, PU(\mathcal…

Algebraic Topology · Mathematics 2021-03-08 Jesus Espinoza , Bernardo Uribe

This article records basic topological, as well as homological properties of the space of homomorphisms Hom(L,G) where L is a finitely generated discrete group, and G is a Lie group, possibly non-compact. If L is a free abelian group of…

Algebraic Topology · Mathematics 2007-05-23 Alejandro Adem , Frederick R. Cohen

Commability is the finest equivalence relation between locally compact groups such that $G$ and $H$ are equivalent whenever there is a continuous proper homomorphism $G \to H$ with cocompact image. Answering a question of Cornulier, we show…

Group Theory · Mathematics 2014-12-18 Mathieu Carette

In this work we prove sufficient conditions for the Glauber dynamics corresponding to a sequence of (non-product) measures on finite product spaces to be rapidly mixing, i.e. that the mixing time with respect to the total variation distance…

Probability · Mathematics 2019-02-27 Arthur Sinulis

We say that a given graph $G = (V, E)$ has \emph{pathbreadth} at most $\rho$, denoted $\pb(G) \leq \rho$, if there exists a Roberston and Seymour's path decomposition where every bag is contained in the $\rho$-neighbourhood of some vertex.…

Computational Complexity · Computer Science 2018-09-18 Guillaume Ducoffe , Arne Leitert