Results 111 to 120 of about 2,687,568 (346)
Tree sets are posets with additional structure that generalize tree-like objects in graphs, matroids, or other combinatorial structures. They are a special class of abstract separation systems. We study infinite tree sets and how they relate to the finite tree sets they induce, and obtain a characterization of infinite tree sets in combinatorial terms.
arxiv
Limit Laws for Functions of Fringe trees for Binary Search Trees and Recursive Trees [PDF]
We prove limit theorems for sums of functions of subtrees of binary search trees and random recursive trees. In particular, we give simple new proofs of the fact that the number of fringe trees of size $ k=k_n $ in the binary search tree and the random ...
Holmgren, Cecilia, Janson, Svante
core
In this study, the mechanical response of Y‐shaped core sandwich beams under compressive loading is investigated, using deep feed‐forward neural networks (DFNNs) for predictive modeling. The DFNN model accurately captures stress–strain behavior, influenced by design parameters and loading rates.
Ali Khalvandi+4 more
wiley +1 more source
Eucalyptus is an important plantation tree with a high economic value in China. The tree contributes significantly to China’s timber production. The stable and efficient Eucalyptus regeneration system and genetic transformation system are of great ...
Youshuang Wang+3 more
doaj +1 more source
Computing the Fréchet distance of trees and graphs of bounded tree width [PDF]
We give algorithms to compute the Fr\'echet distance of trees and graphs with bounded tree width. Our algorithms run in $O(n^2)$ time for trees of bounded degree, and $O(n^2\sqrt{n \log n})$ time for trees of arbitrary degree. For graphs of bounded tree width we show one can compute the Fr\'echet distance in FPT (fixed parameter tractable) time.
arxiv
Machine Learning‐Guided Discovery of Factors Governing Deformation Twinning in Mg–Y Alloys
This study uses interpretable machine learning to identify key microstructural and processing parameters related to twinning in magnesium‐yttrium (Mg–Y) alloys. It is identified that using only grain size, grain orientation, and total applied strain, grains can be classified with 84% accuracy based on whether the grain contains a twin.
Peter Mastracco+8 more
wiley +1 more source
Non-Contiguous Pattern Avoidance in Binary Trees [PDF]
In this paper we consider the enumeration of binary trees avoiding non-contiguous binary tree patterns. We begin by computing closed formulas for the number of trees avoiding a single binary tree pattern with 4 or fewer leaves and compare these results to analogous work for contiguous tree patterns.
arxiv
Clique trees of infinite locally finite chordal graphs [PDF]
We investigate clique trees of infinite locally finite chordal graphs. Our main contribution is a bijection between the set of clique trees and the product of local finite families of finite trees.
Hofer-Temmel, Christoph, Lehner, Florian
core +1 more source
We consider random dynamics on the edges of a uniform Cayley tree with $n$ vertices, in which edges are either inflammable, fireproof, or burt. Every inflammable edge is replaced by a fireproof edge at unit rate, while fires start at smaller rate $n^{- }$ on each inflammable edge, then propagate through the neighboring inflammable edges and are only ...
openaire +4 more sources
Beyond Order: Perspectives on Leveraging Machine Learning for Disordered Materials
This article explores how machine learning (ML) revolutionizes the study and design of disordered materials by uncovering hidden patterns, predicting properties, and optimizing multiscale structures. It highlights key advancements, including generative models, graph neural networks, and hybrid ML‐physics methods, addressing challenges like data ...
Hamidreza Yazdani Sarvestani+4 more
wiley +1 more source