相关论文: Weighted cogrowth formula for free groups

In this paper, we consider the formal power series whose n-th coefficient is the number of copies of a given finite graph in the ball of radius n centred at the identity element in the Cayley graph of a finitely generated group and call it…

We relate graph complexes, Calabi-Yau $A_\infty$-categories and Kontsevich's cocycle construction. Our main result produces a commutative square of shifted Poisson algebras; one of its edges is the Loday-Quillen-Tsygan map, generalized to…

In this paper, the author (1) compares subnormal closures of finite sets in free groups; (2) proves that the exponential growth rate (e.g.r.), i.e., the limit of the n-th roots of g(n), where g(n) is the growth function of a subgroup H with…

We prove that for a relatively hyperbolic group G there is a sequence of relatively hyperbolic proper quotients such that their growth rates converge to the growth rate of G. Under natural assumptions, the same conclusion holds for the…

Let $G$ be a simple undirected $n$-vertex graph with the characteristic polynomial of its Laplacian matrix $L(G)$, $\det (\lambda I - L (G))=\sum_{k = 0}^n (-1)^k c_k \lambda^{n - k}$. It is well known that for trees the Laplacian…

We leverage a correspondence between group actions and edge-labelled graphs in two ways. First, we give a unified presentation of several folklore results connecting weak containment, local-global convergence, and continuous model theory.…

The conjugator length function of a finitely generated group $\Gamma$ gives the optimal upper bound on the length of a shortest conjugator for any pair of conjugate elements in the ball of radius $n$ in the Cayley graph of $\Gamma$. We…

We consider the problem of finding edges of a hidden weighted graph using a certain type of queries. Let $G$ be a weighted graph with $n$ vertices. In the most general setting, the $n$ vertices are known and no other information about $G$…

We find a L\'evy-Khinchin formula for radial functions on free groups. As a corollary we obtain a linear bound on the growth of radial, conditionally negative definite functions on free groups of two or more generators.

This book provides a self-contained introduction to geometric group theory. The topics range from an introduction of Cayley and Schreier graphs to Gromov's theorem on groups of polynomial growth and amenability. We discuss the ping-pong…

We study the free product of rooted graphs and its various decompositions using quantum probabilistic methods. We show that the free product of rooted graphs is canonically associated with free independence, which completes the proof of the…

Gaussian graphical models typically assume a homogeneous structure across all subjects, which is often restrictive in applications. In this article, we propose a weighted pseudo-likelihood approach for graphical modeling which allows…

We study upper bounds for the first non-zero eigenvalue of the Steklov problem defined on finite graphs with boundary. For finite graphs with boundary included in a Cayley graph associated to a group of polynomial growth, we give an upper…

We present two new contributions to the study of the independence polynomial $Z_G(z)$ of a finite simple graph $G = (V,E)$. First, we provide an improved lower bound for the zero-free region of $Z_G(z)$ for the important class of claw-free…

In this paper we study $\infty$-Laplacian type diffusion equations in weighted graphs obtained as limit as $p\to \infty$ to two types of $p$-Laplacian evolution equations in such graphs. We propose these diffusion equations, that are…

We study the growth rate of the hard squares lattice gas, equivalent to the number of independent sets on the square lattice, and two related models - non-attacking kings and read-write isolated memory. We use an assortment of techniques…

We start by studying the distribution of (cyclically reduced) elements of the free groups with respect to their abelianization. We derive an explicit generating function, and a limiting distribution, by means of certain results (of…

Using a generating function approach, the correlation coefficients of four different graph-theoretical indices, namely the number of independent vertex subsets, the number of matchings, the number of subtrees and the Wiener index, are…

Let $G$ be a graph of order $n$ and let $\mathcal{L}(G,\lambda)=\sum_{k=0}^n (-1)^{k}c_{k}(G)\lambda^{n-k}$ be the characteristic polynomial of its Laplacian matrix. Motivated by Ili\'{c} and Ili\'{c}'s conjecture [A. Ili\'{c}, M. Ili\'{c},…

The principal objects studied in this note are Coxeter groups $W$ that are neither finite nor affine. A well known result of de la Harpe asserts that such groups have exponential growth. We consider quotients of $W$ by its parabolic…