Results 81 to 90 of about 2,729 (236)

A Joint Test of Unconfoundedness and Common Trends

Journal of Applied Econometrics, EarlyView.
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

Conditional Randomization Tests for the Specification of Interference Structure

Journal of Applied Econometrics, EarlyView.
ABSTRACT This study proposes specification tests for interference structure in causal inference with spillovers. We focus on experimental settings in which the treatment assignment mechanism is known. To test whether a given exposure mapping adequately summarizes the true interference structure, we develop conditional randomization tests by utilizing ...
Tadao Hoshino, Takahide Yanagi
wiley   +1 more source

Domain‐adapted driving scene understanding with uncertainty‐aware and diversified generative adversarial networks

CAAI Transactions on Intelligence Technology, EarlyView., 2023
Abstract Autonomous vehicles are required to operate in an uncertain environment. Recent advances in computational intelligence techniques make it possible to understand driving scenes in various environments by using a semantic segmentation neural network, which assigns a class label to each pixel.
Yining Hua, Jie Sui, Hui Fang, Chuan Hu, Dewei Yi   +4 more
wiley   +1 more source

Hitting Times in the Binomial Random Graph

Journal of Graph Theory, EarlyView.
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, Felix Joos, Jonathan Schrodt   +2 more
wiley   +1 more source

The general limit theorem in the theory of probability [PDF]

Bulletin of the American Mathematical Society, 1940
openaire   +3 more sources

Stable Cuts, NAC‐Colourings and Flexible Realisations of Graphs

Journal 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, Dániel Garamvölgyi, John Haslegrave, Tony Huynh, Jan Legerský, Anthony Nixon   +5 more
wiley   +1 more source

Fundamental Limit Theorems of Probability Theory

The Annals of Mathematical Statistics, 1950
openaire   +2 more sources

Linear Versus Centred Colouring via Pseudogrids

Journal of Graph Theory, EarlyView.
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, Vida Dujmović, Hussein Houdrouge, Mehrnoosh Javarsineh, Pat Morin   +4 more
wiley   +1 more source

Trigonometric words ranking model for spam message classification

IET Networks, EarlyView., 2022
Abstract The significant increase in the volume of fake (spam) messages has led to an urgent need to develop and implement a robust anti‐spam method. Several of the current anti‐spam systems depend mainly on the word order of the message in determining the spam message, which results in the system's inability to predict the correct type of message when
Suha Mohammed Hadi, Ali Hakem Alsaeedi, Dhiah Al‐Shammary, Zaid Abdi Alkareem Alyasseri, Mazin Abed Mohammed, Karrar Hameed Abdulkareem, Riyadh Rahef Nuiaa, Mustafa Musa Jaber   +7 more
wiley   +1 more source

Last‐minute coordination: Adapting to demand to support last‐mile operations

Journal of Operations Management, Volume 71, Issue 2, Page 176-194, March 2025.
Abstract In the highly competitive e‐commerce industry, customer‐facing warehouses are crucial as the “order penetration points” for e‐commerce last‐mile operations. This research examines how warehouses use last‐minute coordination, an unstructured mechanism, to ensure sufficient inventory at the order penetration points. Previous research has focused
Kedong Chen, Hung‐Chung Su, Kevin Linderman, William Li   +3 more
wiley   +1 more source