A. E. Holroyd

From MaRDI portal
Person:283872

Available identifiers

zbMath Open holroyd.alexander-eMaRDI QIDQ283872

List of research outcomes





PublicationDate of PublicationType
Symmetrization for finitely dependent colouring2024-10-09Paper
Galton–Watson games2023-10-12Paper
Symmetrization for finitely dependent colouring2023-05-23Paper
The spinor linkage – a mechanical implementation of the plate trick2022-11-09Paper
Minimal matchings of point processes2022-10-24Paper
Multicolour Poisson matching2022-02-25Paper
Mallows permutations as stable matchings2022-01-12Paper
Polluted bootstrap percolation in three dimensions2021-11-04Paper
The Life and Mathematical Legacy of Thomas M. Liggett2021-02-11Paper
Mallows permutations and finite dependence2020-05-29Paper
https://portal.mardi4nfdi.de/entity/Q51109592020-05-26Paper
Stable matchings in high dimensions via the Poisson-weighted infinite tree2020-05-13Paper
Abelian Logic Gates2020-04-06Paper
Polluted bootstrap percolation with threshold two in all dimensions2019-09-24Paper
Percolation games, probabilistic cellular automata, and the hard-core model2019-07-17Paper
A bijective proof of Macdonald's reduced word formula2019-04-30Paper
The local limit of random sorting networks2019-03-20Paper
Existential monadic second order logic on random rooted trees2018-11-13Paper
Finitely dependent cycle coloring2018-10-24Paper
Perfect shuffling by lazy swaps2018-08-23Paper
Friendly Frogs, Stable Marriage, and the Magic of Invariance2018-07-13Paper
Finitary coloring2017-11-24Paper
Node Overlap Removal by Growing a Tree2017-10-12Paper
Stability of service under time-of-use pricing2017-08-17Paper
One-dependent coloring by finitary factors2017-06-13Paper
Perfect Snake-in-the-Box Codes for Rank Modulation2017-05-02Paper
FINITELY DEPENDENT COLORING2017-04-04Paper
Trapping games on random boards2017-02-21Paper
Node Overlap Removal by Growing a Tree2017-02-21Paper
GraphMaps: Browsing Large Graphs as Interactive Maps2017-02-10Paper
Representing permutations with few moves2016-10-20Paper
Edge routing with ordered bundles2016-05-17Paper
Poisson allocations with bounded connected cells2015-12-01Paper
Symmetric 1-dependent colorings of the integers2015-08-17Paper
Percolation and disorder-resistance in cellular automata2015-07-10Paper
Wald for non-stopping times: the rewards of impatient prophets2015-02-03Paper
Avoidance coupling2014-09-22Paper
Percolation of finite clusters and infinite surfaces2014-04-11Paper
Extendable self-avoiding walks2014-04-11Paper
The phase transition for dyadic tilings2014-03-05Paper
Stochastic domination and comb percolation2014-02-14Paper
\(k\)-run overpartitions and mock theta functions2014-01-22Paper
Insertion and deletion tolerance of point processes2014-01-17Paper
A pattern theorem for random sorting networks2014-01-15Paper
Drawing Permutations with Few Corners2013-12-20Paper
Recurrent rotor-router configurations2013-02-28Paper
Percolation in invariant Poisson graphs with i.i.d. degrees2012-11-29Paper
Shorthand universal cycles for permutations2012-11-21Paper
A sharper threshold for bootstrap percolation in two dimensions2012-07-31Paper
Geometry of Lipschitz percolation2012-06-04Paper
Edge Routing with Ordered Bundles2012-03-09Paper
Lattice embeddings in percolation2012-02-22Paper
Some circumstances where extra updates can delay mixing2012-01-12Paper
A Nonmeasurable Set from Coin Flips2012-01-01Paper
Poisson splitting by factors2011-12-08Paper
Rotor Walks on General Trees2011-10-27Paper
Geometric properties of Poisson matchings2011-09-27Paper
Plaquettes, spheres, and entanglement2011-09-09Paper
Escape of resources in a distributed clustering process2011-09-09Paper
Stable Poisson graphs in one dimension2011-09-09Paper
Deterministic thinning of finite Poisson processes2011-03-10Paper
Rotor Walks and Markov Chains2011-01-03Paper
Faster Generation of Shorthand Universal Cycles for Permutations2010-07-20Paper
Random subnetworks of random sorting networks2010-06-16Paper
Lipschitz percolation2010-04-30Paper
Tail Bounds for the Stable Marriage of Poisson and Lebesgue2009-12-10Paper
Local bootstrap percolation2009-11-20Paper
The oriented swap process2009-11-04Paper
Discrete low-discrepancy sequences2009-10-06Paper
Poisson matching2009-08-24Paper
A percolating hard sphere model2009-04-08Paper
Chip-Firing and Rotor-Routing on Directed Graphs2008-11-10Paper
Partition identities and the coin exchange problem2008-09-04Paper
Slow convergence in bootstrap percolation2008-07-01Paper
Random sorting networks2007-10-05Paper
Universal finitary codes with exponential tails2007-04-23Paper
A stable marriage of Poisson and Lebesgue2006-11-08Paper
The metastability threshold for modified bootstrap percolation in \(d\) dimensions2006-11-03Paper
The jammed phase of the Biham-Middleton-Levine traffic model2006-11-03Paper
Extra heads and invariant allocations2006-08-03Paper
Trees and matchings from point processes2005-03-14Paper
Integrals, partitions, and cellular automata2004-08-13Paper
Sharp metastability threshold for two-dimensional bootstrap percolation2003-08-14Paper
Inequalities in entanglement percolation2003-08-06Paper
Knotted paths in percolation2003-08-06Paper
https://portal.mardi4nfdi.de/entity/Q47933012003-06-02Paper
How to find an extra head: Optimal random shifts of Bernoulli and Poisson random fields2003-05-06Paper
Rigidity percolation and boundary conditions.2003-05-06Paper
Entanglement in percolation2002-01-28Paper
Existence of a phase transition for entanglement percolation2000-11-20Paper
Existence and uniqueness of infinite components in generic rigidity percolation2000-03-13Paper

Research outcomes over time

This page was built for person: A. E. Holroyd