Related papers: Infinite weighted graphs with bounded resistance m…
Suppose a finite, unweighted, combinatorial graph $G = (V,E)$ is the union of several (degree-)regular graphs which are then additionally connected with a few additional edges. $G$ will then have only a small number of vertices $v \in V$…
In recent years, considerable advances have been made in the study of properties of metric spaces in terms of their doubling dimension. This line of research has not only enhanced our understanding of finite metrics, but has also resulted…
A realisation of a metric $d$ on a finite set $X$ is a weighted graph $(G,w)$ whose vertex set contains $X$ such that the shortest-path distance between elements of $X$ considered as vertices in $G$ is equal to $d$. Such a realisation…
Given an infinite connected graph $G$, a way to randomly perturb its metric is to assign random i.i.d. lengths to the edges of the graph, a process called first-passage percolation. Assume that the graph is infinite and of bounded degree.…
We investigate a graph theoretic analog of geodesic geometry. In a graph $G=(V,E)$ we consider a system of paths $\mathcal{P}=\{P_{u,v}|u,v\in V\}$ where $P_{u,v}$ connects vertices $u$ and $v$. This system is consistent in that if vertices…
Resistance distance has been studied extensively in the past years, with the majority of previous studies devoted to undirected networks, in spite of the fact that various realistic networks are directed. Although several generalizations of…
A real valued function $\varphi$ of one variable is called a metric transform if for every metric space $(X,d)$ the composition $d_\varphi = \varphi\circ d$ is also a metric on $X$. We give a complete characterization of the class of…
Let $G$ be a group. The \emph{power graph} of $G$ is a graph with the vertex set $G$, having an edge between two elements whenever one is a power of the other. We characterize nilpotent groups whose power graphs have finite independence…
A positive function (conductivity) on the edges of a graph induces the Dirichlet-to- Neumann map between boundary values of harmonic functions. The inverse conductivity problem is to find the conductivity from the Dirichlet-to-Neumann map.…
We define direct sums and a corresponding notion of connectedness for graph limits. Every graph limit has a unique decomposition as a direct sum of connected components. As is well-known, graph limits may be represented by symmetric…
A mixed graph $G$ is a graph that consists of both undirected and directed edges. An orientation of $G$ is formed by orienting all the undirected edges of $G$, i.e., converting each undirected edge $\{u,v\}$ into a directed edge that is…
We study the problem of distance-preserving graph compression for weighted paths and trees. The problem entails a weighted graph $G = (V, E)$ with non-negative weights, and a subset of edges $E^{\prime} \subset E$ which needs to be removed…
We give a criterion of the form Q(d)c(M)<1 for the non-reconstructability of tree-indexed q-state Markov chains obtained by broadcasting a signal from the root with a given transition matrix M. Here c(M) is an explicit function, which is…
An $r$-edge coloring of a graph or hypergraph $G=(V,E)$ is a map $c:E\to \{0, \dots, r-1\}$. Extending results of Rado and answering questions of Rado, Gy\'arf\'as and S\'ark\"ozy we prove that (1.) the vertex set of every $r$-edge colored…
A $\mathbb{T}$-gain graph, $\Phi = (G, \varphi)$, is a graph in which the function $\varphi$ assigns a unit complex number to each orientation of an edge, and its inverse is assigned to the opposite orientation. The associated adjacency…
A vertex set $U \subseteq V$ of an undirected graph $G=(V,E)$ is a $\textit{resolving set}$ for $G$, if for every two distinct vertices $u,v \in V$ there is a vertex $w \in U$ such that the distances between $u$ and $w$ and the distance…
In this paper we study the dimension spectrum of general conformal graph directed Markov systems modeled by countable state symbolic subshifts of finite type. We perform a comprehensive study of the dimension spectrum addressing questions…
We calculate effective impedances of infinite $LC$- and $CL$- ladder networks as limits of effective impedances of finite network approximations, using a new method, which involves precise mathematical concepts. These concepts are related…
We compute the free energy and surface tension function for the five-vertex model, a model of non-intersecting monotone lattice paths on the grid in which each corner gets a positive weight. We give a variational principle for limit shapes…
If $S=\{v_1,\ldots, v_k\}$ is an ordered subset of vertices of a connected graph $G$ and $e$ is an edge of $G$, then the vector $r_G(e|S) = (d_G(v_1,e), \ldots, d_G(v_k,e))$ is the edge metric $S$-representation of $e$. If the vertices of…