Related papers: Visual boundaries of Diestel-Leader graphs
The intersection graph of a group $G$ is an undirected graph without loops and multiple edges defined as follows: the vertex set is the set of all proper non-trivial subgroups of $G$, and there is an edge between two distinct vertices $H$…
Let G be a finitely presented group, and G' its commutator subgroup. Let C be the Cayley graph of G' with all commutators in G as generators. Then C is large scale simply connected. Furthermore, if G is a torsion-free nonelementary…
We study the asymptotics of large, simple, labeled graphs constrained by the densities of edges and of $k$-star subgraphs, $k\ge 2$ fixed. We prove that under such constraints graphs are "multipodal": asymptotically in the number of…
Let $\mathcal{E}$ be a $\mathbb{Q}$-isogeny class of elliptic curves defined over $\mathbb{Q}$ without CM. The isogeny graph associated to $\mathcal{E}$ is a graph which has a vertex for each elliptic curve in $\mathcal{E}$ and an edge for…
We rigorously derive the dense graph limit of a discrete model describing the formation of biological transportation networks. The discrete model, defined on undirected graphs with pressure-driven flows, incorporates a convex energy…
The relative Cayley graph of a group $G$ with respect to its proper subgroup $H$, is a graph whose vertices are elements of $G$ and two vertices $h\in H$ and $g\in G$ are adjacent if $g=hc$ for some $c\in C$, where $C$ is an inversed-closed…
Symbolic dynamics is partly the study of walks in a directed graph. By a walk, here we mean a morphism to the graph from the Cayley graph of the monoid of non-negative integers. Sets of these walks are also important in other areas, such as…
We solve three open problems concerning infinite-dimensional Lie groups posed in a recent survey article by K.-H. Neeb: (1) There exists a subgroup of some infinite-dimensional Lie group G which does not admit an initial Lie subgroup…
We consider the dynamics of relativistic spin-half particles in quantum graphs with transparent branching points. The system is modeled by combining the quantum graph concept with the one of transparent boundary conditions applied to the…
Let $G$ be a group and let $S$ be an inverse-closed and identity-free generating set of $G$. The \emph{Cayley graph} $\Cay(G,S)$ has vertex-set $G$ and two vertices $u$ and $v$ are adjacent if and only if $uv^{-1}\in S$. Let $CAY_d(n)$ be…
The space of directions is a notion of boundary associated to an arbitrary totally disconnected locally compact group. We explicitly calculate the space of directions of a group acting vertex transitively with compact open vertex…
We generalize [Vav] to give sufficient conditions, primarily on coarse geometry, to ensure that a subset of a Cayley graph is a finite Hausdorff distance from a subgroup. Using this result, we prove a partial converse to the Flat Torus…
A generic finite presentation defines a word hyperbolic group whose boundary is homeomorphic to the Menger curve. In this article, we produce the first known examples of non-hyperbolic $CAT(0)$ groups whose visual boundary is homeomorphic…
We determine the optimum topology of quasi-one dimensional nonlinear optical structures using generalized quantum graph models. Quantum graphs are relational graphs endowed with a metric and a multiparticle Hamiltonian acting on the edges,…
It is well-known that a complete Riemannian manifold M which is locally isometric to a symmetric space is covered by a symmetric space. Here we prove that a discrete version of this property (called local to global rigidity) holds for a…
We construct a locally compact Hausdorff topology on the path space of a directed graph $E$, and identify its boundary-path space $\partial E$ as the spectrum of a commutative $C^*$-subalgebra $D_E$ of $C^*(E)$. We then show that $\partial…
We present two results related to an edge-isoperimetric question for Cayley graphs on the integer lattice asked by Ben Barber and Joshua Erde [Isoperimetry of Integer Lattices, Discrete Analysis 7 (2018)]. For any (undirected) graph $G$,…
Answering a question of Diestel, we develop a topological notion of gammoids in infinite graphs which, unlike traditional infinite gammoids, always define a matroid. As our main tool, we prove for any infinite graph $G$ with vertex sets $A$…
In the present paper, we study central limit theorems (CLTs) for non-symmetric random walks on nilpotent covering graphs from a point of view of discrete geometric analysis developed by Kotani and Sunada. We establish a semigroup CLT for a…
We give bounds on the L(2,1)-labeling number of a simple graph in terms of its order and its maximum degree. We also describe an infinite class of graphs of which the elements have the highest L(2,1)-labeling numbers in terms of their…