Related papers: Growth in product replacement graphs
We consider a large class of exponential random graph models and prove the existence of a region of parameter space corresponding to multipartite structure, separated by a phase transition from a region of disordered graphs.
We survey the extensions of a group by a group using crossed products instead of exact sequences of groups. The approach has various advantages, one of them being that the crossed product is an universal object. Several new applications are…
We consider the topological full group of a substitution subshift induced by a substitution $a\to aca$, $b\to d$, $c\to b$, $d\to c$. This group is interesting since the Grigorchuk group naturally embeds into it. We show that the…
The Product Replacement Algorithm is a practical algorithm for generating random elements of a finite group. The algorithm can be described as a random walk on a graph whose vertices are the generating k-tuples of the group (for a fixed…
Machine learning on graphs, especially using graph neural networks (GNNs), has seen a surge in interest due to the wide availability of graph data across a broad spectrum of disciplines, from life to social and engineering sciences. Despite…
Outer, dual, and total general position sets are studied on strong and lexicographic products of graphs. Sharp lower and upper bounds are proved for the outer and the dual general position number of strong products and several exact values…
We consider growth conditions for (frequently) Birkhoff-universal functions of exponential type with respect to the different rays emanating from the origin. For that purpose, we investigate their (conjugate) indicator diagram or,…
Deep generative models have recently made a remarkable progress in capturing complex probability distributions over graphs. However, they are intractable and thus unable to answer even the most basic probabilistic inference queries without…
Motivated by very large-scale communication networks, we newly introduce exponentiation of graphs. Using the exponential operation on graphs, we can construct various graphs of multi-exponential order with logarithmic diameter. We show that…
We calculate asymptotic estimates for the conjugacy growth function of finitely generated class 2 nilpotent groups whose derived subgroup is infinite cyclic, including the so-called higher Heisenberg groups. We prove that these asymptotics…
The product replacement algorithm is a practical algorithm to construct random elements of a finite group G. It can be described as a random walk on a graph whose vertices are the generating k-tuples of G (for a fixed k). We show that if G…
Graphs are crucial for representing interrelated data and aiding predictive modeling by capturing complex relationships. Achieving high-quality graph representation is important for identifying linked patterns, leading to improvements in…
In this note, we describe a construction that leads to families of graphs whose critical groups are cyclic. For some of these families we are able to give a formula for the number of spanning trees of the graph, which then determines the…
We provide an algorithm which, for a given quadratic equation in the Grigorchuk group determines if it has a solution. As a corollary to our approach, we prove that the group has a finite commutator width.
Nekrashevych conjectured that the iterated monodromy groups of quadratic polynomials with preperiodic critical orbit have intermediate growth. We illustrate some of the difficulties that arise in attacking this conjecture and prove…
We give a general asymptotic formula for the growth rate of the number of indecomposable summands in the tensor powers of representations of finite groups, over a field of arbitrary characteristic. In characteristic zero we obtain…
In this paper, we investigate the edge-coloring number of the power graph of a finite group. We characterize which finite groups have overfull power graphs, showing that this occurs if and only if the group is cyclic of odd prime power…
We study the growth of the rank of subgroups of finite index in residually finite groups, by relating it to the notion of cost. As a by-product, we show that the `Rank vs. Heegaard genus' conjecture on hyperbolic 3-manifolds is incompatible…
The combination of this paper and its companion complete the classification of monodromy groups of indecomposable coverings of complex curves $f:X\rightarrow \mathbb P^1$ of sufficiently large degree in comparison to the genus of $X$. In…
Let $G$ be a group acting properly by isometries and with a strongly contracting element on a geodesic metric space. Let $N$ be an infinite normal subgroup of $G$, and let $\delta_N$ and $\delta_G$ be the growth rates of $N$ and $G$ with…