39 citations · 89 across the 25 of their papers we have counts for
5 papers · 1 filter
Segregating Markov chains
Timo Hirscher, Anders Martinsson
Dealing with finite Markov chains in discrete time, the focus often lies on convergence behavior and one tries to make different copies of the chain meet as fast as possible and th…
Permutations destroying arithmetic progressions in finite cyclic groups
Peter Hegarty, Anders Martinsson
A permutation πof an abelian group G is said to destroy arithmetic progressions (APs) if, whenever (a,b,c) is a non-trivial 3-term AP in G, that is c-b=b-a and a,b,c are not all eq…
First-passage percolation on Cartesian power graphs
Anders Martinsson
We consider first-passage percolation on the class of "high-dimensional" graphs that can be written as an iterated Cartesian product of some ba…
Accessibility percolation and first-passage site percolation on the unoriented binary hypercube
Anders Martinsson
Inspired by biological evolution, we consider the following so-called accessibility percolation problem: The vertices of the unoriented -dimensional binary hypercube are assigne…
An improved energy argument for the Hegselmann-Krause model
Anders Martinsson
We show that the freezing time of the -dimensional Hegselmann-Krause model is where is the number of agents. This improves the best known upper bound whenever $d\ge…