English
Related papers

Related papers: Branching-stable point processes

200 papers

Spreading information through a network of devices is a core activity for most distributed systems. As such, self-stabilizing algorithms implementing information spreading are one of the key building blocks enabling aggregate computing to…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-02-23 Yuanqiu Mo , Soura Dasgupta , Jacob Beal

This paper addresses stochastic stabilization in case where implementation of control policies is digital, i. e., when the dynamical system is treated continuous, whereas the control actions are held constant in predefined time steps. In…

Dynamical Systems · Mathematics 2022-11-08 Pavel Osinenko , Grigory Yaremenko

We study time continuous branching processes with exponentially distributed lifetimes, with two types of cells that proliferate according to binary fission. A range of possible system dynamics are considered, each of which is characterized…

Probability · Mathematics 2022-04-27 Nam H Nguyen , Marek Kimmel

The concepts of probability, statistics and stochastic theory are being successfully used in structural engineering. Markov Chain modelling is a simple stochastic process model that has found its application in both describing stochastic…

Applications · Statistics 2007-08-14 K. Balaji Rao

The defining feature of chaos is its hypersensitivity to small perturbations. However, we report a stability of branched flow against large perturbations where the classical trajectories are chaotic, showing that strong perturbations are…

Disordered Systems and Neural Networks · Physics 2014-09-03 Bo Liu

In this paper we investigate the action of self-consistent transfer operators (STOs) on Birkhoff cones and give sufficient conditions for stability of their fixed points. Our approach relies on the order preservation properties of STOs that…

Dynamical Systems · Mathematics 2024-11-26 Roberto Castorrini , Stefano Galatolo , Matteo Tanzi

The simple Galton--Watson process describes populations where individuals live one season and are then replaced by a random number of children. It can also be viewed as a way of generating random trees, each vertex being an individual of…

Statistics Theory · Mathematics 2008-11-17 Peter Jagers , Serik Sagitov

This work is concerned with the stability properties of linear stochastic differential equations with random (drift and diffusion) coefficient matrices, and the stability of a corresponding random transition matrix (or exponential…

Probability · Mathematics 2019-05-02 Adrian N. Bishop , Pierre Del Moral

Branching processes are a class of continuous-time Markov chains (CTMCs) with ubiquitous applications. A general difficulty in statistical inference under partially observed CTMC models arises in computing transition probabilities when the…

Computation · Statistics 2015-03-10 Jason Xu , Vladimir N. Minin

A two-type continuous-state branching process in varying environments is constructed as the pathwise unique solution of a system of stochastic equations driven by time-space noises, where the pathwise uniqueness is derived from a comparison…

Probability · Mathematics 2025-02-07 Zenghu Li , Junyan Zhang

We prove several limit theorems that relate coalescent processes to continuous-state branching processes. Some of these theorems are stated in terms of the so-called generalized Fleming-Viot processes, which describe the evolution of a…

Probability · Mathematics 2007-05-23 Jean Bertoin , Jean-François Le Gall

We consider a general method for the approximation of the distribution of a process conditioned to not hit a given set. Existing methods are based on particle system that are failable, in the sense that, in many situations , they are not…

Probability · Mathematics 2016-06-30 William Oçafrain , Denis Villemonais

Dilative semistability extends the notion of semi-selfsimilarity for infinitely divisible stochastic processes by introducing an additional scaling in the convolution exponent. It is shown that this scaling relation is a natural extension…

Probability · Mathematics 2016-03-14 Peter Kern , Lina Wedrich

In this paper we present a language for finite state continuous time Bayesian networks (CTBNs), which describe structured stochastic processes that evolve over continuous time. The state of the system is decomposed into a set of local…

Artificial Intelligence · Computer Science 2013-01-07 Uri Nodelman , Christian R. Shelton , Daphne Koller

A unified approach to studying convergence and stochastic stability of continuous time consensus protocols (CPs) is presented in this work. Our method applies to networks with directed information flow; both cooperative and noncooperative…

Optimization and Control · Mathematics 2012-06-05 Georgi S. Medvedev

In this paper, a special sequence of controlled branching processes is considered. We provide a simple set of sufficient conditions for the weak convergence of such processes to a weak solution to a kind of continuous branching processes…

Probability · Mathematics 2022-04-15 Jiawei Liu

A notion of disturbance propagation stability is defined for dynamical network processes, in terms of decrescence of an input-output energy metric along cutsets away from the disturbance source. A characterization of the disturbance…

Systems and Control · Electrical Eng. & Systems 2022-10-11 Sandip Roy , Subir Sarker , Mengran Xue

This paper investigates the stability of switched linear systems whose switching signal is modeled as a stochastic process called a regenerative process. We show that the mean stability of such a switched system is characterized by the…

Optimization and Control · Mathematics 2016-11-04 Masaki Ogura , Clyde F. Martin

Consider a branching Markov process, $X = (X(t), t \ge 0)$, with non-local branching mechanism. Studying the asymptotic behaviour of the moments of X has recently received attention in the literature [6, 7] due to the importance of these…

Probability · Mathematics 2025-02-03 Christopher B. C. Dean , Emma Horton

We define a Markov process on the partitions of $[n]=\{1,\ldots,n\}$ by drawing a sample in $[n]$ at each time of a Poisson process, by merging blocks that contain one of these points and by leaving all other blocks unchanged. This…

Probability · Mathematics 2018-09-03 Sophie Lemaire