English
Related papers

Related papers: Weighted cogrowth formula for free groups

200 papers

In this paper we generalise the results on eigenvalues and eigenvectors of unnormalized (combinatorial) Laplacian of two-dimensional grid presented by Edwards:2013 first to a grid graph of any dimension, and second also to other types of…

Classical Analysis and ODEs · Mathematics 2019-09-02 Mieczysław A. Kłopotek

We prove new vanishing results on the growth of higher torsion homologies for suitable arithmetic lattices, Artin groups and mapping class groups. The growth is understood along Farber sequences, in particular, along residual chains. For…

Geometric Topology · Mathematics 2022-12-16 Miklos Abert , Nicolas Bergeron , Mikolaj Fraczyk , Damien Gaboriau

Let $G$ be a finite simple graph with Laplacian polynomial $\psi(G,\lambda)=\sum_{k=0}^n(-1)^{n-k}c_k\lambda^k$. In an earlier paper, the coefficients $c_{n-4}$ and $c_{n-5}$ for tree with respect to some degree-based graph invariants were…

Combinatorics · Mathematics 2021-04-20 Ali Ghalavand , Ali Reza Ashrafi

We derive two formulas for the weighted sums of rooted spanning forests of particular sequence of graphs by using the matrix tree theorem. We consider cycle graphs with edges so called the pendant edges. One of our formula can be described…

Combinatorics · Mathematics 2024-02-13 Hajime Fujita , Kimiko Hasegawa , Yukie Inaba , Takefumi Kondo

In this paper, we give a new generalization of positive sectional curvature called positive weighted sectional curvature. It depends on a choice of Riemannian metric and a smooth vector field. We give several simple examples of Riemannian…

Differential Geometry · Mathematics 2014-10-08 Lee Kennard , William Wylie

We investigate spatial random graphs defined on the points of a Poisson process in $d$-dimensional space, which combine scale-free degree distributions and long-range effects. Every Poisson point is assigned an independent weight. Given the…

Probability · Mathematics 2024-04-23 Peter Gracar , Lukas Lüchtrath , Peter Mörters

We present a novel construction of finite groupoids whose Cayley graphs have large girth even w.r.t. a discounted distance measure that contracts arbitrarily long sequences of edges from the same colour class (sub-groupoid), and only counts…

Combinatorics · Mathematics 2024-01-17 Martin Otto

A few years ago various disparities for Laplacians on graphs and manifolds were discovered. The corresponding results are mostly related to volume growth in the context of unbounded geometry. Indeed, these disparities can now be resolved by…

Metric Geometry · Mathematics 2015-03-25 Matthias Keller

The number of spanning trees in the giant component of the random graph $\G(n, c/n)$ ($c>1$) grows like $\exp\big\{m\big(f(c)+o(1)\big)\big\}$ as $n\to\infty$, where $m$ is the number of vertices in the giant component. The function $f$ is…

Probability · Mathematics 2010-04-27 Russell Lyons , Ron Peled , Oded Schramm

The celebrated dependent random choice lemma states that in a bipartite graph an average vertex (weighted by its degree) has the property that almost all small subsets $S$ in its neighborhood has common neighborhood almost as large as in…

Combinatorics · Mathematics 2022-01-27 Tao Jiang , Sean Longbrake

Graphical models describe associations between variables through the notion of conditional independence. Gaussian graphical models are a widely used class of such models where the relationships are formalized by non-null entries of the…

Methodology · Statistics 2023-08-08 Sagnik Bhadury , Riten Mitra , Jeremy T. Gaskins

Let $G$ be a finite group with symmetric generating set $S$, and let $c = \max_{R > 0} |B(2R)|/|B(R)|$ be the doubling constant of the corresponding Cayley graph, where $B(R)$ denotes an $R$-ball in the word-metric with respect to $S$. We…

Metric Geometry · Mathematics 2009-03-26 James R. Lee , Yury Makarychev

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…

Metric Geometry · Mathematics 2019-11-26 Mikael de la Salle , Romain Tessera

We introduce diophantine approximation groups and their associated Kronecker foliations, using them to provide new algebraic and geometric characterizations of $K$-linear and algebraic dependence. As a consequence we find reformulations --…

Number Theory · Mathematics 2019-02-28 T. M. Gendron

We derive upper bounds for the eigenvalues of the Kirchhoff Laplacian on a compact metric graph depending on the graph's genus g. These bounds can be further improved if $g = 0$, i.e. if the metric graph is planar. Our results are based on…

Spectral Theory · Mathematics 2020-04-10 Marvin Plümer

Let G be a finitely connected Lie group and let K be a maximal compact subgroup. Let M be a cocompact G-proper manifold with boundary, endowed with a G-invariant metric which is of product type near the boundary. Under additional…

K-Theory and Homology · Mathematics 2022-03-09 Paolo Piazza , Hessel Posthuma

We prove that the boundary action of a sofic random subgroup of a finitely generated free group is conservative. This addresses a question asked by Grigorchuk, Kaimanovich, and Nagnibeda, who studied the boundary actions of individual…

Dynamical Systems · Mathematics 2014-11-27 Jan Cannizzo

Let $I(G_{\mathbf{w}})$ be the edge ideal of an edge-weighted graph $(G,\mathbf{w})$. We prove that $I(G_{\mathbf{w}})$ is sequentially Cohen-Macaulay for all weight functions $w$ if and only if $G$ is a Woodroofe graph.

Commutative Algebra · Mathematics 2023-08-10 Ly Thi Kieu Diem , Nguyen Cong Minh , Thanh Vu

This paper studies $k$-claw-free graphs, exploring the connection between an extremal combinatorics question and the power of a convex program in approximating the maximum-weight independent set in this graph class. For the extremal…

Computational Complexity · Computer Science 2023-08-31 Parinya Chalermsook , Ameet Gadekar , Kamyar Khodamoradi , Joachim Spoerhase

Let {\cal G}=(G,w) be a positive-weighted simple finite graph, that is, let G be a simple finite graph endowed with a function w from the set of the edges of G to the set of the positive real numbers. For any subgraph G' of G, we define…

Combinatorics · Mathematics 2013-02-05 Agnese Baldisserri , Elena Rubei