Related papers: Meteor process on ${\mathbb Z}^d$
The frog model is a stochastic model for the spreading of an epidemic on a graph, in which a dormant particle starts to perform a simple random walk on the graph and to awake other particles, once it becomes active. We study two versions of…
The physical composition and structure of meteoroids gives us insight into the formation processes of their parent asteroids and comets. The strength of and fundamental grain sizes in meteoroids tell us about the environment in which small…
We prove non-universality results for first-passage percolation on the configuration model with i.i.d. degrees having infinite variance. We focus on the weight of the optimal path between two uniform vertices. Depending on the properties of…
Consider a graph where the sites are distributed in space according to a Poisson point process on $\mathbb R^n$. We study a population evolving on this network, with individuals jumping between sites with a rate which decreases…
Context. Dynamically linking a meteor shower with its parent body is challenging, and chaos in the dynamics of meteoroid streams may be one of the reasons. For a robust identification of parent bodies, it is therefore necessary to quantify…
A quantum finite multi-barrier system, with a periodic potential, is considered and exact expressions for its plane wave amplitudes are obtained using the Transfer Matrix method [10]. This quantum model is then associated with a stochastic…
This paper considers a network of infinite-server queues with the special feature that, triggered by specific events, the network population vector may undergo a linear transformation (a `multiplicative transition'). For this model we…
We study the transmission of random walkers through a finite-size inhomogeneous material with a quenched, long-range correlated distribution of scatterers. We focus on a finite one-dimensional structure where walkers undergo random…
This paper introduces the Attracting Random Walks model, which describes the dynamics of a system of particles on a graph with $n$ vertices. At each step, a single particle moves to an adjacent vertex (or stays at the current one) with…
We consider a stochastic aggregation model on Z^d. Start with particles located at the vertices of the lattice, initially distributed according to the product Bernoulli measure with parameter \mu. In addition, there is an aggregate, which…
A diffusion taking value in probability measures on a graph with a vertex set $V$, $\sum_{i\in V}x_i\delta_i$, is studied. The masses on each vertices satisfy the stochastic differential equation of the form $dx_i=\sum_{j\in…
We reconsider the problem of diffusion of particles at constant speed and present a generalization of the Telegrapher process to higher dimensional stochastic media ($d>1$), where the particle can move along $2^d$ directions. We derive the…
We consider an extended birth-death-immigration process defined on a lattice formed by the integers of $d$ semiaxes joined at the origin. When the process reaches the origin, then it may jumps toward any semiaxis with the same rate. The…
High altitude meteors become luminous at altitudes above $\sim$130 km, where the standard ablation theory of meteor light production is not applicable. The physical mechanism responsible for their glow has not been known. We present a model…
In this paper, we introduce and analyze a new operation $\circ_{R}$ which mixes two distributions $\Omega$ and $\Omega'$ via a random orthogonal matrix. In particular, we take $\Omega \circ_R \Omega'$ to be the limit as $n \to \infty$ of…
Inspired by distributed resource allocation problems in dynamic topology networks, we initiate the study of distributed consensus with finite messaging passing. We first find a sufficient condition on the network graph for which no…
We study a rumour model from a percolation theory and branching process point of view. The existence of a giant component is related to the event where the rumour spreads out trough an infinite number of individuals. We present sharp lower…
We consider a random model for directed graphs whereby an arc is placed from one vertex to another with a prescribed probability which may vary from arc to arc. Using perturbation bounds as well as Chernoff inequalities, we show that the…
We introduce a new approach to model and analyze \emph{Mobility}. It is fully based on discrete mathematics and yields a class of mobility models, called the \emph{Markov Trace} Model. This model can be seen as the discrete version of the…
Bootstrap percolation is a prominent framework for studying the spreading of activity on a graph. We begin with an initial set of active vertices. The process then proceeds in rounds, and further vertices become active as soon as they have…