32 research outputs found
Towards a gauge-polyvalent Numerical Relativity code
The gauge polyvalence of a new numerical code is tested, both in
harmonic-coordinate simulations (gauge-waves testbed) and in
singularity-avoiding coordinates (simple Black-Hole simulations, either with or
without shift). The code is built upon an adjusted first-order
flux-conservative version of the Z4 formalism and a recently proposed family of
robust finite-difference high-resolution algorithms. An outstanding result is
the long-term evolution (up to 1000M) of a Black-Hole in normal coordinates
(zero shift) without excision.Comment: to appear in Physical Review
Efficient implementation of finite volume methods in Numerical Relativity
Centered finite volume methods are considered in the context of Numerical
Relativity. A specific formulation is presented, in which third-order space
accuracy is reached by using a piecewise-linear reconstruction. This
formulation can be interpreted as an 'adaptive viscosity' modification of
centered finite difference algorithms. These points are fully confirmed by 1D
black-hole simulations. In the 3D case, evidence is found that the use of a
conformal decomposition is a key ingredient for the robustness of black hole
numerical codes.Comment: Revised version, 10 pages, 6 figures. To appear in Phys. Rev.
Uniform random generation of large acyclic digraphs
Directed acyclic graphs are the basic representation of the structure
underlying Bayesian networks, which represent multivariate probability
distributions. In many practical applications, such as the reverse engineering
of gene regulatory networks, not only the estimation of model parameters but
the reconstruction of the structure itself is of great interest. As well as for
the assessment of different structure learning algorithms in simulation
studies, a uniform sample from the space of directed acyclic graphs is required
to evaluate the prevalence of certain structural features. Here we analyse how
to sample acyclic digraphs uniformly at random through recursive enumeration,
an approach previously thought too computationally involved. Based on
complexity considerations, we discuss in particular how the enumeration
directly provides an exact method, which avoids the convergence issues of the
alternative Markov chain methods and is actually computationally much faster.
The limiting behaviour of the distribution of acyclic digraphs then allows us
to sample arbitrarily large graphs. Building on the ideas of recursive
enumeration based sampling we also introduce a novel hybrid Markov chain with
much faster convergence than current alternatives while still being easy to
adapt to various restrictions. Finally we discuss how to include such
restrictions in the combinatorial enumeration and the new hybrid Markov chain
method for efficient uniform sampling of the corresponding graphs.Comment: 15 pages, 2 figures. To appear in Statistics and Computin
Systems of linear congruences, balanced modular labellings of graphs and chromatic totients
Enumeration of free tree-rooted planar maps
Дискретная математика и математическая кибернетик
Systems of linear congruences, balanced modular labellings of graphs and chromatic totients
Enumeration of branched coverings of nonorientable surfaces with cyclic branch points
In this paper, n-fold branched coverings of a closed nonorientable surface S of genus p with r >= 1 cyclic branch points ( that is, such that all rami. cation points over them are of multiplicity n) are considered. The number N-p, r( n) of such coverings up to equivalence is evaluated explicitly in a closed form ( without using any complicated functions such as irreducible characters of the symmetric groups). The obtained formulas depend on the parity of r and n. The method is based on some previous enumerative results and techniques for nonorientable surfaces. In particular, we generalize the approach developed for the counting of unbranched coverings of nonorientable surfaces and make use of the analytical method of roots-of-unity sums.open111sciescopu
Address for correspondence:
Abstract. A planar map is a 2-cell embedding of a connected planar graph, loops and parallel edges allowed, on the sphere. A plane map is a planar map with a distinguished outside (“infinite”) face. An unrooted map is an equivalence class of maps under orientation-preserving homeomorphism, and a rooted map is a map with a distinguished oriented edge. Previously we obtained formulae for the number of unrooted planar n-edge maps of various classes, including all maps, non-separable maps, eulerian maps and loopless maps. In this article, using the same technique we obtain closed formulae for counting unrooted plane maps of all these classes and their duals. The corresponding formulae for rooted maps are known to be all sum-free; the formulae that we obtain for unrooted maps contain only a sum over the divisors of n. We count also unrooted two-vertex plane maps. 2000 Mathematics Subject Classification: 05C30 Key words: rooted planar map, unrooted plane map, quotient map, sum-free formula