Related papers: Determination of complete experiments using graphs
This paper combines the graph-theoretical ideas behind Moravcsik's theorem with a completely analytic derivation of discrete phase-ambiguities, recently published by Nakayama. The result is a new graphical procedure for the derivation of…
Pseudoscalar-meson photoproduction is characterized by four complex reaction amplitudes. A complete set is a minimum theoretical set of observables that allow to determine these amplitudes unambiguously. It is studied whether complete sets…
For photoproduction reactions with final states consisting of two pseudoscalar mesons and a spin-1/2 baryon, 8 complex amplitudes need to be determined uniquely. A modified version of Moravcsik's theorem is employed for these reactions,…
We revisit Moravcsik's theorem on the unique extraction of amplitudes from polarization observables, which has been originally published in 1985. The proof is (re-) written in a more formal and detailed way and the theorem is corrected for…
We investigate topological, combinatorial, statistical, and enumeration properties of finite graphs with high Kolmogorov complexity (almost all graphs) using the novel incompressibility method. Example results are: (i) the mean and variance…
In this paper, we demonstrate that considering experiments in a graph-theoretic manner allows us to exploit automorphisms of the graph to reduce the number of evaluations of candidate designs for those experiments, and thus find optimal…
Working in any model theoretic structure, we single out a class of definable bipartite graphs that admit definable, close to perfect matchings. We use this result to prove a strengthening of Tarski's theorem for the definable setting.
Graph transformation formalisms have proven to be suitable tools for the modelling of chemical reactions. They are well established in theoretical studies and increasingly also in practical applications in chemistry. The latter is made…
We study experiment design for unique identification of the causal graph of a simple SCM, where the graph may contain cycles. The presence of cycles in the structure introduces major challenges for experiment design as, unlike acyclic…
In the present paper, complete designs of graphs are considered. The notion of (regular) sampling is introduced and analyzed in detail, showing that the trivial necessary condition for its existence is actually sufficient. Some examples are…
The number and type of measurements needed to ascertain the amplitudes for pseudoscalar meson photoproduction are analyzed in this paper. It is found that 8 carefully selected measurements can determine the four transversity amplitudes…
[Background] A complete set is a minimum set of observables which allows one to determine the underlying reaction amplitudes unambiguously. Pseudoscalar-meson photoproduction from the nucleon is characterized by four such amplitudes and…
Friedman test is a nonparametric method that proposed for analyzing data from a randomized complete block design as a robust alternative to parametric method and widely applied in many fields such as agriculture, biology, business,…
A complete set for pseudoscalar-meson photoproduction is a minimum set of observables from which one can determine the underlying reaction amplitudes unambiguously. The complete sets considered in this work involve single- and…
Graphs constructed to translate some graph problem into another graph problem are usually called auxiliary graphs. Specifically total graphs of simple graphs are used to translate the total colouring problem of the original graph into a…
We conjecture that the worst case number of experiments necessary and sufficient to discover a causal graph uniquely given its observational Markov equivalence class can be specified as a function of the largest clique in the Markov…
We develop an experimental algorithm for the exact solving of the maximum independent set problem. The algorithm consecutively finds the maximal independent sets of vertices in an arbitrary undirected graph such that the next such set…
A major factor affecting the readability of a graph drawing is its resolution. In the graph drawing literature, the resolution of a drawing is either measured based on the angles formed by consecutive edges incident to a common node…
A set of vertices $W$ of a graph $G$ is a total $k$-dominating set when every vertex of $G$ has at least $k$ neighbors in $W$. In a recent article, Chiarelli et al.\ (Improved Algorithms for $k$-Domination and Total $k$-Domination in Proper…
Graphs are used in many disciplines to model the relationships that exist between objects in a complex discrete system. Researchers may wish to compare a network of interest to a "typical" graph from a family (or ensemble) of graphs which…