Related papers: Strong spatial mixing in homomorphism spaces

The notion of homomorphism indistinguishability offers a combinatorial framework for characterizing equivalence relations of graphs, in particular equivalences in counting logics within finite model theory. That is, for certain graph…

We present the notion of hom-complexity, $\text{C}(G;H)$, for two graphs $G$ and $H$, along with basic results for this numerical invariant. This invariant $\text{C}(G;H)$ is a number that measures the \aspas{complexity} of the question:…

Feature generation is an open topic of investigation in graph machine learning. In this paper, we study the use of graph homomorphism density features as a scalable alternative to homomorphism numbers which retain similar theoretical…

Measurement incompatibility--the impossibility of jointly measuring certain quantum observables--is a fundamental resource for quantum information processing. We develop a graph-theoretic framework for quantifying this resource for large…

Let $\Sigma$ denote a closed surface with constant mean curvature in $\mathbb{G}^3$, a 3-dimensional Lie group equipped with a bi-invariant metric. For such surfaces, there is a harmonic Gauss map which maps values to the unit sphere within…

The Gibbs sampler is a particularly popular Markov chain used for learning and inference problems in Graphical Models (GMs). These tasks are computationally intractable in general, and the Gibbs sampler often suffers from slow mixing. In…

In this article, we give explicit conditions for compact group extensions of hyperbolic flows (including geodesic flows on negatively curved manifolds) to exhibit quantifiable rates of mixing (or decay of correlations) with respect to the…

Given a weakly almost additive sequence of continuous functions with bounded variation $\mathcal{F}=\{\log f_n\}_{n=1}^{\infty}$ on a subshift $X$ over finitely many symbols, we study properties of a function $f$ on $X$ such that…

We study a model of spatial random permutations over a discrete set of points. Formally, a permutation $\sigma$ is sampled proportionally to the weight $\exp\{-\alpha \sum_x V(\sigma(x)-x)\},$ where $\alpha>0$ is the temperature and $V$ is…

We prove that many completeness properties coincide in metric spaces, precompact groups and dense subgroups of products of separable metric groups. We apply these results to function spaces C_p(X,G) of G-valued continuous functions on a…

Magnitude homology is an emerging framework that captures the intrinsic topological and geometric features of metric spaces, demonstrating significant potential for topoplogical data analysis and geometric data analysis. This work…

Let $\pi$ be a factor map from a one-dimensional mixing shift of finite type $X$ onto a sofic shift $Y$. We investigate when $\pi$ sends Gibbs measures on $X$ to non-Gibbs measures on $Y$.

We say that two unitary or orthogonal representations of a finitely generated group $G$ are additive conjugates if they are intertwined by an additive map, which need not be continuous. We associate to each representation of $G$ a…

We generalize subgraph densities, arising in dense graph limit theory, to Markov spaces (symmetric measures on the square of a standard Borel space). More generally, we define an analogue of the set of homomorphisms in the form of a measure…

Let $\text{G}(n)$ be equal either to $\text{PO}(n,1),\text{PU}(n,1)$ or $\text{PSp}(n,1)$ and let $\Gamma \leq \text{G}(n)$ be a uniform lattice. Denote by $\mathbb{H}^n_K$ the hyperbolic space associated to $\text{G}(n)$, where $K$ is a…

Let $G$ be a graph. The {\em spectral radius} of $G$ is the largest eigenvalue of its adjacency matrix. For a non-complete bipartite graph $G$ with parts $X$ and $Y$, the {\em bipartite toughness} of $G$ is defined as…

The Hom complex ${\rm Hom}(T,G)$ of graphs is a CW-complex associated to a pair of graphs $T$ and $G$, considered in the graph coloring problem. It is known that certain homotopy invariants of ${\rm Hom}(T,G)$ give lower bounds for the…

Let $G$ be a finite group. The order supergraph of $G$ is the graph with vertex set $G$, and two distinct vertices $x,y$ are adjacent if $o(x)\mid o(y)$ or $o(y)\mid o(x)$. The enhanced power graph of $G$ is the graph whose vertex set is…

Let $\beta>0$. Motivated by jumbled graphs defined by Thomason, the celebrated expander mixing lemma and Haemers's vertex separation inequality, we define that a graph $G$ with $n$ vertices is a weakly $(n,\beta)$-graph if $\frac{|X|…

For simple graphs $G$ and $H$, the Hom complex $\mathrm{Hom}(G,H)$ is a polyhedral complex whose vertices are the graph homomorphisms $G\to H$ and whose edges connect the pairs of homomorphisms which differ in a single vertex of $G$. Hom…