Factorizations of the complete graphs into factor of subdiameter two and factors of diameter three

We search for the minimal number of vertices of the complete graph that can be decomposed into one factor of subdiameter 2 and k factors of diameter 3. We find as follows: exact values for k≤3, upper and lower bounds for small values of k and [lim_{krightarrow infty }frac{phi left( kright) }{k}=2.

A Parallel Solver for Graph Laplacians

Problems from graph drawing, spectral clustering, network flow and graph partitioning can all be expressed in terms of graph Laplacian matrices. There are a variety of practical approaches to solving these problems in serial. However, as problem sizes increase and single core speeds stagnate, parallelism is essential to solve such problems quickly. We present an unsmoothed aggregation multigrid method for solving graph Laplacians in a distributed memory setting. We introduce new parallel aggregation and low degree elimination algorithms targeted specifically at irregular degree graphs. These algorithms are expressed in terms of sparse matrix-vector products using generalized sum and product operations. This formulation is amenable to linear algebra using arbitrary distributions and allows us to operate on a 2D sparse matrix distribution, which is necessary for parallel scalability. Our solver outperforms the natural parallel extension of the current state of the art in an algorithmic comparison. We demonstrate scalability to 576 processes and graphs with up to 1.7 billion edges.Comment: PASC '18, Code: https://github.com/ligmg/ligm

Deformation and rigidity of simplicial group actions on trees

We study a notion of deformation for simplicial trees with group actions (G-trees). Here G is a fixed, arbitrary group. Two G-trees are related by a deformation if there is a finite sequence of collapse and expansion moves joining them. We show that this relation on the set of G-trees has several characterizations, in terms of dynamics, coarse geometry, and length functions. Next we study the deformation space of a fixed G-tree X. We show that if X is `strongly slide-free' then it is the unique reduced tree in its deformation space. These methods allow us to extend the rigidity theorem of Bass and Lubotzky to trees that are not locally finite. This yields a unique factorization theorem for certain graphs of groups. We apply the theory to generalized Baumslag-Solitar groups and show that many have canonical decompositions. We also prove a quasi-isometric rigidity theorem for strongly slide-free G-trees.Comment: Published in Geometry and Topology at http://www.maths.warwick.ac.uk/gt/GTVol6/paper8.abs.htm