Recent results using all-point quark propagators

Pseudofermion methods for extracting all-point quark propagators are reviewed, with special emphasis on techniques for reducing or eliminating autocorrelations induced by low eigenmodes of the quark Dirac operator. Recent applications, including high statistics evaluations of hadronic current correlators and the pion form factor, are also described.Comment: LateX, 3 pages, 6 eps figures, Lattice2002(algor), corrected some typo

Hadronic Correlators from All-point Quark Propagators

A method for computing all-point quark propagators is applied to a variety of processes of physical interest in lattice QCD. The method allows, for example, efficient calculation of disconnected parts and full momentum-space 2 and 3 point functions. Examples discussed include: extraction of chiral Lagrangian parameters from current correlators, the pion form factor, and the unquenched eta-prime.Comment: LATTICE01(Algorithms and Machines

A rigorous and efficient asymptotic test for power-law cross-correlation

Podobnik and Stanley recently proposed a novel framework, Detrended Cross-Correlation Analysis, for the analysis of power-law cross-correlation between two time-series, a phenomenon which occurs widely in physical, geophysical, financial and numerous additional applications. While highly promising in these important application domains, to date no rigorous or efficient statistical test has been proposed which uses the information provided by DCCA across time-scales for the presence of this power-law cross-correlation. In this paper we fill this gap by proposing a method based on DCCA for testing the hypothesis of power-law cross-correlation; the method synthesizes the information generated by DCCA across time-scales and returns conservative but practically relevant p-values for the null hypothesis of zero correlation, which may be efficiently calculated in software. Thus our proposals generate confidence estimates for a DCCA analysis in a fully probabilistic fashion

Automorphisms of Partially Commutative Groups II: Combinatorial Subgroups

We define several "standard" subgroups of the automorphism group Aut(G) of a partially commutative (right-angled Artin) group and use these standard subgroups to describe decompositions of Aut(G). If C is the commutation graph of G, we show how Aut(G) decomposes in terms of the connected components of C: obtaining a particularly clear decomposition theorem in the special case where C has no isolated vertices. If C has no vertices of a type we call dominated then we give a semi-direct decompostion of Aut(G) into a subgroup of locally conjugating automorphisms by the subgroup stabilising a certain lattice of "admissible subsets" of the vertices of C. We then characterise those graphs for which Aut(G) is a product (not necessarily semi-direct) of two such subgroups.Comment: 7 figures, 63 pages. Notation and definitions clarified and typos corrected. 2 new figures added. Appendix containing details of presentation and proof of a theorem adde