Results 101 to 110 of about 62,209 (271)

Airflow Directed Acyclic Graph

, 2019
{"references": ["1.\tA. Barker, J. Van Hemert (2007), \"Scientific workflow: a survey and research directions\", International Conference on Parallel Processing and Applied Mathematics. Springer,pp. 746\u2013753", "2.\tM. Cieslik, C. Mura (2014), \"Papy: Parallel and distributed data-processing pipelines in python\", arXiv preprint arXiv: 1407.4378 ...
G, Shubha B, A.M.Prasad
openaire   +1 more source

Neurodevelopmental variations cascading from age 10 months to 3 years leading to attention‐deficit hyperactivity disorder/autism traits at age 9 in a general population

JCPP Advances, EarlyView.
Associations of neurodevelopmental measures (Z‐scores of gross motor, visual reception, fine motor, receptive language, expressive language) at ages 10, 14, 18, 24, 32, and 40 months with (a) attention‐deficit/hyperactivity disorder trait, (b) autism spectrum disorder trait, (c) developmental coordination disorder trait, and (d) intellectual ...
Kenji J. Tsuchiya, Nagahide Takahashi, Yoko Nomura, Jeffrey H. Newcorn, Shigenobu Toda, Yuuka Ishikawa‐Omori, Akemi Okumura, Mohammad Shafiur Rahman, Toshiki Iwabuchi, Taeko Harada, Ikue Hirata, Chikako Nakayasu, Yuko Amma, Haruka Suzuki, Tomoko Nishimura   +14 more
wiley   +1 more source

On the causal interpretation of acyclic mixed graphs under multivariate normality [PDF]

, 2013
In multivariate statistics, acyclic mixed graphs with directed and bidirected edges are widely used for compact representation of dependence structures that can arise in the presence of hidden (i.e., latent or unobserved) variables.
Drton, Mathias, Fox, Christopher J., Käufl, Andreas   +2 more
core  

Random Generation of Directed Acyclic Graphs

Electronic Notes in Discrete Mathematics, 2001
Abstract Abstract We propose a simple algorithm based on a Markov chain for generating acyclic digraphs with a given number of vertices uniformly at random. In addition, standard combinatorial techniques allow us to describe the overall shape and average edge density of an acyclic digraph.
Melançon, Guy, Dutour, Isabelle, Bousquet-Mélou, Mireille   +2 more
openaire   +2 more sources

Upper Bounds on the Minimum Size of Feedback Arc Set of Directed Multigraphs With Bounded Degree

Journal of Graph Theory, EarlyView.
ABSTRACT An oriented multigraph is a directed multigraph without directed 2‐cycles. Let fas ( D ) $\text{fas}(D)$ denote the minimum size of a feedback arc set in an oriented multigraph D $D$. In several papers, upper bounds for fas ( D ) $\text{fas}(D)$ were obtained for oriented multigraphs D $D$ with maximum degree upper‐bounded by a constant ...
Gregory Gutin, Hui Lei, Anders Yeo, Yacong Zhou   +3 more
wiley   +1 more source

Random acyclic networks

, 2009
Directed acyclic graphs are a fundamental class of networks that includes citation networks, food webs, and family trees, among others. Here we define a random graph model for directed acyclic graphs and give solutions for a number of the model's ...
B. Bollobás, B. Bollobás, Brian Karrer, J. S. Ide, M. E. J. Newman, M. Molloy, P. Erdős   +6 more
core   +1 more source

Direct construction of compact directed acyclic word graphs [PDF]

, 1997
The Directed Acyclic Word Graph (DAWG) is an efficient data structure to treat and analyze repetitions in a text, especially in DNA genomic sequences. Here, we consider the Compact Directed Acyclic Word Graph of a word. We give the first direct algorithm to construct it. It runs in time linear in the length of the string on a fixed alphabet.
Crochemore, Maxime, Vérin, Renaud
openaire   +2 more sources

Long Induced Paths in K s , s ${K}_{s,s}$‐Free Graphs

Journal of Graph Theory, EarlyView.
ABSTRACT More than 40 years ago, Galvin, Rival, and Sands showed that every K s , s ${K}_{s,s}$‐free graph containing an n $n$‐vertex path must contain an induced path of length f ( n ) $f(n)$, where f ( n ) → ∞ $f(n)\to \infty $ as n → ∞ $n\to \infty $. Recently, it was shown by Duron, Esperet, and Raymond that one can take f ( n ) = ( log log n ) 1 /
Zach Hunter, Aleksa Milojević, Benny Sudakov, István Tomon   +3 more
wiley   +1 more source

An approach for finding causal relations in environmental systems: with an application to understand drivers of a toxic algal bloom

Ecological Processes
Background Discovering causality in environmental systems is challenging because frequently controlled experiments or numerical simulations are difficult. Algorithms to learn directed acyclic graphs from system data are powerful, but they often result in
Benny Selle
doaj   +1 more source

Penalized Estimation of Directed Acyclic Graphs From Discrete Data

, 2018
Bayesian networks, with structure given by a directed acyclic graph (DAG), are a popular class of graphical models. However, learning Bayesian networks from discrete or categorical data is particularly challenging, due to the large parameter space and ...
Fu, Fei, Gu, Jiaying, Zhou, Qing
core   +2 more sources