Results 61 to 70 of about 10,447 (245)

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

Bipartite bithreshold graphs

Discrete Mathematics, 1993
This paper deals with bithreshold graphs and their characterization. After having given some necessary properties the authors succeed in proving a complete characterization of the class of bipartite bithreshold graphs by means of 11 not bithreshold (so-called forbidden induced subgraphs) and 5 classes of induced subgraphs.
Peter L. Hammer, Nadimpalli V. R. Mahadev, Uri N. Peled   +2 more
openaire   +1 more source

Methods Research and Software Development for Parameters Formalization of the Assignment Task Applicable to the Target Distribution

Journal of Robotics, 2020
The paper discusses the solution of the assignment task between two groups of mobile (MR) objects. The assignment task is to determine the purpose of MR to each other when playing football.
Denis Aleksandrovich Beloglazov, Valery Ivanovich Finaev, Victor Vladimirovich Soloviev, Elena Nikolaevna Pavlenko   +3 more
doaj   +1 more source

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

Multi-View Clustering via Projection-Enhanced Bipartite Graph Learning and Consensus Fusion

Mathematics
Anchor-based bipartite graph methods provide scalable solutions for multi-view clustering, but most of them construct graphs in the original feature space, where high dimensionality distorts the proximity between samples and anchors and degrades graph ...
Xun Liu, Qing-Wen Wang, Jiang-Feng Chen
doaj   +1 more source

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

A Min–Max Relation on Dicuts and Dijoins in Weighted Chordal Digraphs

Journal of Graph Theory, EarlyView.
ABSTRACT In a digraph, a dicut is a cut where all the arcs cross in one direction. A dijoin is a subset of arcs that intersects every dicut. Edmonds and Giles conjectured that in a weighted digraph, the minimum weight of a dicut is equal to the maximum size of a packing of dijoins. This has been disproved. However, the unweighted version conjectured by
Gérard Cornuéjols, Siyue Liu, R. Ravi
wiley   +1 more source

On the deficiency of bipartite graphs

Discrete Applied Mathematics, 1999
An edge-coloring of a graph \(G\) with colors \(1,2,3,\dots\) is consecutive if the set of colors present at each vertex of \(G\) is a consecutive set of integers. For a bipartite graph \(G\), a consecutive edge-coloring has an application in scheduling and thus had been studied before by A. S. Asratian, R. R. Kamalian, D. Hanson, C. O. M.
Krzysztof Giaro, Marek Kubale, Michal Malafiejski   +2 more
openaire   +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

Bipartite covering graphs

Discrete Mathematics, 2000
The authors study coverings of non-bipartite graphs by bipartite graphs. In particular, they enumerate regular bipartite coverings for orders which are twice a prime.
Archdeacon, D, Kwak, JH, Lee, J, Sohn, MY   +3 more
openaire   +2 more sources