Results 41 to 50 of about 608,783 (278)
Reducing bias through directed acyclic graphs
Background The objective of most biomedical research is to determine an unbiased estimate of effect for an exposure on an outcome, i.e. to make causal inferences about the exposure.
Platt Robert W, Shrier Ian
doaj +1 more source
Directed hypergraph attention network for traffic forecasting
In traffic systems, traffic forecasting is a critical issue, which has attracted much interest from researchers. It is a challenging task due to the complex spatial‐temporal patterns of traffic data.
Xiaoyi Luo, Jiaheng Peng, Jun Liang
doaj +1 more source
Hierarchy Depth in Directed Networks
In this study, we explore the depth measures for flow hierarchy in directed networks. Two simple measures are defined—rooted depth and relative depth—and their properties are discussed. The method of loop collapse is introduced, allowing investigation of
Krzysztof Suchecki, Janusz A. Hołyst
doaj +1 more source
The concept of a line digraph is generalized to that of a directed path graph. The directed path graph $\overrightarrow P_k(D)$ of a digraph D is obtained by representing the directed paths on k vertices of D by vertices.
Broersma, Hajo, Li, Xueliang
core +1 more source
A Bibliometric Analysis of Publications in Uremic Toxins From 1991 to 2024
ABSTRACT Background Uremic toxins are a growing area of research in nephrology, with significant implications in the progression and treatment of chronic kidney disease (CKD) and the management of end‐stage kidney disease (ESKD). This bibliometric analysis aims to evaluate the global research trends, key contributors, and the impact of publications in ...
Yuh‐Shan Ho +7 more
wiley +1 more source
The storage capacity of a directed graph and nodewise autonomous, ubiquitous learning
The brain, an exceedingly intricate information processing system, poses a constant challenge to memory research, particularly in comprehending how it encodes, stores, and retrieves information.
Hui Wei, Fushun Li
doaj +1 more source
Finitely Dependent Insertion Processes
A $q$-coloring of $\mathbb Z$ is a random process assigning one of $q$ colors to each integer in such a way that consecutive integers receive distinct colors. A process is $k$-dependent if any two sets of integers separated by a distance greater than $k$
Levy, Avi
core +1 more source
Directed triangles in directed graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Enteropathogenic E. coli (EPEC) infects the human intestinal epithelium, resulting in severe illness and diarrhoea. In this study, we compared the infection of cancer‐derived cell lines with human organoid‐derived models of the small intestine. We observed a delayed in attachment, inflammation and cell death on primary cells, indicating that host ...
Mastura Neyazi +5 more
wiley +1 more source
Directed strongly walk-regular graphs
We generalize the concept of strong walk-regularity to directed graphs. We call a digraph strongly $\ell$-walk-regular with $\ell >1$ if the number of walks of length $\ell$ from a vertex to another vertex depends only on whether the two vertices are the
Omidi, Gholamreza, van Dam, Edwin R.
core +1 more source

