Results 151 to 160 of about 361,091 (296)

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

Cost allocation in partition functionform games [PDF]

A cooperative game in partition function form is proposed for a cost allocation problem. The game describes a real situation in which a payoff of any coalition does not only depend on the players in the coalition but also on the coalition structure of ...
Lech Krus
core  

Mixed Steiner Triple Systems With Shortest Length

Journal of Combinatorial Designs, EarlyView.
ABSTRACT A mixed Steiner triple system is a 3‐GDD which is viewed as a code with minimum Hamming distance 3. These codes are the minimum weight codewords of a 1‐perfect code over a mixed alphabet, when the related codes exist, and provide the connection between 3‐GDDs and coding theory.
Tuvi Etzion
wiley   +1 more source

Density Conditions for k $k$ Vertex‐Disjoint Triangles in Tripartite Graphs

Journal of Graph Theory, EarlyView.
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

On Fork‐Free t‐Perfect Graphs

Journal of Graph Theory, EarlyView.
ABSTRACT In an effort to understand the complexity of the maximum independent set problem, Chvátal introduced t‐perfect graphs. While a full characterization of this class remains open, important progress has been made for claw‐free graphs [Bruhn and Stein, Math. Program. 2012] and P 5 ${P}_{5}$‐free graphs [Bruhn and Fuchs, SIAM J. Discrete Math. 2017]
Yixin Cao, Shenghua Wang
wiley   +1 more source

Robust policy evaluation from large-scale observational studies. [PDF]

PLoS One
Islam MS, Morshed MS, Young GJ, Noor-E-Alam M.   +3 more
europepmc   +1 more source

On Odd Covers of Cliques and Disjoint Unions

Journal of Graph Theory, EarlyView.
ABSTRACT Babai and Frankl posed the “odd cover problem” of finding the minimum cardinality of a collection of complete bipartite graphs such that every edge of the complete graph of order n $n$ is covered an odd number of times. In a previous paper with O'Neill, some of the authors proved that this value is always ⌈ n / 2 ⌉ $\lceil n/2\rceil $ or ⌈ n /
Calum Buchanan, Alexander Clifton, Eric Culver, Péter Frankl, Jiaxi Nie, Kenta Ozeki, Puck Rombach, Mei Yin   +7 more
wiley   +1 more source

On relative simple Heffter spaces. [PDF]

J Algebr Comb (Dordr)
Johnson L, Mella L, Pasotti A.
europepmc   +1 more source

Explicit 3‐colorings for Exponential Graphs

Journal of Graph Theory, EarlyView.
ABSTRACT In 1985, El‐Zahar and Sauer showed that the chromatic number of the direct product of two 4‐chromatic graphs is 4, establishing a nontrivial case of Hedetniemi's conjecture, which has since been refuted in general. Their proof uses the concept of an exponential graph, showing that if a graph H $H$ has no proper 3‐coloring, then the exponential
Adrien Argento, Pierre Charbit, Alantha Newman   +2 more
wiley   +1 more source

Exact Combinatorial Density of States for the Critical 1D Ising Model. [PDF]

Entropy (Basel)
Castorene B, Peña FJ, Groves MH, Vargas P.   +3 more
europepmc   +1 more source