Rapid Mixing for Lattice Colorings with Fewer Colors

We provide an optimally mixing Markov chain for 6-colorings of the square lattice on rectangular regions with free, fixed, or toroidal boundary conditions. This implies that the uniform distribution on the set of such colorings has strong spatial mixing, so that the 6-state Potts antiferromagnet has a finite correlation length and a unique Gibbs measure at zero temperature. Four and five are now the only remaining values of q for which it is not known whether there exists a rapidly mixing Markov chain for q-colorings of the square lattice.Comment: Appeared in Proc. LATIN 2004, to appear in JSTA

Velocity dominated singularities in the cheese slice universe

We investigate the properties of spacetimes resulting from matching together exact solutions using the Darmois matching conditions. In particular we focus on the asymptotically velocity term dominated property (AVTD). We propose a criterion that can be used to test if a spacetime constructed from a matching can be considered AVTD. Using the Cheese Slice universe as an example, we show that a spacetime constructed from a such a matching can inherit the AVTD property from the original spacetimes. Furthermore the singularity resulting from this particular matching is an AVTD singularity.Comment: 11 pages, 3 figures, accepted for publication in the International Journal of Modern Physics

Technical management techniques for identification and control of industrial safety and pollution hazards

Constructive recommendations are suggested for pollution problems from offshore energy resources industries on outer continental shelf. Technical management techniques for pollution identification and control offer possible applications to space engineering and management

Ablation debris control by means of closed thick film filtered water immersion

The performance of laser ablation generated debris control by means of open immersion techniques have been shown to be limited by flow surface ripple effects on the beam and the action of ablation plume pressure loss by splashing of the immersion fluid. To eradicate these issues a closed technique has been developed which ensured a controlled geometry for both the optical interfaces of the flowing liquid film. This had the action of preventing splashing, ensuring repeatable machining conditions and allowed for control of liquid flow velocity. To investigate the performance benefits of this closed immersion technique bisphenol A polycarbonate samples have been machined using filtered water at a number of flow velocities. The results demonstrate the efficacy of the closed immersion technique: a 93% decrease in debris is produced when machining under closed filtered water immersion; the average debris particle size becomes larger, with an equal proportion of small and medium sized debris being produced when laser machining under closed flowing filtered water immersion; large debris is shown to be displaced further by a given flow velocity than smaller debris, showing that the action of flow turbulence in the duct has more impact on smaller debris. Low flow velocities were found to be less effective at controlling the positional trend of deposition of laser ablation generated debris than high flow velocities; but, use of excessive flow velocities resulted in turbulence motivated deposition. This work is of interest to the laser micromachining community and may aide in the manufacture of 2.5D laser etched patterns covering large area wafers and could be applied to a range of wavelengths and laser types

Gravitational lens optical scalars in terms of energy-momentum distributions

This is a general work on gravitational lensing. We present new expressions for the optical scalars and the deflection angle in terms of the energy-momentum tensor components of matter distributions. Our work generalizes standard references in the literature where normally stringent assumptions are made on the sources. The new expressions are manifestly gauge invariant, since they are presented in terms of curvature components. We also present a method of approximation for solving the lens equations, that can be applied to any order.Comment: 17 pages, 2 figures. Titled changed. Small improvements. References added. Final version published in Phys.Rev.

Optimization of the neutron yield in fusion plasmas produced by Coulomb explosions of deuterium clusters irradiated by a petawatt laser

The kinetic energy of hot (multi-keV) ions from the laser-driven Coulomb explosion of deuterium clusters and the resulting fusion yield in plasmas formed from these exploding clusters has been investigated under a variety of conditions using the Texas Petawatt laser. An optimum laser intensity was found for producing neutrons in these cluster fusion plasmas with corresponding average ion energies of 14 keV. The substantial volume (1-10 mm(3)) of the laser-cluster interaction produced by the petawatt peak power laser pulse led to a fusion yield of 1.6x10(7) neutrons in a single shot with a 120 J, 170 fs laser pulse. Possible effects of prepulses are discussed. DOI: 10.1103/PhysRevE.87.023106Glenn Focht Memorial FellowshipNNSA DE-FC52-08NA28512DOE Office of Basic Energy SciencesPhysic

