Related papers: Variations of the eccentricity and their propertie…
We consider growing random recursive trees in random environment, in which at each step a new vertex is attached (by an edge of a random length) to an existing tree vertex according to a probability distribution that assigns the tree…
Recent theoretical and empirical studies have focused on the structural properties of complex relational networks in social, biological and technological systems. Here we study the basic properties of twenty 1-square-mile samples of street…
A cluster tree provides a highly-interpretable summary of a density function by representing the hierarchy of its high-density clusters. It is estimated using the empirical tree, which is the cluster tree constructed from a density…
The reconstruction of a central tendency `species tree' from a large number of conflicting gene trees is a central problem in systematic biology. Moreover, it becomes particularly problematic when taxon coverage is patchy, so that not all…
We show the density theorem for the class of finite oriented trees ordered by the homomorphism order. We also show that every interval of oriented trees, in addition to be dense, is in fact universal. We end by considering the fractal…
Consider a discrete uniformly elliptic divergence form equation on the $d$ dimensional lattice $\Z^d$ with random coefficients. It has previously been shown that if the random environment is translational invariant, then the averaged…
The \emph{eccentricity} of a vertex $u$ in a graph $G$, denoted by $e_G(u)$, is the maximum distance from $u$ to other vertices in $G$. We study extremal problems for the average eccentricity and the first and second Zagreb eccentricity…
Many discrete optimization problems amount to selecting a feasible set of edges of least weight. We consider in this paper the context of spatial graphs where the positions of the vertices are uncertain and belong to known uncertainty sets.…
The Wiener index of a graph is the sum of the distances between all pairs of vertices, it has been one of the main descriptors that correlate achemical compound's molecular graph with experimentally gathered data regarding the compound's…
The subtrees and BC-subtrees (subtrees where any two leaves are at even distance apart) have been extensively studied in recent years. Such structures, under special constraints on degrees, have applications in many fields. Through an…
We study the inertia of distance matrices of weighted graphs. Our novel congruence-based proof of the inertia of weighted trees extends to a proof for the inertia of weighted unicyclic graphs whose cycle is a triangle. Partial results are…
We consider the problem of finding the smallest graph that contains two input trees each with at most $n$ vertices preserving their distances. In other words, we look for an isometric-universal graph with the minimum number of vertices for…
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…
The purpose of this article is twofold. On one hand, we reveal the equivalence of shift of finite type between a one-sided shift $X$ and its associated hom tree-shift $\mathcal{T}_{X}$, as well as the equivalence in the sofic shift. On the…
We study random integer-valued Lipschitz functions on regular trees. It was shown by Peled, Samotij and Yehudayoff that such functions are localized, however, finer questions about the structure of Gibbs measures remain unanswered. Our main…
We develop a new sampling method to estimate eigenvector centrality on incomplete networks. Our goal is to estimate this global centrality measure having at disposal a limited amount of data. This is the case in many real-world scenarios…
We study the conditions under which the isometry of spaces with metrics generated by weights given on the edges of finite trees is equivalent to the isomorphism of these trees. Similar questions are studied for ultrametric spaces generated…
In this article, after recalling and discussing the conventional extremality, local extremality, stationarity and approximate stationarity properties of collections of sets and the corresponding (extended) extremal principle, we focus on…
This is a preliminary study of the equation of motion of Euclidean classical gravity on a graph, based on the Lin-Lu-Yau Ricci curvature on graphs. We observe that the constant edge weights configuration gives the unique solution on an…
Let $T$ be a tree with induced partial order $\preceq$. We investigate centered Gaussian processes $X=(X_t)_{t\in T}$ represented as $$ X_t=\sigma(t)\sum_{v \preceq t}\alpha(v)\xi_v $$ for given weight functions $\alpha$ and $\sigma$ on $T$…