Orientations of Graphs With at Most One Directed Path Between Every Pair of Vertices
ABSTRACT Given a graph G, we say that an orientation D of G is a KT orientation if, for all u , v ∈ V ( D ), there is at most one directed path (in any direction) between u and v. Graphs that admit such orientations have been used to construct graphs with large chromatic number and small clique number that served as counterexamples to various ...
Barbora Dohnalová +3 more
wiley +1 more source
Topological, Compositional, and Dynamic Information in Chemical Reaction Systems
Chemical reaction systems transform and organize information encoded in molecular structure, composition and environmental inputs. Reaction topology constrains how information propagates through a network, shaping both compositional outcomes and dynamic responses.
William E. Robinson
wiley +1 more source
Metric spaces with small rough angles and the rectifiability of rough self‐contracted curves
Abstract The small rough angle (SRA$\operatorname{SRA}$) condition, introduced by Zolotov in arXiv:1804.00234, captures the idea that all angles formed by triples of points in a metric space are small. In the first part of the paper, we develop the theory of metric spaces (X,d)$(X,d)$ satisfying the SRA(α)$\operatorname{SRA}(\alpha)$ condition for some
Estibalitz Durand Cartagena +1 more
wiley +1 more source
Topology‐Aware Deep Learning on Higher‐Order Structures for Drug Response Prediction
We present TopDr, a topology‐aware deep learning framework that encodes both drugs and cell lines as multiscale simplicial complexes, capturing interactions at the 0‐, 1‐, and 2‐simplex levels. By jointly integrating local higher‐order neighborhoods and global topological structures, TopDr generates enriched representations for sensitivity prediction ...
Cong Shen +3 more
wiley +1 more source
Supervised Restricted Data Fusion With Common, Local, and Distinct Components
ABSTRACT In multi‐block data, the dominant sources of variation are not always most relevant to a response of interest, meaning that purely exploratory decompositions may fail to recover subtle but important response‐associated structure. We introduce PESCAR, a supervised extension of Penalised Exponential Simultaneous Component Analysis (PESCA) that ...
Fred T. G. White +6 more
wiley +1 more source
Finding an almost perfect matching in a hypergraph avoiding forbidden submatchings
Abstract In 1973, Erdős conjectured the existence of high girth (n,3,2)$(n,3,2)$‐Steiner systems. Recently, Glock, Kühn, Lo, and Osthus and independently Bohman and Warnke proved the approximate version of Erdős' conjecture. Recently, Kwan, Sah, Sawhney, and Simkin proved Erdős' conjecture.
Michelle Delcourt, Luke Postle
wiley +1 more source
CF‐SBERTHet: Collaborative and Textual Knowledge Enhanced Semantic Graphs for Sparse Recommendations
ABSTRACT Modern e‐commerce platforms face a critical challenge: delivering accurate recommendations under extreme user–item interaction sparsity, where textual context remains systematically underutilised. Existing collaborative filtering methods degrade sharply in sparse settings, while semantic approaches fail to capture collaborative patterns ...
He Ma +7 more
wiley +1 more source
From points to complexes: A concept of unexpectedness for simplicial complexes
Abstract In 2018, Cook, Harbourne, Migliore, and Nagel introduced the concept of unexpected hypersurfaces, which connects the study of Lefschetz properties of Artinian algebras defined by powers of linear forms to a family of interpolation problems.
Thiago Holleben
wiley +1 more source
We propose MSSM+, an extension of multiscale structural mapping (MSSM), together with surface supervertex mapping (SSVM) and a Supervertex Vision Transformer (SV‐ViT). Together, these methods exhibited better performance in detecting Alzheimer's disease and less variability across MR vendors than MSSM.
Geonwoo Baek +3 more
wiley +1 more source
Solution of road network problem with the help of m-polar fuzzy graph using isometric and antipodal concept. [PDF]
Mondal U, Mahapatra T, Xin Q, Pal M.
europepmc +1 more source