Quantum speedup of classical mixing processes

Most approximation algorithms for #P-complete problems (e.g., evaluating the permanent of a matrix or the volume of a polytope) work by reduction to the problem of approximate sampling from a distribution $\pi$ over a large set $\S$. This problem is solved using the {\em Markov chain Monte Carlo} method: a sparse, reversible Markov chain $P$ on $\S$ with stationary distribution $\pi$ is run to near equilibrium. The running time of this random walk algorithm, the so-called {\em mixing time} of $P$, is $O(\delta^{-1} \log 1/\pi_*)$ as shown by Aldous, where $\delta$ is the spectral gap of $P$ and $\pi_*$ is the minimum value of $\pi$. A natural question is whether a speedup of this classical method to $O(\sqrt{\delta^{-1}} \log 1/\pi_*)$, the diameter of the graph underlying $P$, is possible using {\em quantum walks}. We provide evidence for this possibility using quantum walks that {\em decohere} under repeated randomized measurements. We show: (a) decoherent quantum walks always mix, just like their classical counterparts, (b) the mixing time is a robust quantity, essentially invariant under any smooth form of decoherence, and (c) the mixing time of the decoherent quantum walk on a periodic lattice $\Z_n^d$ is $O(n d \log d)$, which is indeed $O(\sqrt{\delta^{-1}} \log 1/\pi_*)$ and is asymptotically no worse than the diameter of $\Z_n^d$ (the obvious lower bound) up to at most a logarithmic factor.Comment: 13 pages; v2 revised several part

Discordant voting processes on finite graphs

We consider an asynchronous voting process on graphs which we call discordant voting, and which can be described as follows. Initially each vertex holds one of two opinions, red or blue say. Neighbouring vertices with different opinions interact pairwise. After an interaction both vertices have the same colour. The quantity of interest is T, the time to reach consensus, i.e. the number of interactions needed for all vertices have the same colour. An edge whose endpoint colours differ (i.e. one vertex is coloured red and the other one blue) is said to be discordant. A vertex is discordant if its is incident with a discordant edge. In discordant voting, all interactions are based on discordant edges. Because the voting process is asynchronous there are several ways to update the colours of the interacting vertices. Push: Pick a random discordant vertex and push its colour to a random discordant neighbour. Pull: Pick a random discordant vertex and pull the colour of a random discordant neighbour. Oblivious: Pick a random endpoint of a random discordant edge and push the colour to the other end point. We show that ET, the expected time to reach consensus, depends strongly on the underlying graph and the update rule. For connected graphs on n vertices, and an initial half red, half blue colouring the following hold. For oblivious voting, ET = n2/4 independent of the underlying graph. For the complete graph Kn, the push protocol has ET = =(n log n), whereas the pull protocol has ET = =(2n). For the cycle Cn all three protocols have ET = =(n2). For the star graph however, the pull protocol has ET = O(n2), whereas the push protocol is slower with ET = =(n2 log n). The wide variation in ET for the pull protocol is to be contrasted with the well known model of synchronous pull voting, for which ET = O(n) on many classes of expanders

Meta-research: justifying career disruption in funding applications, a survey of Australian researchers.

Background: When researchers' careers are disrupted by life events - such as illness or childbirth - they often need to take extended time off. This creates a gap in their research output that can reduce their chances of winning funding. In Australia, applicants can disclose their career disruptions and peer reviewers are instructed to make appropriate adjustments. However, it is not clear if and how applicants use career disruption sections or how reviewers adjust and if they do it consistently. Methods: To examine career disruption, we used surveys of the Australian health and medical research community. We used both a random sample of Australian authors on PubMed and a non-random convenience sample. Results: Respondents expressed concerns that sharing information on career disruption would harm their chances of being funded, with 13% saying they have medical or social circumstances but would not include it in their application, with concerns about appearing 'weak'. Women were more reluctant to include disruption. There was inconsistency in how disruption was adjusted for, with less time given for those with depression compared with caring responsibilities, and less time given for those who did not provide medical details of their disruption. Conclusions: The current system is likely not adequately adjusting for career disruption and this may help explain the ongoing funding gap for senior women in Australia. Funding: National Health and Medical Research Council Senior Research Fellowship (Barnett)