Related papers: Meteor process on ${\mathbb Z}^d$
We study geometric presentations of braid groups for particles that are constrained to move on a graph, i.e. a network consisting of nodes and edges. Our proposed set of generators consists of exchanges of pairs of particles on junctions of…
We consider three kinds of discrete-time arrival processes: transient, intermediate and recurrent, characterized by a finite, possibly finite and infinite number of events, respectively. In this context, we study renewal processes which are…
We consider the telegraph process with two velocities, $a_1>a_2\in\mathbb{R}$, and two rates of reversal, $\lambda_1,\lambda_2>0$. We study some of its features with respect to the conditional probability measure where both the initial…
We study the homogenization of a diffusion process which takes place in a binary structure formed by an ambiental connected phase surrounding a suspension of very small spheres distributed in an $\veps$-periodic network. The asymptotic…
Markov decision processes (MDPs) are a popular model for decision-making in the presence of uncertainty. The conventional view of MDPs in verification treats them as state transformers with probabilities defined over sequences of states and…
We study by extensive numerical simulations the dynamics of a hard-core tracer particle (TP) in presence of two competing types of disorder - frozen convection flows on a square random Manhattan lattice and a crowded dynamical environment…
The solar system is dusty, and would become dustier over time as asteroids collide and comets disintegrate, except that small debris particles in interplanetary space do not last long. They can be ejected from the solar system by Jupiter,…
Meteor clusters are typically defined as groups of meteors that appear close together in both space and time. To date, only a handful of such events have been recorded instrumentally and analysed in detail. In many documented cases, thermal…
We study spreading on networks where the contact dynamics between the nodes is governed by a random process and where the inter-contact time distribution may differ from the exponential. We consider a process of imperfect spreading, where…
The purpose of this article is to give another proof on the existence of a diffusion on a junction, which has been already done by M.Freidlin and S-J.Sheu, in Diffusion processes on graphs, (2000). We generalize the result to time dependent…
A limit theorem for a sequence of diffusion processes on graphs is proved in a case when vary both parameters of the processes (the drift and diffusion coefficients on every edge and the asymmetry coefficients in every vertex), and…
In spatial networks vertices are arranged in some space and edges may cross. When arranging vertices in a 1-dimensional lattice edges may cross when drawn above the vertex sequence as it happens in linguistic and biological networks. Here…
We give a generalization to a continuous setting of the classic Markov chain tree Theorem. In particular, we consider an irreducible diffusion process on a metric graph. The unique invariant measure has an atomic component on the vertices…
We consider distributed model-checking of Monadic Second-Order logic (MSO) on graphs which constitute the topology of communication networks. The graph is thus both the structure being checked and the system on which the distributed…
Given a solution to a recursive distributional equation, a natural (and non-trivial) question is whether the corresponding recursive tree process is endogenous. That is, whether the random environment almost surely defines the tree process.…
We study Markov processes where the "time" parameter is replaced by paths in a directed graph from an initial vertex to a terminal one. Along each directed path the process is Markov and has the same distribution as the one along any other…
We consider a class of birth-and-death processes describing a population made of $d$ sub-populations of different types which interact with one another. The state space is $\mathbb{Z}_+^d$ (unbounded). We assume that the population goes…
In extreme value statistics, the peaks-over-threshold method is widely used. The method is based on the generalized Pareto distribution characterizing probabilities of exceedances over high thresholds in $\mathbb {R}^d$. We present a…
A graph generative model defines a distribution over graphs. One type of generative model is constructed by autoregressive neural networks, which sequentially add nodes and edges to generate a graph. However, the likelihood of a graph under…
Crystals arise as the result of the breaking of a spatial translation symmetry. Similarly, translation symmetries can also be broken in time so that discrete time crystals appear. Here, we introduce a method to describe, characterize, and…