Results 161 to 170 of about 2,712 (260)
Identifying Peer Effects in Networks with Unobserved Effort and Isolated Students
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
Global feasible path planning for pest monitoring robots in unstructured agricultural environments. [PDF]
Shao Y, Tao F, Si P, Ji B, Li M.
europepmc +1 more source
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
LPRE estimation for functional multiplicative model and optimal subsampling. [PDF]
Yan Q, Li H.
europepmc +1 more source
Weak Degeneracy of Planar Graphs
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
Optimization of femtosecond laser spot coverage: analytical modeling of spatial frequencies, anisotropy, and saturation boundaries. [PDF]
Mosquera SA.
europepmc +1 more source
Linear Versus Centred Colouring via Pseudogrids
ABSTRACT A centred colouring of a graph is a vertex colouring in which every connected subgraph contains a vertex whose colour is unique and a linear colouring is a vertex colouring in which every (not‐necessarily induced) path contains a vertex whose colour is unique. For a graph G $G$, the centred chromatic number χ cen ( G ) ${\chi }_{\text{cen}}(G)$
Prosenjit Bose +4 more
wiley +1 more source
Density Conditions for k $k$ Vertex‐Disjoint Triangles in Tripartite Graphs
ABSTRACT Let n , k $n,k$ be positive integers such that n ≥ k $n\ge k$ and G $G$ be a tripartite graph with parts A , B , C $A,B,C$ such that ∣ A ∣ = ∣ B ∣ = ∣ C ∣ = n $| A| =| B| =| C| =n$. Denote the edge densities of G [ A , B ] , G [ A , C ] $G[A,B],G[A,C]$ and G [ B , C ] $G[B,C]$ by α , β $\alpha ,\beta $ and γ $\gamma $, respectively.
Mingyang Guo, Klas Markström
wiley +1 more source
A first order method for linear programming parameterized by circuit imbalance. [PDF]
Cole R, Hertrich C, Tao Y, Végh LA.
europepmc +1 more source

