Related papers: Stochastic domination: the contact process, Ising …
We study stochastic particle systems with stationary product measures that exhibit a condensation transition due to particle interactions or spatial inhomogeneities. We review previous work on the stationary behaviour and put it in the…
Stochastic dominance has not been too employed in practice due to its important limitations. To increase its versatility, the concept has recently been adapted by introducing various indices that measure the degree to which one probability…
Stochastic optimal control problems have a long tradition in applied probability, with the questions addressed being of high relevance in a multitude of fields. Even though theoretical solutions are well understood in many scenarios, their…
In 2011, Henning, L\"{o}wenstein, and Rautenbach observed that the domination number of a graph is bounded from above by the product of the packing number and the maximum degree of the graph. We prove a stronger statement in subcubic…
We consider the contact process on a countable-infinite and connected graph of bounded degree. For this process started from the upper invariant measure, we prove certain uniform mixing properties under the assumption that the infection…
The domination number $\gamma(G)$ of a graph $G$, its exponential domination number $\gamma_e(G)$, and its porous exponential domination number $\gamma_e^*(G)$ satisfy $\gamma_e^*(G)\leq \gamma_e(G)\leq \gamma(G)$. We contribute results…
Propagation of contagion in networks depends on the graph topology. This paper is concerned with studying the time-asymptotic behavior of the extended contact processes on static, undirected, finite-size networks. This is a contact process…
There exists a Lipschitz embedding of a d-dimensional comb graph (consisting of infinitely many parallel copies of Z^{d-1} joined by a perpendicular copy) into the open set of site percolation on Z^d, whenever the parameter p is close…
The zero-temperature Ising model is known to reach a fully ordered ground state in sufficiently dense random graphs. In sparse random graphs, the dynamics gets absorbed in disordered local minima at magnetization close to zero. Here, we…
We extend the theory of stochastic thermodynamics in three directions: (i) instead of a continuously monitored system we consider measurements only at an arbitrary set of discrete times, (ii) we allow for imperfect measurements and…
Construct a random set by independently selecting each finite subset of the integers with some probability depending on the set up to translations and taking the union of the selected sets. We show that when the only sets selected with…
We consider random walks in a uniformly elliptic, balanced, i.i.d. random environment in the integer lattice $Z^d$ for $d\geq 2$ and the corresponding problem of stochastic homogenization of non-divergence form difference operators. We…
A maximum sequence $S$ of vertices in a graph $G$, so that every vertex in $S$ has a neighbor which is independent, or is itself independent, from all previous vertices in $S$, is called a Grundy dominating sequence. The Grundy domination…
We consider iterated function systems (IFS) in ${\mathbb R}^d$ for $d\ge 3$ of the form $\{f_j(x) = \lambda {\mathcal O} x + a_j\}_{j=0}^m$, with $a_0=0$ and $m\ge 1$. Here $\lambda\in (0,1)$ is the contraction ratio and ${\mathcal O}$ is…
We consider a special type of interval catch digraph (ICD) family for one-dimensional data in a randomized setting and propose its use for testing uniformity. These ICDs are defined with an expansion and a centrality parameter, hence we…
Electronic ordering is prevalent in correlated systems, which commonly exhibit competing interactions. Here, we use x-ray diffraction to demonstrate a cascade of pressure induced order-disorder transformations, with propagation vectors…
A graph is said to be well-dominated if all its minimal dominating sets are of the same size. The class of well-dominated graphs forms a subclass of the well studied class of well-covered graphs. While the recognition problem for the class…
We consider the contact process on a dynamic graph defined as a random $d$-regular graph with a stationary edge-switching dynamics. In this graph dynamics, independently of the contact process state, each pair $\{e_1,e_2\}$ of edges of the…
We study the critical behavior for inhomogeneous versions of the Curie-Weiss model, where the coupling constant $J_{ij}(\beta)$ for the edge $ij$ on the complete graph is given by $J_{ij}(\beta)=\beta w_iw_j/(\sum_{k\in[N]}w_k)$. We call…
Galton's rank order statistic is one of the oldest statistical tools for two-sample comparisons. It is also a very natural index to measure departures from stochastic dominance. Yet, its asymptotic behaviour has been investigated only…