Improved methods to compare distance metrics in networks using uniform random spanning trees (DIMECOST)
Sign Up to like & getrecommendations! Published in 2020 at "Networks"
DOI: 10.1002/net.21949
Abstract: We consider the network analytics problem of comparing two distance metrics on the same set of n entities. The classical solution to this problem is the Mantel test, which uses permutation testing to accept or… read more here.
Keywords: distance metrics; uniform random; spanning trees; random spanning ... See more keywords
The local limit of uniform spanning trees
Sign Up to like & getrecommendations! Published in 2021 at "Probability Theory and Related Fields"
DOI: 10.1007/s00440-021-01072-2
Abstract: We show that the local limit of the uniform spanning tree on any finite, simple, connected, regular graph sequence with degree tending to $$\infty $$ ∞ is the Poisson(1) branching process conditioned to survive forever.… read more here.
Keywords: local limit; uniform spanning; spanning trees; limit uniform ... See more keywords
Spanning Trees of Bounded Degree, Connectivity, Toughness, and the Spectrum of a Graph
Sign Up to like & getrecommendations! Published in 2020 at "Bulletin of the Iranian Mathematical Society"
DOI: 10.1007/s41980-020-00375-9
Abstract: Recently, Cioabǎ and Gu obtained a relationship between the spectrum of a regular graph and the existence of spanning trees of bounded degree, generalized connectivity and toughness, respectively. In this paper, motivated by the idea… read more here.
Keywords: bounded degree; spanning trees; connectivity; trees bounded ... See more keywords
Obtaining all extreme rays of a special cone using spanning trees in a complete digraph: application in DEA
Sign Up to like & getrecommendations! Published in 2018 at "Journal of the Operational Research Society"
DOI: 10.1057/s41274-017-0265-9
Abstract: This paper presents a new method which can be used in two different situations: Firstly, for converting certain polyhedral cones of intersection form to cones of sum form, this method identifies all the extreme rays… read more here.
Keywords: spanning trees; obtaining extreme; extreme rays; complete digraph ... See more keywords
Scaling laws of chemical and Euclidean distances in critical percolation trees.
Sign Up to like & getrecommendations! Published in 2025 at "Physical review. E"
DOI: 10.1103/cthn-nh7b
Abstract: We study the scaling behavior of chemical distances in spanning trees of critical site percolation clusters. Precisely, we analyze spanning trees constructed using four different algorithms: minimal path trees (MPTs), depth-first search (DFS), right-first search… read more here.
Keywords: chemical euclidean; scaling laws; spanning tree; percolation ... See more keywords
Spanning trees of recursive scale-free graphs.
Sign Up to like & getrecommendations! Published in 2022 at "Physical review. E"
DOI: 10.1103/physreve.105.024312
Abstract: We present a link-by-link rule-based method for constructing all members of the ensemble of spanning trees for any recursively generated, finitely articulated graph, such as the Dorogovtsev-Goltsev-Mendes (DGM) net. The recursions allow for many large-scale… read more here.
Keywords: free graphs; trees recursive; scale free; graphs ... See more keywords
Constructing Independent Spanning Trees on Transposition Networks
Sign Up to like & getrecommendations! Published in 2020 at "IEEE Access"
DOI: 10.1109/access.2020.3014822
Abstract: In interconnection networks, data distribution and fault tolerance are crucial services. This study proposes an effective algorithm for improving connections between networks. Transposition networks are a type of Cayley graphs and have been widely used… read more here.
Keywords: trees transposition; transposition networks; constructing independent; spanning trees ... See more keywords
Spanning Trees as Approximation of Data Structures
Sign Up to like & getrecommendations! Published in 2021 at "IEEE Transactions on Visualization and Computer Graphics"
DOI: 10.1109/tvcg.2020.2995465
Abstract: The connections in a graph generate a structure that is independent of a coordinate system. This visual metaphor allows creating a more flexible representation of data than a two-dimensional scatterplot. In this article, we present… read more here.
Keywords: high dimensional; spanning trees; approximation data; stad ... See more keywords
Enumerating the Number of Spanning Trees of Pyramid Graphs Based on Some Nonahedral Graphs
Sign Up to like & getrecommendations! Published in 2025 at "Axioms"
DOI: 10.3390/axioms14030148
Abstract: The enumeration of spanning trees in various graph forms has been made easier by the study of electrically equivalent transformations, which was motivated by Kirchhoff’s work on electrical networks. In this work, using knowledge of… read more here.
Keywords: based nonahedral; nonahedral graphs; enumerating number; spanning trees ... See more keywords
On the Normalized Laplacian and the Number of Spanning Trees of Linear Heptagonal Networks
Sign Up to like & getrecommendations! Published in 2019 at "Mathematics"
DOI: 10.3390/math7040314
Abstract: The normalized Laplacian plays an important role on studying the structure properties of non-regular networks. In fact, it focuses on the interplay between the structure properties and the eigenvalues of networks. Let H n be… read more here.
Keywords: number spanning; heptagonal networks; linear heptagonal; spanning trees ... See more keywords