A Joint Test of Unconfoundedness and Common Trends
ABSTRACT We introduce an overidentification test of two alternative assumptions to identify the average treatment effect on the treated in a two‐period panel data setting: unconfoundedness and common trends. Under unconfoundedness, treatment assignment and post‐treatment outcomes are independent, conditional on control variables and pre‐treatment ...
Martin Huber, Eva‐Maria Oeß
wiley +1 more source
Theoretical Model for Ostwald Ripening of Nanoparticles with Size-Linear Capture Coefficients. [PDF]
Dubrovskii VG, Leshchenko ED.
europepmc +1 more source
Bayesian Model Averaging in Causal Instrumental Variable Models
ABSTRACT Instrumental variables are a popular tool to infer causal effects under unobserved confounding, but choosing suitable instruments is challenging in practice. We propose gIVBMA, a Bayesian model averaging procedure that addresses this challenge by averaging across different sets of instrumental variables and covariates in a structural equation ...
Gregor Steiner, Mark Steel
wiley +1 more source
Threshold dynamics for a stage-structured model with non-local impulsive birth in a heterogeneous environment. [PDF]
Zhang Y, Yi T, Xiao Y.
europepmc +1 more source
Colourings of Uniform Group Divisible Designs and Maximum Packings
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
On the Gaussian distribution of the Mann-Kendall tau in the case of autocorrelated data. [PDF]
Gamot T +2 more
europepmc +1 more source
Fractional List Packing for Layered Graphs
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
Graph-Theoretic Limits of Distributed Computation: Entropy, Eigenvalues, and Chromatic Numbers. [PDF]
Deylam Salehi MR, Malak D.
europepmc +1 more source
Hitting Times in the Binomial Random Graph
ABSTRACT Fix k ≥ 2 $k\ge 2$, choose log n n ( k − 1 ) ∕ k ≤ p ≤ 1 − Ω ( log 4 n n ) $\frac{\mathrm{log}n}{{n}^{(k-1)\unicode{x02215}k}}\le p\le 1-{\rm{\Omega }}(\frac{{\mathrm{log}}^{4}n}{n})$, and consider G ~ G ( n , p ) $G\unicode{x0007E}G(n,p)$. For any pair of vertices v , w ∈ V ( G ) $v,w\in V(G)$, we give a simple and precise formula for the ...
Bertille Granet +2 more
wiley +1 more source
Stability and robustness of kinetochore dynamics under sudden perturbations and stochastic influences. [PDF]
Mukhamedova F, Mukhamedov F.
europepmc +1 more source

