In this paper, we propose new Metropolis–Hastings and simulated annealing algorithms on a finite state space via modifying the energy landscape. The core idea of landscape modification rests on introducing a parameter c, such that the landscape is modi…
We consider a simple random walk on started at the origin and stopped on its first exit time from . Write L in the form with and N an integer going to infinity in such a way that for some real constant . Our main result is that for , the projection…
Copulas provide a powerful and flexible tool for modeling the dependence structure of random vectors, and they have many applications in finance, insurance, engineering, hydrology, and other fields. One well-known class of copulas in two dimensions is …
We consider Poisson hail models and characterize up to boundaries the collection of critical moments which guarantee stability. In particular, we treat the case of infinite speed of propagation.
Motivated by applications to COVID dynamics, we describe a model of a branching process in a random environment whose characteristics change when crossing upper and lower thresholds. This introduces a cyclical path behavior involving periods of increa…
Consider the following migration process based on a closed network of N queues with customers. Each station is a /M/ queue with service (or migration) rate . Upon departure, a customer is routed independently and uniformly at random to another station…
We propose a modification to the random destruction of graphs: given a finite network with a distinguished set of sources and targets, remove (cut) vertices at random, discarding components that do not contain a source node. We investigate the number o…
A bootstrap percolation process on a graph with n vertices is an ‘infection’ process evolving in rounds. Let be fixed. Initially, there is a subset of infected vertices. In each subsequent round, every uninfected vertex that has at least r infected ne…