Zobrazeno 1 - 10
of 141
pro vyhledávání: '"Swart, Jan M."'
We study a random game in which two players in turn play a fixed number of moves. For each move, there are two possible choices. To each possible outcome of the game we assign a winner in an i.i.d. fashion with a fixed parameter p. In the case where
Externí odkaz:
http://arxiv.org/abs/2409.02660
Autor:
Latz, Jan Niklas, Swart, Jan M.
In his paper from 1986 Gray developed a theory of dual processes for attractive spin systems. Based on his work Sturm and Swart systematically investigated monotonicity-based pathwise dualities for Markov processes in general and interacting particle
Externí odkaz:
http://arxiv.org/abs/2312.00595
Autor:
Freeman, Nic, Swart, Jan M.
We introduce the path space over a general metrisable space. Elements of this space are paths, which are pairs consisting of a closed subset of the real line and a cadlag function that is defined on that subset and takes values in the metrisable spac
Externí odkaz:
http://arxiv.org/abs/2301.05637
Autor:
Latz, Jan Niklas, Swart, Jan M.
In this paper we use duality techniques to study a combination of the well-known contact process (CP) and the somewhat less-known annihilating branching process. As the latter can be seen as a cancellative version of the contact process, we rebrand i
Externí odkaz:
http://arxiv.org/abs/2209.06017
We review and extend Toom's classical result about stability of trajectories of cellular automata, with the aim of deriving explicit bounds for monotone Markov processes, both in discrete and continuous time. This leads, among other things, to rigoro
Externí odkaz:
http://arxiv.org/abs/2202.10999
Autor:
Latz, Jan Niklas, Swart, Jan M.
We introduce two partially overlapping classes of pathwise dualities between interacting particle systems that are based on commutative monoids (semigroups with a neutral element) and semirings, respectively. For interacting particle systems whose lo
Externí odkaz:
http://arxiv.org/abs/2108.01492
The Marked Binary Branching Tree (MBBT) is the family tree of a rate one binary branching process, on which points have been generated according to a rate one Poisson point process, with i.i.d. uniformly distributed activation times assigned to the p
Externí odkaz:
http://arxiv.org/abs/2103.14408
In frozen percolation, i.i.d. uniformly distributed activation times are assigned to the edges of a graph. At its assigned time, an edge opens provided neither of its endvertices is part of an infinite open cluster; in the opposite case, it freezes.
Externí odkaz:
http://arxiv.org/abs/1910.09213
We consider one-dimensional biased voter models, where 1's replace 0's at a faster rate than the other way round, started in a Heaviside initial state describing the interface between two infinite populations of 0's and 1's. In the limit of weak bias
Externí odkaz:
http://arxiv.org/abs/1908.02944
Interacting particle systems can often be constructed from a graphical representation, by applying local maps at the times of associated Poisson processes. This leads to a natural coupling of systems started in different initial states. We consider i
Externí odkaz:
http://arxiv.org/abs/1812.10787