We present an expected polynomial time algorithm to generate an unlabeled connected cubic planar graph uniformly at random. We first consider rooted connected cubic planar graphs, ...
The objective of this paper is twofold. First, the problem of generation of real random matrix samples with uniform distribution in structured (spectral) norm bounded sets is stud...
—This paper presents one of the outcomes of a research project concerned with the development of a method for synthesizing, under controlled conditions in the laboratory, the ran...
We present a novel method of statistical surface-based morphometry based on the use of non-parametric permutation tests. In order to evaluate morphologicaldifferences of brain str...
Dimitrios Pantazis, Richard M. Leahy, Thomas E. Ni...