Related papers: Meteor process on ${\mathbb Z}^d$
The zigzag process is a variant of the telegraph process with position dependent switching intensities. A characterization of the $L^2$-spectrum for the generator of the one-dimensional zigzag process is obtained in the case where the…
We study quantum walks on general graphs from the point of view of scattering theory. For a general finite graph we choose two vertices and attach one half line to each. We are interested in walks that proceed from one half line, through…
We show that the quasi-stationary distribution of the subcritical contact process on $\mathbb{Z}^d$ is unique. This is in contrast with other processes which also do not come down from infinity, like stable queues and Galton-Watson, and it…
Let $[\mathcal{P}]$ be the points of a Poisson process on $\mathbb{R}^d$ and $F$ a probability distribution with support on the non-negative integers. Models are formulated for generating translation invariant random graphs with vertex set…
Bootstrap percolation is a process that is used to model the spread of an infection on a given graph. In the model considered here each vertex is equipped with an individual threshold. As soon as the number of infected neighbors exceeds…
Start with a graph with a subset of vertices called {\it the border}. A particle released from the origin performs a random walk on the graph until it comes to the immediate neighbourhood of the border, at which point it joins this subset…
Certain continuous-time quantum walks can be viewed as scattering processes. These processes can perform quantum computations, but it is challenging to design graphs with desired scattering behavior. In this paper, we study and construct…
We study the phenomenon of information propagation on mobile geometric scale-free random graphs, where vertices instantaneously pass on information to all other vertices in the same connected component. The graphs we consider are…
Consider a system of $K$ particles moving on the vertex set of a finite connected graph with at most one particle per vertex. If there is one, the particle at $x$ chooses one of the $\hbox{deg} (x)$ neighbors of its location uniformly at…
A meteor graph is a connected graph with no sources and sinks consisting of two disjoint cycles and the paths connecting these cycles. We prove that two meteor graphs are shift equivalent if and only if they are strongly shift equivalent,…
A topological computation method, called the MGSTD method, is applied to time-series data obtained from meteorological measurement. The method gives decomposition of the dynamics into invariant sets and gradient-like transitions between…
We study a continuous time Mutually Catalytic Branching model on the $\mathbb{Z}^{d}$. The model describes the behavior of two different populations of particles, performing random walk on the lattice in the presence of branching, that is,…
The one-dimensional symmetric exclusion process, the simplest interacting particle process, is a lattice-gas made of particles that hop symmetrically on a discrete line respecting hard-core exclusion. The system is prepared on the infinite…
An event generator is constructed on the basis of a model of multiple scattering of partons so that the trajectory of a parton traversing a dense and expanding medium can be tracked. The parameters in the code are adjusted to fit the…
We present a general approach to study the flooding time (a measure of how fast information spreads) in dynamic graphs (graphs whose topology changes with time according to a random process). We consider arbitrary converging Markovian…
We consider a synchronous process of particles moving on the vertices of a graph $G$, introduced by Cooper, McDowell, Radzik, Rivera and Shiraga (2018). Initially, $M$ particles are placed on a vertex of $G$. At the beginning of each time…
A popular question in Bernoulli percolation models is if the probability of connection between two vertices in a transitive graph decays monotonically with the distance between these two vertices. For example, on the square lattice is an…
The probability distribution of the velocity of gas molecules in a closed container is described by the kinetic theory of gases. When molecules collide or impact the walls of a container, they exchange energy and momentum in accordance with…
We introduce a particle model, that we call the $\textit{golf model}$. Initially, on a graph $G$, balls and holes are placed at random on some distinct vertices. The balls then move one by one, doing a random walk on $G$, starting from…
Meteors can be classified into either sporadic meteors or showery meteors. We compile the meteor records in the astronomical archives in the Chronicle of the Koryo dynasty (918-1392), and investigate the spatial distribution of meteor…