Related papers: Graphs of finite measure

We study graph products of groups from the viewpoint of measured group theory. We first establish a full measure equivalence classification of graph products of countably infinite groups over finite simple graphs with no transvection and no…

We give a sufficient condition for the essential self-adjointness of a perturbation of the square of the magnetic Laplacian on an infinite weighted graph. The main result is applicable to graphs whose degree function is not necessarily…

We introduce and study a generalization of conformal rigidity for graphs. A graph is $k$-conformally rigid if the uniform edge weights simultaneously maximize the sum of the $k$ smallest nontrivial Laplacian eigenvalues and minimize the sum…

A connected graph is called \emph{geodetic} if there is a unique geodesic between each pair of vertices. In this paper we prove that if a finitely generated group admits a Cayley graph which is geodetic, then the group must be virtually…

In this paper, inspired by the elegant work of Good and Meddaugh \cite{GM} and the graph models for zero-dimensional systems developed by several authors, like Gambaudo and Martens \cite{GM06}, Shimomura \cite{Sh14}. We try to discover a…

We consider Laplacians on periodic metric graphs with unit-length edges. The spectrum of these operators consists of an absolutely continuous part (which is a union of an infinite number of non-degenerated spectral bands) plus an infinite…

We prove that for any weakly convergent sequence of finite graphs with bounded vertex degrees, there exists a topological limit graphing.

Minimal surfaces in $\mathbb{R}^n$ can be locally approximated by graphs of harmonic functions, i.e., functions that are critical points of the Dirichlet energy, but no analogous theorem is known for $H$-minimal surfaces in the…

A metrized graph is a compact singular 1-manifold endowed with a metric. A given metrized graph can be modelled by a family of weighted combinatorial graphs. If one chooses a sequence of models from this family such that the vertices become…

The aim of this chapter is to provide an adequate graph theoretic framework for the description of periodic bifurcations which have recently been discovered in descendant trees of finite p-groups. The graph theoretic concepts of rooted…

Using topological circles in the Freudenthal compactification of a graph as infinite cycles, we extend to locally finite graphs a result of Oberly and Sumner on the Hamiltonicity of finite graphs. This answers a question of Stein, and gives…

The aim of the present article is to give an overview of spectral theory on metric graphs guided by spectral geometry on discrete graphs and manifolds. We present the basic concept of metric graphs and natural Laplacians acting on it and…

We introduce the matrix sums that represent a discrete analog of the matrix models with quartic potential. The probability space is given by the set of all simple n-vertex graphs with the Gibbs weight determined by the graph Laplacian. We…

We provide an algorithm, running in polynomial time in the number of vertices, computing the unique solution to the biased infinity Laplacian Boundary Problem on finite graphs. The algorithm is based on the general outline and approach…

We study the set of intrinsic metrics on a given graph. This is a convex compact set and it carries a natural order. We investigate existence of largest elements with respect to this order. We show that the only locally finite graphs which…

This paper is devoted to the investigation of the spectral theory and dynamical properties of periodic graphs which are not locally finite but carry non-negative, symmetric and summable edge weights. These graphs are shown to exhibit rather…

In this paper we prove the first quantitative convergence rates for the graph infinity Laplace equation for length scales at the connectivity threshold. In the graph-based semi-supervised learning community this equation is also known as…

The end compactification |\Gamma| of the locally finite graph \Gamma is the union of the graph and its ends, endowed with a suitable topology. We show that \pi_1(|\Gamma|) embeds into a nonstandard free group with hyperfinitely many…

Graphons are analytic objects associated with convergent sequences of graphs. Problems from extremal combinatorics and theoretical computer science led to a study of graphons determined by finitely many subgraph densities, which are…

Let $G$ be a finite non-abelian group and ${\Gamma}_{nc}(G)$ be its non-commuting graph. In this paper, we compute spectrum and energy of ${\Gamma}_{nc}(G)$ for certain classes of finite groups. As a consequence of our results we construct…