Related papers: Asymptotic dimension of multi-ended quasi-transiti…

We characterize some asymptotic properties of edge exchangeable random graphs in terms of the measure used to generate them. In particular, we give a necessary and sufficient condition for eventual forever connectedness, a sufficient…

In a recent paper, McDiarmid, Semple, and Welsh (2015) showed that the number of tree-child networks with $n$ leaves has the factor $n^{2n}$ in its main asymptotic growth term. In this paper, we improve this by completely identifying the…

We extend Gromov's notion of asymptotic dimension of finitely generated groups to all discrete groups. In particular, we extend the Hurewicz type theorem proven in [B-D2] to general groups. Then we use this extension to prove a formula for…

Determining the Shannon capacity of graphs is a long-standing open problem in information theory, graph theory and combinatorial optimization. Over decades, a wide range of upper and lower bound methods have been developed to analyze this…

We derive an upper bound on the maximum balanced bipartite entanglement entropy of ground states of many-body Hamiltonians defined on a graph, agnostic to any particular model, that possesses a nontrivial automorphism group. We show that…

Given a metric space $X$ of finite asymptotic dimension, we consider a quasi-isometric invariant of the space called dimension function. The space is said to have asymptotic Assouad-Nagata dimension less or equal $n$ if there is a linear…

We propose a generalization of the asymptotic equipartition property to discrete sources with an ambiguous alphabet, and prove that it holds for irreducible stationary Markov sources with an arbitrary distinguishability relation. Our…

We introduce the idea of semigroup-controlled asymptotic dimension. This notion generalizes the asymptotic dimension and the asymptotic Assouad-Nagata dimension in the large scale. There are also semigroup controlled dimensions for the…

We define and study two structures associated to permutation groups: Dirichlet characters on permutation groups, and the "cycle form," a bilinear form on the group algebras of permutation groups. We use Dirichlet characters and the cycle…

This paper deals with graph automaton groups associated with trees and some generalizations. We start by showing some algebraic properties of tree automaton groups. Then we characterize the associated semigroup, proving that it is…

The aim of this paper is to introduce an asymptotic counterpart of the extension dimension defined by Dranishnikov. The main result establishes a relation between the asymptotic extensional dimension of a proper metric space and extension…

In this paper, we characterise graphs that are quasi-isometric to graphs with bounded treewidth. Specifically, we prove that a graph is quasi-isometric to a graph with bounded treewidth if and only if it has a tree-decomposition where each…

We show that every connected graph can be approximated by a normal tree, up to some arbitrarily small error phrased in terms of neighbourhoods around its ends. The existence of such approximate normal trees has consequences of both…

We show that the fundamental groups of any two closed irreducible non-geometric graph-manifolds are quasi-isometric. This answers a question of Kapovich and Leeb. We also classify the quasi-isometry types of fundamental groups of…

We prove that every visual Gromov hyperbolic space X whose boundary at infinity has the finite capacity dimension n admits a quasi-isometric embedding into (n+1)-fold product of metric trees.

In this paper, we prove a combination theorem for a relatively acylindrical graph of relatively hyperbolic groups (Theorem 1.1). Here, we are extending the technique of [Tom21] and constructing Bowditch boundary of the fundamental group of…

A directed graph is semi-transitive if and only if it is acyclic and for any directed path $u_1\rightarrow u_2\rightarrow \cdots \rightarrow u_t$, $t \geq 2$, either there is no edge from $u_1$ to $u_t$ or all edges $u_i\rightarrow u_j$…

We prove that every graph which admits a tree-decomposition into finite parts has a rooted tree-decomposition into finite parts that is linked, tight and componental. As an application, we obtain that every graph without half-grid minor has…

This work is devoted to lower bounds on independence numbers of distance graphs with vertices in $\{-1,0,1\}^n$. The asymptotic case is studied, yielding new results over a broad range of parameters. Numerical results are presented,…

We give a bound, linear in the complexity of the surface, on the asymptotic dimension of the curve complex as well as the capacity dimension of the ending lamination space.