Publication | Date of Publication | Type |
---|
Galton–Watson games | 2023-10-12 | Paper |
Symmetrization for finitely dependent colouring | 2023-05-23 | Paper |
The spinor linkage – a mechanical implementation of the plate trick | 2022-11-09 | Paper |
Minimal matchings of point processes | 2022-10-24 | Paper |
Multicolour Poisson matching | 2022-02-25 | Paper |
Mallows permutations as stable matchings | 2022-01-12 | Paper |
Polluted bootstrap percolation in three dimensions | 2021-11-04 | Paper |
The Life and Mathematical Legacy of Thomas M. Liggett | 2021-02-11 | Paper |
Mallows permutations and finite dependence | 2020-05-29 | Paper |
https://portal.mardi4nfdi.de/entity/Q5110959 | 2020-05-26 | Paper |
Stable matchings in high dimensions via the Poisson-weighted infinite tree | 2020-05-13 | Paper |
Abelian Logic Gates | 2020-04-06 | Paper |
Polluted bootstrap percolation with threshold two in all dimensions | 2019-09-24 | Paper |
Percolation games, probabilistic cellular automata, and the hard-core model | 2019-07-17 | Paper |
A bijective proof of Macdonald's reduced word formula | 2019-04-30 | Paper |
The local limit of random sorting networks | 2019-03-20 | Paper |
Existential monadic second order logic on random rooted trees | 2018-11-13 | Paper |
Finitely dependent cycle coloring | 2018-10-24 | Paper |
Perfect shuffling by lazy swaps | 2018-08-23 | Paper |
Friendly Frogs, Stable Marriage, and the Magic of Invariance | 2018-07-13 | Paper |
Finitary coloring | 2017-11-24 | Paper |
Node Overlap Removal by Growing a Tree | 2017-10-12 | Paper |
Stability of service under time-of-use pricing | 2017-08-17 | Paper |
One-dependent coloring by finitary factors | 2017-06-13 | Paper |
Perfect Snake-in-the-Box Codes for Rank Modulation | 2017-05-02 | Paper |
FINITELY DEPENDENT COLORING | 2017-04-04 | Paper |
Trapping games on random boards | 2017-02-21 | Paper |
Node Overlap Removal by Growing a Tree | 2017-02-21 | Paper |
GraphMaps: Browsing Large Graphs as Interactive Maps | 2017-02-10 | Paper |
Representing Permutations with Few Moves | 2016-10-20 | Paper |
Edge routing with ordered bundles | 2016-05-17 | Paper |
Poisson allocations with bounded connected cells | 2015-12-01 | Paper |
Symmetric 1-dependent colorings of the integers | 2015-08-17 | Paper |
Percolation and disorder-resistance in cellular automata | 2015-07-10 | Paper |
Wald for non-stopping times: the rewards of impatient prophets | 2015-02-03 | Paper |
Avoidance coupling | 2014-09-22 | Paper |
Extendable self-avoiding walks | 2014-04-11 | Paper |
Percolation of finite clusters and infinite surfaces | 2014-04-11 | Paper |
The phase transition for dyadic tilings | 2014-03-05 | Paper |
Stochastic domination and comb percolation | 2014-02-14 | Paper |
K-RUN OVERPARTITIONS AND MOCK THETA FUNCTIONS | 2014-01-22 | Paper |
Insertion and deletion tolerance of point processes | 2014-01-17 | Paper |
A pattern theorem for random sorting networks | 2014-01-15 | Paper |
Drawing Permutations with Few Corners | 2013-12-20 | Paper |
Recurrent rotor-router configurations | 2013-02-28 | Paper |
Percolation in invariant Poisson graphs with i.i.d. degrees | 2012-11-29 | Paper |
Shorthand universal cycles for permutations | 2012-11-21 | Paper |
A sharper threshold for bootstrap percolation in two dimensions | 2012-07-31 | Paper |
Geometry of Lipschitz percolation | 2012-06-04 | Paper |
Edge Routing with Ordered Bundles | 2012-03-09 | Paper |
Lattice embeddings in percolation | 2012-02-22 | Paper |
Some circumstances where extra updates can delay mixing | 2012-01-12 | Paper |
A Nonmeasurable Set from Coin Flips | 2012-01-01 | Paper |
Poisson splitting by factors | 2011-12-08 | Paper |
Rotor Walks on General Trees | 2011-10-27 | Paper |
Geometric properties of Poisson matchings | 2011-09-27 | Paper |
Escape of resources in a distributed clustering process | 2011-09-09 | Paper |
Plaquettes, spheres, and entanglement | 2011-09-09 | Paper |
Stable Poisson graphs in one dimension | 2011-09-09 | Paper |
Deterministic thinning of finite Poisson processes | 2011-03-10 | Paper |
Rotor Walks and Markov Chains | 2011-01-03 | Paper |
Faster Generation of Shorthand Universal Cycles for Permutations | 2010-07-20 | Paper |
Random subnetworks of random sorting networks | 2010-06-16 | Paper |
Lipschitz percolation | 2010-04-30 | Paper |
Tail Bounds for the Stable Marriage of Poisson and Lebesgue | 2009-12-10 | Paper |
Local bootstrap percolation | 2009-11-20 | Paper |
The oriented swap process | 2009-11-04 | Paper |
Discrete low-discrepancy sequences | 2009-10-06 | Paper |
Poisson matching | 2009-08-24 | Paper |
A percolating hard sphere model | 2009-04-08 | Paper |
Chip-Firing and Rotor-Routing on Directed Graphs | 2008-11-10 | Paper |
Partition identities and the coin exchange problem | 2008-09-04 | Paper |
Slow convergence in bootstrap percolation | 2008-07-01 | Paper |
Random sorting networks | 2007-10-05 | Paper |
Universal finitary codes with exponential tails | 2007-04-23 | Paper |
A stable marriage of Poisson and Lebesgue | 2006-11-08 | Paper |
The metastability threshold for modified bootstrap percolation in \(d\) dimensions | 2006-11-03 | Paper |
The jammed phase of the Biham-Middleton-Levine traffic model | 2006-11-03 | Paper |
Extra heads and invariant allocations | 2006-08-03 | Paper |
Trees and matchings from point processes | 2005-03-14 | Paper |
Integrals, partitions, and cellular automata | 2004-08-13 | Paper |
Sharp metastability threshold for two-dimensional bootstrap percolation | 2003-08-14 | Paper |
Inequalities in entanglement percolation | 2003-08-06 | Paper |
Knotted paths in percolation | 2003-08-06 | Paper |
https://portal.mardi4nfdi.de/entity/Q4793301 | 2003-06-02 | Paper |
How to find an extra head: Optimal random shifts of Bernoulli and Poisson random fields | 2003-05-06 | Paper |
Rigidity percolation and boundary conditions. | 2003-05-06 | Paper |
ENTANGLEMENT IN PERCOLATION | 2002-01-28 | Paper |
Existence of a phase transition for entanglement percolation | 2000-11-20 | Paper |
Existence and uniqueness of infinite components in generic rigidity percolation | 2000-03-13 | Paper |