Related papers: Potential Theory on Trees, Graphs and Ahlfors Regu…
For a fixed set $X$, an arbitrary \textit{weight structure} $d \in [0,\infty]^{X \times X}$ can be interpreted as a distance assignment between pairs of points on $X$. Restrictions (i.e. \textit{metric axioms}) on the behaviour of any such…
A self-contained account of the theory of structure trees for edge cuts in networks is given. Applications include a generalisation of the Max-Flow Min-Cut Theorem to infinite networks and a short proof of a conjecture of Kropholler. This…
Dynamic graph theory is a novel, growing area that deals with graphs that change over time and is of great utility in modelling modern wireless, mobile and dynamic environments. As a graph evolves, possibly arbitrarily, it is challenging to…
Associated to any finite metric space are a large number of objects and quantities which provide some degree of structural or geometric information about the space. In this paper we show that in the setting of subsets of weighted Hamming…
The $f(R)$ theory of gravity can be expressed as a scalar tensor theory with a scalar degree of freedom $\phi$. By a conformal transformation, the action and its Gibbons-York-Hawking boundary term are written in the Einstein frame and the…
In this article, we try to complete the regularity implications between the regularitites of the well-known tree forcing notions at the $\boldsymbol{\Delta}^1_2$ level of the projective hierarchy. The missing links in this case were the…
In this paper we examine some natural ideal conditions and show how graphs can be defined that give a visualization of these conditions. We examine the interplay between the multiplicative ideal theory and the graph theoretic structure of…
We apply the matrix-tree theorem to establish a link between various diagrammatic and determinant expressions, which naturally appear in scattering amplitudes of gravity theories. Using this link we are able to give a general…
We study probability distributions over free algebras of trees. Probability distributions can be seen as particular (formal power) tree series [Berstel et al 82, Esik et al 03], i.e. mappings from trees to a semiring K . A widely studied…
For a hereditary graph class $\mathcal{H}$, the $\mathcal{H}$-elimination distance of a graph $G$ is the minimum number of rounds needed to reduce $G$ to a member of $\mathcal{H}$ by removing one vertex from each connected component in each…
A graph is regularizable if it is possible to assign weights to its edges so that all nodes have the same degree. Weights can be positive, nonnegative or arbitrary as soon as the regularization degree is not null. Positive and nonnegative…
We introduce the problem of finding a spanning tree along with a partition of the tree edges into fewest number of feasible sets, where constraints on the edges define feasibility. The motivation comes from wireless networking, where we…
The space of couplings of a given theory is the arena of interest in this article. Equipped with a metric ansatz akin to the Fisher information matrix in the space of parameters in statistics (similar metrics in physics are the…
For a graph G, its rth power is constructed by placing an edge between two vertices if they are within distance r of each other. In this note we study the amount of edges added to a graph by taking its rth power. In particular we obtain…
We investigate connections between the symmetries (automorphisms) of a graph and its spectral properties. Whenever a graph has a symmetry, i.e. a nontrivial automorphism $\phi$, it is possible to use $\phi$ to decompose any matrix…
On two subspaces of the Bruhat-Tits tree, effective actions are calculated. The limits of these effective field theories are found to be the same conformal field theory over p-adic numbers when subspaces are taken to the boundary of the…
Inspired by a concept in comparative genomics, we investigate properties of randomly chosen members of G_1(m,n,t), the set of bipartite graphs with $m$ left vertices, n right vertices, t edges, and each vertex of degree at least one. We…
Based on solid theoretical foundations, we present strong evidences that a number of real-life networks, taken from different domains like Internet measurements, biological data, web graphs, social and collaboration networks, exhibit…
We discuss topological versions of the closed graph theorem, where continuity is inferred from near continuity in tandem with suitable conditions on source or target spaces. We seek internal characterizations of spaces satisfying a closed…
We prove potential automorphy results for a single Galois representation $G_F \rightarrow GL_n(\overline{\mathbb{Q}}_l)$ where $F$ is a CM number field. The strategy is to use the $p,q$ switch trick and modify the Dwork motives employed in…