Results 121 to 130 of about 3,923 (178)

Identifying Peer Effects in Networks with Unobserved Effort and Isolated Students

open access: yesJournal of Applied Econometrics, EarlyView.
ABSTRACT Peer influence on effort devoted to some activity is often studied when effort is unobserved, and the researcher instead observes an outcome that combines effort with other shocks. For instance, in education, achievement measures such as GPA reflect both effort and idiosyncratic GPA shocks.
Aristide Houndetoungan   +2 more
wiley   +1 more source

Deniers and Compliers: Unpacking the Heterogeneous Effectiveness of U.S. Stay‐at‐Home Mandates During the COVID‐19 Pandemic

open access: yesJournal of Applied Econometrics, EarlyView.
ABSTRACT While existing work shows COVID‐19 stay‐at‐home (SAH) policies decreased mobility on average, we lack evidence regarding heterogeneity in policy effectiveness across US counties. To uncover potential heterogeneity, we implement a novel two‐stage approach.
James Sears   +5 more
wiley   +1 more source

Stable Cuts, NAC‐Colourings and Flexible Realisations of Graphs

open access: yesJournal of Graph Theory, EarlyView.
ABSTRACT A (2‐dimensional) realisation of a graph G $G$ is a pair ( G , p ) $(G,p)$, where p $p$ maps the vertices of G $G$ to R 2 ${{\mathbb{R}}}^{2}$. A realisation is flexible if it can be continuously deformed while keeping the edge lengths fixed, and rigid otherwise.
Katie Clinch   +5 more
wiley   +1 more source

Semiparametric efficient estimation of small genetic effects in large-scale population cohorts. [PDF]

open access: yesBiostatistics
Labayle O   +7 more
europepmc   +1 more source

Weak Degeneracy of Planar Graphs

open access: yesJournal of Graph Theory, EarlyView.
ABSTRACT The weak degeneracy of a graph G $G$ is a numerical parameter that was recently introduced by the first two authors with the aim of understanding the power of greedy algorithms for graph coloring. Every d $d$‐degenerate graph is weakly d $d$‐degenerate, but the converse is not true in general (e.g., all connected d $d$‐regular graphs except ...
Anton Bernshteyn   +2 more
wiley   +1 more source

Home - About - Disclaimer - Privacy