74 citations · 117 across the 12 of their papers we have counts for
13 papers
Monotonicity properties for Bernoulli percolation on layered graphs -- a Markov chain approach
Philipp König, Thomas Richthammer
A layered graph is the Cartesian product of a graph with the linear graph , e.g. is the 2D square lattice . For Bernoulli percolation with…
Monotonicity of Markov chain transition probabilities via quasi-stationarity -- an application to Bernoulli percolation on
Philipp König, Thomas Richthammer
Let be a Markov chain with finite state space . If such that is transient we have for , and under mild aperiodi…
Bunkbed conjecture for complete bipartite graphs and related classes of graphs
Thomas Richthammer
Let be a simple finite graph. The corresponding bunkbed graph consists of two copies of and additional edges connecting an…
Comparing the number of infected vertices in two symmetric sets for Bernoulli percolation (and other random partitions)
Thomas Richthammer
For Bernoulli percolation on a given graph we consider the cluster of some fixed vertex . We aim at comparing the number of vertices of this cluster in the set…
A lower bound on the displacement of particles in 2D Gibbsian particle systems
Michael Fiedler, Thomas Richthammer
While 2D Gibbsian particle systems might exhibit orientational order resulting in a lattice-like structure, these particle systems do not exhibit positional order if the interactio…
Lower bound on the mean square displacement of particles in the hard disk model
Thomas Richthammer
The hard disk model is a 2D Gibbsian process of particles interacting via pure hard core repulsion. At high particle density the model is believed to show orientational order, howe…