Results 101 to 110 of about 279,078 (329)
Discrete Mathematics, 1991 The author gives an introductory survey of the theory of simplicial and related decompositions of graphs. It is based mainly on his recent book ``Graph decompositions. A study in infinite graph theory'' (1990; Zbl 0726.05001). Several open problems are presented.
openaire +1 more source
Real‐World Performance of CSF Kappa Free Light Chains in the 2024 McDonald Criteria
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective Kappa free light chains (KFLCs) in the cerebrospinal fluid (CSF) have a similar performance to CSF‐restricted oligoclonal bands (OCB) for multiple sclerosis (MS) diagnosis. To help with implementation, we set out to resolve several remaining uncertainties: (1) performance in a real‐world cohort and the 2024 McDonald criteria; (2 ...
Maya M. Leibowitz +11 more
wiley +1 more source
Correlation Decay up to Uniqueness in Spin Systems
, 2012 We give a complete characterization of the two-state anti-ferromagnetic spin systems which are of strong spatial mixing on general graphs. We show that a two-state anti-ferromagnetic spin system is of strong spatial mixing on all graphs of maximum degree
Li, Liang, Lu, Pinyan, Yin, Yitong
core
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective To delineate specific in vivo white matter pathology in neuronal intranuclear inclusion disease (NIID) using diffusion spectrum imaging (DSI) and define its clinical relevance. Methods DSI was performed on 42 NIID patients and 38 matched controls.
Kaiyan Jiang +10 more
wiley +1 more source
Reconstructing infinite graphs [PDF]
Pacific Journal of Mathematics, 1974 Bondy, J. A., Hemminger, R. L.
openaire +2 more sources
International Journal of Adaptive Control and Signal Processing, EarlyView.Workflow of the parameter optimization process for ITSC fault detection, applying Differential Evolution optimization and the Smooth Pseudo Wigner‐Ville Distribution for signal processing. The optimized parameters are then used in the failure identification pipeline, which combines the signal processing with a YOLO‐based architecture for fault severity
Rafael Martini Silva +4 more
wiley +1 more source
A Note on Pseudofinite Acyclic Graphs
Известия Иркутского государственного университета: Серия "Математика"Acyclic graphs approximated by finite acyclic graphs are considered. It is proved that any countably categorical acyclic graph is smoothly approximable. An example of pseudofinite acyclic graph theory is given, which has an even, odd, and infinite number
N. D. Markhabatov, Ye. R. Baissalov
doaj +1 more source
Centrosymmetric Graphs And A Lower Bound For Graph Energy Of Fullerenes
Discussiones Mathematicae Graph Theory, 2014 The energy of a molecular graph G is defined as the summation of the absolute values of the eigenvalues of adjacency matrix of a graph G. In this paper, an infinite class of fullerene graphs with 10n vertices, n ≥ 2, is considered.
Katona Gyula Y. +2 more
doaj +1 more source
Cheeger estimates of Dirichlet-to-Neumann operators on infinite subgraphs of graphs
, 2023 Bobo Hua, Yan Huang, Zuoqin Wang
openalex +2 more sources
Data‐Driven Distributed Safe Control Design for Multi‐Agent Systems
International Journal of Adaptive Control and Signal Processing, EarlyView.This paper presents a data‐driven control barrier function (CBF) technique for ensuring safe control of multi‐agent systems (MASs) with uncertain linear dynamics. A data‐driven quadratic programming (QP) optimization is first developed for CBF‐based safe control of single‐agent systems using a nonlinear controller. This approach is then extended to the
Marjan Khaledi, Bahare Kiumarsi
wiley +1 more source