4 citations · 11 across the 13 of their papers we have counts for
6 papers · 1 filter
Robustness against data loss with Algebraic Statistics
Roberto Fontana, Fabio Rapallo
The paper describes an algorithm that, given an initial design of size and a linear model with parameters, provides a sequence $\mathcal{F}_n \supset \ldots…
Circuits for robust designs
Roberto Fontana, Fabio Rapallo, Henry P. Wynn
This paper continues the application of circuit theory to experimental design started by the first two authors. The theory gives a very special and detailed representation of the k…
Markov Chain Monte Carlo sampling for conditional tests: A link between permutation tests and algebraic statistics
Roberto Fontana, Francesca Romana Crucinio
We consider conditional tests for non-negative discrete exponential families. We develop two Markov Chain Monte Carlo (MCMC) algorithms which allow us to sample from the conditiona…
Simulations on the combinatorial structure of D-optimal designs
Roberto Fontana, Fabio Rapallo
In this work we present the results of several simulations on main-effect factorial designs. The goal of such simulations is to investigate the connections between the -optimali…
Random Latin squares and Sudoku designs generation
Roberto Fontana
Uniform random generation of Latin squares is a classical problem. In this paper we prove that both Latin squares and Sudoku designs are maximum cliques of properly defined graphs.…
Random generation of optimal saturated designs
Roberto Fontana
Efficient algorithms for searching for optimal saturated designs are widely available. They maximize a given efficiency measure (such as D-optimality) and provide an optimum design…