Related papers: Time-dependent P\'olya urn

We analyze the quantum dynamics of the time-dependent elliptical billiard using the example of a certain breathing mode. A numerical method for the time-propagation of an arbitrary initial state is developed, based on a series of…

We study the phase transition between a trivial and a time-reversal-invariant topological superconductor in a single-band system. By analyzing the interplay of symmetry, topology and energetics, we show that for a generic normal state band…

We study the effects of topological (connectivity) disorder on phase transitions. We identify a broad class of random lattices whose disorder fluctuations decay much faster with increasing length scale than those of generic random systems,…

We introduce the P\'olya Web, a system of coalescing random walks based on the classic P\'olya urn model. This construction serves as an analogue to the web of coalescing random walks studied by T\'oth and Werner (1998), replacing simple…

The basic $\kappa$-color box-ball (BBS) system is an integrable cellular automaton on one dimensional lattice whose local states take $\{0,1,\cdots,\kappa \}$ with $0$ regarded as an empty box. The time evolution is defined by a…

Motivated by the Beck-Fiala conjecture, we study the discrepancy problem in two related models of random hypergraphs on $n$ vertices and $m$ edges. In the first (edge-independent) model, a random hypergraph $H_1$ is constructed by fixing a…

We study an active random walker model in which a particle's motion is determined by a self-generated field. The field encodes information about the particle's path history. This leads to either self-attractive or self-repelling behavior.…

We study P\'olya urns on hypergraphs and prove that, when the incidence matrix of the hypergraph is injective, there exists a point $v=v(H)$ such that the random process converges to $v$ almost surely. We also provide a partial result when…

Phase transitions are a fundamental concept in science describing diverse phenomena ranging from, e.g., the freezing of water to Bose-Einstein condensation. While the concept is well-established in equilibrium, similarly fundamental…

We investigate the low-noise regime of a large class of probabilistic cellular automata, including the North-East-Center model of A. Toom. They are defined as stochastic perturbations of cellular automata with a binary state space and a…

We study survival among two competing types in two settings: a planar growth model related to two-neighbour bootstrap percolation, and a system of urns with graph-based interactions. In the planar growth model, uncoloured sites are given a…

We consider the Newtonian dynamics of a massive particle in a one dimemsional random potential which is a Brownian motion in space. This is the zero temperature nondamped Sinai model. As there is no dissipation the particle oscillates…

We study random walks on Erd\"os-R\'enyi random graphs in which, every time the random walk returns to the starting point, first an edge probability is independently sampled according to a priori measure $\mu$, and then an Erd\"os-R\'enyi…

We review some facts, properties and applications of the urn of Hill, Lane and Sudderth, a paradigmatic model of stochastic process with memory where the urn evolution is as follows: consider an urn of given capacity, at each step a new…

The classical result of Erdos and Renyi shows that the random graph G(n,p) experiences sharp phase transition around p=1/n - for any \epsilon>0 and p=(1-\epsilon)/n, all connected components of G(n,p) are typically of size O(log n), while…

We study the frog model with death on the biregular tree $\mathbb{T}_{d_1,d_2}$. Initially, there is a random number of awake and sleeping particles located on the vertices of the tree. Each awake particle moves as a discrete-time…

We consider the simple random walk (or P\'olya walk) on the one-dimensional lattice subject to stochastic resetting to the origin with probability $r$ at each time step. The focus is on the joint statistics of the numbers…

Zero forcing is a deterministic iterative graph coloring process in which vertices are colored either blue or white, and in every round, any blue vertices that have a single white neighbor force these white vertices to become blue. Here we…

We investigate the existence of a rainbow Hamilton cycle in a uniformly edge-coloured randomly perturbed digraph. We show that for every $\delta \in (0,1)$ there exists $C = C(\delta) > 0$ such that the following holds. Let $D_0$ be an…

The time-dependent probability density function of a system evolving towards a stationary state exhibits an oscillatory behavior if the eigenvalues of the corresponding evolution operator are complex. The frequencies \omega_n, with which…