English
Related papers

Related papers: Strong spatial mixing in homomorphism spaces

200 papers

We study a class of Gibbs measures of classical particle spin systems with spin space $S=\mathbb{R}^{m}$ and unbounded pair interaction, living on a metric graph given by a typical realization $\gamma $ of a random point process in…

Mathematical Physics · Physics 2015-06-16 Alexei Daletskii , Yuri Kondratiev , Yuri Kozitsky , Tanja Pasurek

A graph K is multiplicative if a homomorphism from any product G x H to K implies a homomorphism from G or from H. Hedetniemi's conjecture states that all cliques are multiplicative. In an attempt to explore the boundaries of current…

Combinatorics · Mathematics 2018-08-15 Claude Tardif , Marcin Wrochna

Z-mapping graph is a balanced bipartite graph $G$ of a digraph $D$ by split each vertex of $D$ into a pair of vertices of $G$. Based on the property of the $G$, it is proved that if $D$ is strong connected and $G$ is Hamiltonian, then $D$…

Discrete Mathematics · Computer Science 2008-12-24 Guohun Zhu

In this paper, we investigate the dynamical behavior of a two dimensional shift $X_G$ (generated by a two dimensional graph $G=(\mathcal{H},\mathcal{V})$) using the adjacency matrices of the generating graph $G$. In particular, we…

Dynamical Systems · Mathematics 2023-11-03 Prashant Kumar , Puneet Sharma

Lov\'asz (1967) showed that two graphs $G$ and $H$ are isomorphic if and only if they are homomorphism indistinguishable over the class of all graphs, i.e. for every graph $F$, the number of homomorphisms from $F$ to $G$ equals the number…

Combinatorics · Mathematics 2025-03-13 Martin Grohe , Gaurav Rattan , Tim Seppelt

We equip the edges of a deterministic graph $H$ with independent but not necessarily identically distributed weights and study a generalized version of matchings (i.e. a set of vertex disjoint edges) in $H$ satisfying the property that…

Probability · Mathematics 2021-08-18 Ghurumuruhan Ganesan

The paper introduces a general method to construct conformal measures for a local homeomorphism on a locally compact non-compact Hausdorff space, subject to mild irreducibility-like conditions. Among others the method is used to give…

Dynamical Systems · Mathematics 2019-02-20 Klaus Thomsen

The past decade has seen a flourishing of advances in harmonic analysis of graphs. They lie at the crossroads of graph theory and such analytical tools as graph Laplacians, Markov processes and associated boundaries, analysis of path-space,…

Dynamical Systems · Mathematics 2020-07-31 Sergey Bezuglyi , Palle E. T. Jorgensen

A homomorphism from a graph G to a graph H is a function from the vertices of G to the vertices of H that preserves edges. A homomorphism is surjective if it uses all of the vertices of H and it is a compaction if it uses all of the…

Computational Complexity · Computer Science 2019-06-28 Jacob Focke , Leslie Ann Goldberg , Stanislav Zivny

For two not necessarily commutative topological groups G and T, let H(G,T) denote the space of all continuous homomorphisms from G to T with the compact-open topology. We prove that if G is metrizable and T is compact then H(G,T) is a…

General Topology · Mathematics 2007-05-23 Gabor Lukacs

We study the spatial Gibbs random graphs introduced in [MV16] from the point of view of local convergence. These are random graphs embedded in an ambient space consisting of a line segment, defined through a probability measure that favors…

Probability · Mathematics 2017-12-12 Eric Ossami Endo , Daniel Valesin

Color refinement is a classical technique used to show that two given graphs G and H are non-isomorphic; it is very efficient, although it does not succeed on all graphs. We call a graph G amenable to color refinement if it succeeds in…

Computational Complexity · Computer Science 2015-05-05 V. Arvind , Johannes Köbler , Gaurav Rattan , Oleg Verbitsky

A mapping $\alpha : V(G) \to V(H)$ from the vertex set of one graph $G$ to another graph $H$ is an isometric embedding if the shortest path distance between any two vertices in $G$ equals the distance between their images in $H$. Here, we…

Discrete Mathematics · Computer Science 2021-12-21 Joseph Berleant , Kristin Sheridan , Anne Condon , Virginia Vassilevska Williams , Mark Bathe

Let G be a finite simple graph with automorphism group A(G). Then a spanning subgraph U of G is a fixing subgraph of G if G contains exactly $| A(G)|/ | A(G) \cap A(U)| $ subgraphs isomorphic to U: the graph G must always contain at least…

Combinatorics · Mathematics 2007-05-23 John Sheehan

This paper is devoted to study a characterization of (strong) local maximal monotonicity in terms of a property involving the graphical derivative of a set-valued mapping defined on a Hilbert space. As a consequence, a second-order…

Optimization and Control · Mathematics 2025-08-29 Juan Guillermo Garrido

Homophily is a graph property describing the tendency of edges to connect similar nodes. There are several measures used for assessing homophily but all are known to have certain drawbacks: in particular, they cannot be reliably used for…

Machine Learning · Computer Science 2024-12-16 Mikhail Mironov , Liudmila Prokhorenkova

Let $H$ be an edge-weighted graph, and let $G$ be a subgraph of $H$. We say that $G$ is an $f$-fault-tolerant $t$-spanner for $H$, if the following is true for any subset $F$ of at most $f$ edges of $G$: For any two vertices $p$ and $q$,…

Computational Geometry · Computer Science 2025-08-29 Ahmad Biniaz , Jean-Lou De Carufel , Anil Maheshwari , Michiel Smid

Let $G$ and $H$ be locally compact groups with fixed two-side-invariant Haar measures. A polyhomomorphism $G\to H$ is a closed subgroup $R\subset G\times H$ with a fixed Haar measure, whose marginals on $G$ and $H$ are dominated by the Haar…

Functional Analysis · Mathematics 2021-05-25 Yury A. Neretin

We discuss the $(1+1)$-dimensional wave maps equation with values in a compact Lie group. The corresponding Gibbs measure is given by a Brownian motion on the Lie group, which plays a central role in stochastic geometry. Our main theorem is…

Analysis of PDEs · Mathematics 2026-03-31 Bjoern Bringmann

We present a new criterion, based on commutator methods, for the strong mixing property of unitary representations of topological groups equipped with a proper length function. Our result generalises and unifies recent results on the strong…

Dynamical Systems · Mathematics 2015-10-02 Serge Richard , Rafael Tiedra de Aldecoa
‹ Prev 1 3 4 5 6 7 10 Next ›