Related papers: Potential Theory on Trees, Graphs and Ahlfors Regu…
Rotation distances measure the differences in structure between rooted ordered binary trees. The one-dimensional skeleta of associahedra are rotation graphs, where two vertices representing trees are connected by an edge if they differ by a…
In this paper, we study metric trees, without any finiteness restrictions. For subsets of such trees, a condition that guarantees that the Hausdorff and Gromov--Hausdorff distances from the subset to the entire metric tree are the same is…
We consider drawings of graphs in the plane in which vertices are assigned distinct points in the plane and edges are drawn as simple curves connecting the vertices and such that the edges intersect only at their common endpoints. There is…
A metric phylogenetic tree relating a collection of taxa induces weighted rooted triples and weighted quartets for all subsets of three and four taxa, respectively. New intertaxon distances are defined that can be calculated from these…
Extending the `metric spaces' of Lawvere, we study `real metrics', with values in the extended real line. Formally, this ordered set is a symmetric monoidal closed category, and our structures are enriched categories on the latter.…
We study the existence and construction of sparse supports for hypergraphs derived from subgraphs of a graph $G$. For a hypergraph $(X,\mathcal{H})$, a support $Q$ is a graph on $X$ s.t. $Q[H]$, the graph induced on vertices in $H$ is…
We show that a mobility edge exists in 1D random potentials provided specific long-range correlations. Our approach is based on the relation between binary correlator of a site potential and the localization length. We give the algorithm to…
This is a survey of the theory of real trees and their applications.
In this letter, we reconsider the delicate issue of symmetry and supersymmetry breakings for gauge theories with gauge-field mixings. The purpose is to study generalyzed potentials in the presence of more than a single gauge potential. In…
In classification and forecasting with tabular data, one often utilizes tree-based models. Those can be competitive with deep neural networks on tabular data and, under some conditions, explainable. The explainability depends on the depth…
We present simple models which exhibit some of the remarkable features expected to hold for the as yet unknown non-perturbative formulation of string theories. Among these are: (a) the absence of a background or embedding space for the full…
Algorithmic extension problems of partial graph representations such as planar graph drawings or geometric intersection representations are of growing interest in topological graph theory and graph drawing. In such an extension problem, we…
We introduce the graph theoretical parameter of edge treewidth. This parameter occurs in a natural way as the tree-like analogue of cutwidth or, alternatively, as an edge-analogue of treewidth. We study the combinatorial properties of…
We study cut algebras which are toric rings associated to graphs. The key idea is to consider suitable retracts to understand algebraic properties and invariants of such algebras like being a complete intersection, having a linear…
We investigate the influence of diffraction on the statistics of energy levels in quantum systems with a chaotic classical limit. By applying the geometrical theory of diffraction we show that diffraction on singularities of the potential…
Designing well-connected graphs is a fundamental problem that frequently arises in various contexts across science and engineering. The weighted number of spanning trees, as a connectivity measure, emerges in numerous problems and plays a…
We study Besov capacities in a compact Ahlfors regular metric measure space by means of hyperbolic fillings of the space. This approach is applicable even if the space does not support any Poincar\'e inequalities. As an application of the…
We study infinite tree and ultrametric matrices, and their action on the boundary of the tree. For each tree matrix we show the existence of a symmetric random walk associated to it and we study its Green potential. We provide a…
Let $\mathbf G$ be a graphing, that is a Borel graph defined by $d$ measure preserving involutions. We prove that if $\mathbf G$ is {\em treeable} then it arises as the local limit of some sequence $(G_n)_{n\in\mathbb{N}}$ of graphs with…
The secular manifold $\Sigma_G$ and its singularities are intimately related to the spectra of metric graphs $(G,\ell)$. In this paper, we present a complete description of the singular locus for tree graphs, and confirm that it agrees with…