Related papers: Stochastic Sandpile Model: exact sampling and comp…

In this article we introduce a dynamic Erd\H{o}s-R\'enyi graph model, in which, independently for each vertex pair, edges appear and disappear according to a Markov on-off process. In studying the dynamic graph we present two main results.…

We derive asymptotic properties for a stochastic dynamic network model in a stochastic dynamic population. In the model, nodes give birth to new nodes until they die, each node being equipped with a social index given at birth. During the…

We introduce a new model of a stochastic sandpile on a graph $G$ containing a sink. When unstable, a site sends one grain to each of its neighbours independently with probability $p \in (0,1]$. For $p=1$, this coincides with the standard…

We discuss a graph-based approach for testing spatial point patterns. This approach falls under the category of data-random graphs, which have been introduced and used for statistical pattern recognition in recent years. Our goal is to test…

This paper is a short summary of the main results in the thesis [1]. Based on the P2P paradigm we construct a stochastic model for a live media streaming content delivery network. Starting from the behavior of the out degree process of each…

We suggest a simple model for the dynamics of granular particles in suspension which is suitable for an event driven algorithm, allowing to simulate $N=\mathcal{O}(10^6)$ particles or more. As a first application we consider a dense…

In complex systems, information propagation can be defined as diffused or delocalized, weakly localized, and strongly localized. This study investigates the application of graph neural network models to learn the behavior of a linear…

We present exact results for the dynamical structure function, i.e.~the density-density correlations for the 1/r^2 system of interacting particles at three special values of the coupling constant. The results are interpreted in terms of…

Real networks are often dynamic. In response to it, analyses of algorithms on {\em dynamic networks} attract more and more attentions in network science and engineering. Random walks on dynamic graphs also have been investigated actively in…

We show that Zhang's sandpile model (N,[a,b]) on N sites and with uniform additions on [a,b] has a unique stationary measure for all 0 <= a < b <= 1. This generalizes earlier results where this was shown in some special cases. We define the…

We build and study a data-driven procedure for the estimation of the stationary density f of an additive fractional SDE. To this end, we also prove some new concentrations bounds for discrete observations of such dynamics in stationary…

We consider a generational and continuous-time two-phase model of the cell cycle. The first model is given by a stochastic operator, and the second by a piecewise deterministic Markov process. In the second case we also introduce a…

Given a dynamic network, where edges appear and disappear over time, we are interested in finding sets of edges that have similar temporal behavior and form a dense subgraph. Formally, we define the problem as the enumeration of the maximal…

Spontaneous stratification of granular mixtures has been reported by Makse et al. [Nature 386, 379 (1997)] when a mixture of grains differing in size and shape is poured in a quasi-two-dimensional heap. We study this phenomenon using two…

We consider the stochastic sandpile model with uniform toppling rule on the integer line. During a uniform toppling, with probability $1/3$ one particle is sent to the right of the toppled vertex, with probability $1/3$ one particle is sent…

We study the invariant measure or the stationary density of a coupled discrete dynamical system as a function of the coupling parameter \epsilon (0 < \epsilon < 1/4). The dynamical system considered is chaotic and unsynchronized for this…

We consider an elementary model for self-organised criticality, the activated random walk on the complete graph. We introduce a discrete time Markov chain as follows. At each time step, we add an active particle at a random vertex and let…

A stochastic model for a mobile network is studied. Users enter the network, and then perform independent Markovian routes between nodes where they receive service according to the Processor-Sharing policy. Once their service requirement is…

In this article, we study finite dynamical systems defined over graphs, where the functions are applied asynchronously. Our goal is to quantify and understand stability of the dynamics with respect to the update sequence, and to relate this…

This article considers execution and analysis of laboratory experiments of pedestrians moving in a quasi-one-dimensional system with periodic boundary conditions. To analyze characteristics of jams in the system we aim to use the whole…