Results 161 to 170 of about 64,866 (212)

Improving the Finite Sample Estimation of Average Treatment Effects Using Double/Debiased Machine Learning With Propensity Score Calibration

open access: yesJournal of Applied Econometrics, EarlyView.
ABSTRACT Double/debiased machine learning (DML) uses for estimating an average treatment effect (ATE) a double‐robust score function that relies on the prediction of nuisance functions, such as the propensity score, which is the probability of treatment assignment given covariates.
Daniele Ballinari, Nora Bearth
wiley   +1 more source

Causal mediation analysis: selection with asymptotically valid inference. [PDF]

open access: yesJ R Stat Soc Series B Stat Methodol
Jones J, Ertefaie A, Strawderman RL.
europepmc   +1 more source

Colourings of Uniform Group Divisible Designs and Maximum Packings

open access: yesJournal of Combinatorial Designs, EarlyView.
ABSTRACT A weak c $c$‐colouring of a design is an assignment of colours to its points from a set of c $c$ available colours, such that there are no monochromatic blocks. A colouring of a design is block‐equitable, if for each block, the number of points coloured with any available pair of colours differ by at most one.
Andrea C. Burgess   +6 more
wiley   +1 more source

Dynamic Regression of Longitudinal Trajectory Features. [PDF]

open access: yesJ Am Stat Assoc
Ma H, Zhao W, Hanfelt J, Peng L.
europepmc   +1 more source

On Oriented Colourings of Graphs on Surfaces

open access: yesJournal of Graph Theory, EarlyView.
ABSTRACT For an oriented graph G $G$, the least number of colours required to oriented colour G $G$ is called the oriented chromatic number of G $G$ and denoted χ o ( G ) ${\chi }_{o}(G)$. For a non‐negative integer g $g$ let χ o ( g ) ${\chi }_{o}(g)$ be the least integer such that χ o ( G ) ≤ χ o ( g ) ${\chi }_{o}(G)\le \unicode{x0200A}{\chi }_{o}(g)
Alexander Clow
wiley   +1 more source

Fractional List Packing for Layered Graphs

open access: yesJournal of Graph Theory, EarlyView.
ABSTRACT The fractional list packing number χ ℓ • ( G ) ${\chi }_{\ell }^{\bullet }(G)$ of a graph G $G$ is a graph invariant that has recently arisen from the study of disjoint list‐colourings. It measures how large the lists of a list‐assignment L : V ( G ) → 2 N $L:V(G)\to {2}^{{\mathbb{N}}}$ need to be to ensure the existence of a “perfectly ...
Stijn Cambie, Wouter Cames van Batenburg
wiley   +1 more source

A Coarse Geometric Approach to Graph Layout Problems

open access: yesJournal of Graph Theory, EarlyView.
ABSTRACT We define a range of new coarse geometric invariants based on various graph–theoretic measures of complexity for finite graphs, including treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these invariants can be used to define functions which satisfy a strong monotonicity property, namely, they are ...
Wanying Huang   +3 more
wiley   +1 more source

Home - About - Disclaimer - Privacy