Results 141 to 150 of about 63,637 (247)
Signal Subgraph Estimation Via Vertex Screening
, 2018 Graph classification and regression have wide applications in a variety of domains. A graph is a complex and high-dimensional object, which poses great challenges to traditional machine learning algorithms.
Badea, Alexandra +4 more
core
Correlation networks in economics and finance: A review of methodologies and bibliometric analysis
Journal of Economic Surveys, Volume 39, Issue 3, Page 1252-1286, July 2025.Abstract This paper presents an in‐depth review of the methodologies and innovations in the study of correlation networks in economics and finance. We explore the development of filtering algorithms and distance measures, emphasizing their critical role in extracting meaningful financial interconnections.
Hamidreza Esmalifalak +1 more
wiley +1 more source
Hamilton cycles in almost distance-hereditary graphs
Open Mathematics, 2016 Let G be a graph on n ≥ 3 vertices. A graph G is almost distance-hereditary if each connected induced subgraph H of G has the property dH(x, y) ≤ dG(x, y) + 1 for any pair of vertices x, y ∈ V(H).
Chen Bing, Ning Bo
doaj +1 more source
Advanced Science, Volume 12, Issue 23, June 20, 2025.DeepCCDS leverages prior knowledge and self‐supervised learning to model cancer driver signals for drug sensitivity prediction. It captures complex regulatory patterns enabling more biologically informed representations. The framework outperforms existing methods across datasets, offering improved accuracy and interpretability.
Jiashuo Wu +10 more
wiley +1 more source
Advanced Science, Volume 12, Issue 23, June 20, 2025.This work introduces a novel photonic Bayesian neural network architecture that utilizes tunable photonic random number generators to independently control weight distribution parameters, significantly improving robustness, scalability, and accuracy while demonstrating practical applications in multimodal data processing and uncertainty‐aware computing.
Yangyang Zhuge +9 more
wiley +1 more source
Structural properties of graph products
Journal of Graph Theory, Volume 109, Issue 2, Page 107-136, June 2025.Abstract Dujmovć, Joret, Micek, Morin, Ueckerdt, and Wood established that every planar graph is a subgraph of the strong product of a graph with bounded treewidth and a path. Motivated by this result, this paper systematically studies various structural properties of cartesian, direct and strong products.
Robert Hickingbotham, David R. Wood
wiley +1 more source
Single‐conflict colorings of degenerate graphs
Journal of Graph Theory, Volume 109, Issue 2, Page 170-183, June 2025.Abstract We consider the single‐conflict coloring problem, a graph coloring problem in which each edge of a graph receives a forbidden ordered color pair. The task is to find a vertex coloring such that no two adjacent vertices receive a pair of colors forbidden at an edge joining them.
Peter Bradshaw, Tomáš Masařík
wiley +1 more source
Groups with triangle‐free graphs on p$p$‐regular classes
Mathematische Nachrichten, Volume 298, Issue 6, Page 1796-1807, June 2025.Abstract Let p$p$ be a prime. In this paper, we classify the p$p$‐structure of those finite p$p$‐separable groups such that, given any three non‐central conjugacy classes of p$p$‐regular elements, two of them necessarily have coprime lengths.
M. J. Felipe +2 more
wiley +1 more source
Exact and Heuristic Solution Approaches for the Cluster Deletion Problem on General Graphs
Networks, Volume 85, Issue 4, Page 351-367, June 2025.ABSTRACT A cluster graph is a disjoint union of cliques, obtained by clustering the nodes of a given network and then removing the edges between nodes assigned to different clusters. The Cluster Deletion problem asks for the smallest subset of edges to be removed from a network in order to produce a cluster graph, which is equivalent to determining the
Giuseppe Ambrosio +4 more
wiley +1 more source