activity
20112017
most citedLipschitz partition processes

3 citations · 3 across the 5 of their papers we have counts for

collaborators

7 papers

stat.AP2017

Why "Redefining Statistical Significance" Will Not Improve Reproducibility and Could Make the Replication Crisis Worse

Harry Crane

A recent proposal to "redefine statistical significance" (Benjamin, et al. Nature Human Behaviour, 2017) claims that false positive rates "would immediately improve" by factors gre…

math.LO2016

Relative exchangeability with equivalence relations

Harry Crane, Henry Towsner

We describe an Aldous--Hoover-type characterization of random relational structures that are exchangeable relative to a fixed structure which may have various equivalence relations…

math.PR2016

The structure of combinatorial Markov processes

Harry Crane, Henry Towsner

Every exchangeable Feller process taking values in a suitably nice combinatorial state space can be constructed by a system of iterated random Lipschitz functions. In discrete time…

math.ST20153 cited

Lipschitz partition processes

Harry Crane

We introduce a family of Markov processes on set partitions with a bounded number of blocks, called Lipschitz partition processes. We construct these processes explicitly by a Pois…

math.CO2013

Some algebraic identities for the alpha-permanent

Harry Crane

We show that the permanent of a matrix is a linear combination of determinants of block diagonal matrices which are simple functions of the original matrix. To prove this, we first…

math.PR2012

Convergence Rates of Markov Chains on Spaces of Partitions

Harry Crane, Steven P. Lalley

We study the convergence rate to stationarity for a class of exchangeable partition-valued Markov chains called cut-and-paste chains. The law governing the transitions of a cut-and…