相关论文: Perfect Matchings as IID Factors on Non-Amenable G…

We construct an explicit generating sets $F_n$ and $\tilde F_n$ of the alternating and the symmetric groups, which make the Cayley graphs $C(Alt(n), F_n)$ and $C(Sym(n), \tilde F_n)$ a family of bounded degree expanders for all sufficiently…

We study when the adjacency matrix of a Cayley graph factors as the product of two adjacency matrices of Cayley graphs. Let $G$ be a finite group and let $U\subseteq G\setminus \{e\}$ be symmetric. Writing $A(G;U)$ for the adjacency matrix…

Exploiting the indistinguishability of objects in a probabilistic graphical model such as a factor graph is key to lifted probabilistic inference algorithms and allows for tractable probabilistic inference problems with respect to domain…

Given a graph $\Gamma$, a subset $C$ of $V(\Gamma)$ is called a perfect code in $\Gamma$ if every vertex of $\Gamma$ is at distance no more than one to exactly one vertex in $C$, and a subset $C$ of $V(\Gamma)$ is called a total perfect…

We prove that the Loop O(1) model, a well-known graphical expansion of the Ising model, is a factor of i.i.d. on unimodular random rooted graphs under various conditions, including in the presence of a non-negative external field. As an…

For every finitely generated free group $F$, we construct an irreducible open $3$-manifold $M_F$ whose end set is homeomorphic to a Cantor set, and with the end homogeneity group of $M_F$ isomorphic to $F$. The end homogeneity group is the…

Twin-width is a recently introduced graph parameter with applications in algorithmics, combinatorics, and finite model theory. For graphs of bounded degree, finiteness of twin-width is preserved by quasi-isometry. Thus, through Cayley…

We generalize the notion of isoperimetric profiles of finitely generated groups to their actions by measuring the boundary of finite subgraphings of the orbit graphing. We prove that like the classical isoperimetric profiles for groups,…

Conditions are given which imply that certain non-autonomous analytic iterated function systems (NIFS's) in the complex plane C have uniformly perfect attractor sets. Examples are given to illustrate the main theorem, as well as to indicate…

We show that the number of perfect matching in a simple graph $G$ with an even number of vertices and degree sequence $d_1,d_2, ..., d_n$ is at most $\prod_{i=1}^n (d_i !)^{\frac{1}{2d_i}}$. This bound is sharp if and only if $G$ is a union…

We show that any finitely dependent invariant process on a transitive amenable graph is a finitary factor of an i.i.d. process. With an additional assumption on the geometry of the graph, namely that no two balls with different centers are…

If $N \subset \R$ is a separable II$_1$-factor, the space $\Hom(N,\R)$ of unitary equivalence classes of unital *-homomorphisms $N \to \R$ is shown to have a surprisingly rich structure. If $N$ is not hyperfinite, $\Hom(N,\R)$ is an…

In this paper, we try to determine exact or bounds on the choosability, or list chromatic numbers of some Cayley graphs, typically some Unitary Cayley graphs and Cayley graphs on Dihedral groups.

A connected undirected graph is called \emph{geodetic} if for every pair of vertices there is a unique shortest path connecting them. It has been conjectured that for finite groups, the only geodetic Cayley graphs are odd cycles and…

We show that any free product of two countable groups, one of them being infinite, admits a faithful and homogeneous action on the Random Graph. We also show that a large class of HNN extensions or free products, amalgamated over a finite…

We discuss the question whether the existence of perfect matchings in a cubic graph can be seen from the spectrum of its adjacency matrix. For regular graphs in general and for three edge-disjoint perfect matchings in a cubic graph (that…

Let Ga be a subgroup of GL_d(Q) generated by a finite symmetric set S. For an integer q, denote by Ga_q the subgroup of Ga consisting of the elements that project to the unit element mod q. We prove that the Cayley graphs of Ga/Ga_q with…

In 1985, Dunwoody showed that finitely presentable groups are accessible. Dunwoody's result was used to show that context-free groups, groups quasi-isometric to trees or finitely presentable groups of asymptotic dimension 1 are virtually…

Let $G$ be a simple graph with $2n$ vertices and a perfect matching. We denote by $f(G)$ and $F(G)$ the minimum and maximum forcing number of $G$, respectively. Hetyei obtained that the maximum number of edges of graphs $G$ with a unique…

A well-known result of Benjamini, Lyons, Peres, and Schramm states that if $G$ is a finitely generated Cayley graph of a group $\Gamma$, then $\Gamma$ is amenable if and only if $G$ admits a $\Gamma$-invariant random spanning tree with at…