Results 241 to 250 of about 1,258,420 (289)

Weak Exogeneity, Driving Trends and Non‐Causality. Is Dynamic Adjustment Informative About Causality?

Oxford Bulletin of Economics and Statistics, EarlyView.
ABSTRACT In VECMs (or CVARs), the weak exogeneity of some of the variables (for the long‐run parameters) is related to the equilibrium adjustment dynamics. This has sometimes led to the statistical concept of weak exogeneity being given a causal interpretation.
Emanuele Lopetuso, Michael P. Clements
wiley   +1 more source

Assessing Behavioral and Environmental Facets of Obesity Unobtrusively Utilizing Digital Tools: Introducing the BETTER4U Indicators

Obesity Reviews, EarlyView.
ABSTRACT Understanding obesity involves evaluating numerous contributing factors. Collecting the necessary data for this can impose a significant burden on both research participants during clinical studies and real‐life deployments of digital tools aiding obesity management.
Chrysa Episkopou, Dimitrios Aletras, Afroditi Kita, Aleksandra Luszczynska, Maria Kafyra, Eva Karaglani, Yannis Manios, Maira Bes‐Rastrollo, Anna Ek, Ioannis Ioakeimidis, Ioanna Panagiota Kalafati, Ana Rito, Alexis Kyriacou, Anestis Dougkas, Julie Anne Nazare, Louise Seconda, Gillian Santorelli, Vassilios Fanos, Karri Silventoinen, Terho Lehtimäki, George V. Dedoussis, Anastasios Delopoulos, on behalf of the BETTER4U consortium, Project Coordinator George Dedoussis   +23 more
wiley   +1 more source

From complexity to clarity: how directed acyclic graphs enhance the study design of systematic reviews and meta-analyses. [PDF]

Eur J Epidemiol
Dijk SW, Caulley LM, Hunink M, Labrecque J.   +3 more
europepmc   +1 more source

Decoding Causality in Periodontal Medicine: Background Factors and Other Sources of Uncertainty

Journal of Periodontal Research, EarlyView.
Philippe Bouchard
wiley   +1 more source

Periodontal Medicine and the Limitations of Linear Causality: Time for a Cybernetic Framework

Journal of Periodontal Research, EarlyView.
Tom Lonsdale
wiley   +1 more source

Mendelian randomization for multiple exposures and outcomes with Bayesian Directed Acyclic Graphs exploration and causal effects estimation

Zuber V, Cronjé T, Cai N, Gill D, Bottolo L.   +4 more
europepmc   +1 more source

Cycle analysis of Directed Acyclic Graphs

Physica A: Statistical Mechanics and Its Applications, 2022
In this paper, we employ the decomposition of a directed network as an undirected graph plus its associated node metadata to characterise the cyclic structure found in directed networks by finding a Minimal Cycle Basis of the undirected graph and augment its components with direction information. We show that only four classes of directed cycles exist,
Paul Expert, Vaiva Vasiliauskaite, Tim S Evans   +2 more
exaly   +7 more sources

Multilevel Algorithms for Acyclic Partitioning of Directed Acyclic Graphs [PDF]

SIAM Journal of Scientific Computing, 2019
Summary: We investigate the problem of partitioning the vertices of a directed acyclic graph into a given number of parts. The objective function is to minimize the number or the total weight of the edges having end points in different parts, which is also known as the edge cut. The standard load balancing constraint of having an equitable partition of
Kamer Kaya, Bora Uçar, Umit Catalyurek
exaly   +7 more sources

Some of the next articles are maybe not open access.

Related searches:

On counting homomorphisms to directed acyclic graphs

Journal of the ACM, 2006
It is known that if P and NP are different then there is an infinite hierarchy of different complexity classes that lie strictly between them. Thus, if P ≠ NP, it is not possible to classify NP using any finite collection of complexity classes. This situation has led to attempts to identify smaller classes of problems within NP where
Martin E. Dyer, Leslie Ann Goldberg, Mike Paterson   +2 more
openaire   +3 more sources

On Mergings in Acyclic Directed Graphs

SIAM Journal on Discrete Mathematics, 2019
Summary: Consider an acyclic directed graph \(G\) with sources \(s_1, s_2, \ldots,s_n\) and sinks \(r_1, r_2, \ldots, r_n\). For \(i=1, 2, \ldots,n\), let \(c_i\) denote the size of the minimum edge cut between \(s_i\) and \(r_i\), which, by Menger's theorem, implies that there exists a group of \(c_i\) edge-disjoint paths from \(s_i\) to \(r_i ...
openaire   +1 more source