اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدRumour Processes on N
71
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We study four discrete time stochastic systems on $bbN$ modeling processes of rumour spreading. The involved individuals can either have an active or a passive role, speaking up or asking for the rumour. The appetite in spreading or hearing the rumour is represented by a set of random variables whose distributions may depend on the individuals. Our goal is to understand - based on those random variables distribution - whether the probability of having an infinite set of individuals knowing the rumour is positive or not.
قيم البحث
اقرأ أيضاً
The aim of this paper is to study rumor processes in random environment. In a rumor process a signal starts from the stations of a fixed vertex (the root) and travels on a graph from vertex to vertex. We consider two rumor processes. In the firework
process each station, when reached by the signal, transmits it up to a random distance. In the reverse firework process, on the other hand, stations do not send any signal but they listen for it up to a random distance. The first random environment that we consider is the deterministic 1-dimensional tree N with a random number of stations on each vertex; in this case the root is the origin of N. We give conditions for the survival/extinction on almost every realization of the sequence of stations. Later on, we study the processes on Galton-Watson trees with random number of stations on each vertex. We show that if the probability of survival is positive, then there is survival on almost every realization of the infinite tree such that there is at least one station at the root. We characterize the survival of the process in some cases and we give sufficient conditions for survival/extinction.
We consider the Maki-Thompson model for the stochastic propagation of a rumour within a population. We extend the original hypothesis of homogenously mixed population by allowing for a small-world network embedding the model. This structure is realiz
ed starting from a $k$-regular ring and by inserting, in the average, $c$ additional links in such a way that $k$ and $c$ are tuneable parameter for the population architecture. We prove that this system exhibits a transition between regimes of localization (where the final number of stiflers is at most logarithmic in the population size) and propagation (where the final number of stiflers grows algebraically with the population size) at a finite value of the network parameter $c$. A quantitative estimate for the critical value of $c$ is obtained via extensive numerical simulations.
We prove several results concerning classifications, based on successive observations $(X_1,..., X_n)$ of an unknown stationary and ergodic process, for membership in a given class of processes, such as the class of all finite order Markov chains.
In this paper, we study the compressibility of random processes and fields, called generalized Levy processes, that are solutions of stochastic differential equations driven by $d$-dimensional periodic Levy white noises. Our results are based on the
estimation of the Besov regularity of Levy white noises and generalized Levy processes. We show in particular that non-Gaussian generalized Levy processes are more compressible in a wavelet basis than the corresponding Gaussian processes, in the sense that their $n$-term approximation error decays faster. We quantify this compressibility in terms of the Blumenthal-Getoor index of the underlying Levy white noise.
We consider a new family of $R^d$-valued L{e}vy processes that we call Lamperti stable. One of the advantages of this class is that the law of many related functionals can be computed explicitely (see for instance cite{cc}, cite{ckp}, cite{kp} and ci
te{pp}). This family of processes shares many properties with the tempered stable and the layered stable processes, defined in Rosinski cite{ro} and Houdre and Kawai cite{hok} respectively, for instance their short and long time behaviour. Additionally, in the real valued case we find a series representation which is used for sample paths simulation. In this work we find general properties of this class and we also provide many examples, some of which appear in recent literature.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
