John Skilling

Dr. John Skilling

orcid

Research Focus & Metrics

Academic Career Length

23Years (2004-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
11 February 2010 in Physical Review A
Verified
Journal Article
Closed access
PGPhilip Goyal
Philip Goyal
Kevin KnuthKevin Knuth
Kevin Knuth
JSJohn Skilling
John Skilling
Complex numbers are an intrinsic part of the mathematical formalism of quantum theory and are perhaps its most characteristic feature. In this article, we show that the complex nature of the quantum formalism can be derived directly from the assumption that a pair of real numbers is associated with each sequence of measurement outcomes, with the probability of this sequence being a real-valued function of this number pair. By making use of elementary symmetry conditions, and without assuming that these real number pairs have any other algebraic structure, we show that these pairs must be manipulated according to the rules of complex arithmetic. We demonstrate that these complex numbers combine according to Feynman's sum and product rules, with the modulus-squared yielding the probability of a sequence of outcomes.

15 June 2012 in Axioms
Verified
Journal Article
Open access
PDF file
Kevin KnuthKevin Knuth
Kevin Knuth
JSJohn Skilling
John Skilling
We present a simple and clear foundation for finite inference that unites and significantly extends the approaches of Kolmogorov and Cox. Our approach is based on quantifying lattices of logical statements in a way that satisfies general lattice symmetries. With other applications such as measure theory in mind, our derivations assume minimal symmetries, relying on neither negation nor continuity nor differentiability. Each relevant symmetry corresponds to an axiom of quantification, and these axioms are used to derive a unique set of quantifying rules that form the familiar probability calculus. We also derive a unique quantification of divergence, entropy and information.

11 February 2004 in Comparative and Functional Genomics
Verified
Journal Article
Open access
PDF file
JSJohn Skilling
John Skilling
RDRichard Denny
Richard Denny
KRKeith Richardson
Keith Richardson
PYPhillip Young
Phillip Young
TMThérèse McKenna
Thérèse McKenna
MRMark Ritchie
Mark Ritchie
We describe a probabilistic peptide fragmentation model for use in protein databank searching and de novo sequencing of electrospray tandem mass spectrometry data. A probabilistic framework for tuning of the model using a range of well‐characterized samples are introduced. We present preliminary results of our tuning efforts. Copyright © 2004 John Wiley & Sons, Ltd.

19 July 2007
Verified
Book Chapter
Closed access
JSJohn Skilling
John Skilling
Nested sampling is a simple and general algorithm for directly computing the evidence Z (aka marginal likelihood) in multi-dimensional inference. It yields a Bayesian probability distribution Pr(Z) from which a central estimate and its uncertainty follow. Samples from the posterior distribution are available as a by-product with no extra computation. The method works by sampling proportionally to the prior, though constrained within a ‘nested’ sequence of progressively-higher likelihood contours. Exploration depends only on the shape of these contours and not on the associated values, so that nested sampling is invariant to monotonic re-labelling of likelihood. Thus, in multiphase applications, nested sampling bridges between different phases in a way denied to any thermal method, promising considerable extra scope. Although presented here in a Bayesian context, nested sampling is equally applicable to numerical integration of general positive functions in many dimensions.

5 December 2019 in Proceedings
Verified
Conference Paper
Open access
PDF file
JSJohn Skilling
John Skilling
Galilean Monte Carlo (GMC) allows exploration in a big space along systematic trajectories, thus evading the square-root inefficiency of independent steps. Galilean Monte Carlo has greater generality and power than its historical precursor Hamiltonian Monte Carlo because it discards second-order propagation under forces in favour of elementary force-free motion. Nested sampling (for which GMC was originally designed) has similar dominance over simulated annealing, which loses power by imposing an unnecessary thermal blurring over energy.

12 March 2019 in Annalen der Physik
Verified
Journal Article
Open access
PDF file
TETorsten Enßlin
Torsten Enßlin
JJJens Jasche
Jens Jasche
JSJohn Skilling
John Skilling