Displaying similar documents to “Evolution in random environment and structural instability.”

Random attractors for stochastic two-compartment Gray-Scott equations with a multiplicative noise

Xiaoyao Jia, Juanjuan Gao, Xiaoquan Ding (2016)

Open Mathematics

Similarity:

In this paper, we consider the existence of a pullback attractor for the random dynamical system generated by stochastic two-compartment Gray-Scott equation for a multiplicative noise with the homogeneous Neumann boundary condition on a bounded domain of space dimension n ≤ 3. We first show that the stochastic Gray-Scott equation generates a random dynamical system by transforming this stochastic equation into a random one. We also show that the existence of a random attractor for the...

On the convergence of the stochastic Galerkin method for random elliptic partial differential equations

Antje Mugler, Hans-Jörg Starkloff (2013)

ESAIM: Mathematical Modelling and Numerical Analysis - Modélisation Mathématique et Analyse Numérique

Similarity:

In this article we consider elliptic partial differential equations with random coefficients and/or random forcing terms. In the current treatment of such problems by stochastic Galerkin methods it is standard to assume that the random diffusion coefficient is bounded by positive deterministic constants or modeled as lognormal random field. In contrast, we make the significantly weaker assumption that the non-negative random coefficients can be bounded strictly away from zero and infinity...

Reinforced walk on graphs and neural networks

Józef Myjak, Ryszard Rudnicki (2008)

Studia Mathematica

Similarity:

A directed-edge-reinforced random walk on graphs is considered. Criteria for the walk to end up in a limit cycle are given. Asymptotic stability of some neural networks is shown.

The sizes of components in random circle graphs

Ramin Imany-Nabiyyi (2008)

Discussiones Mathematicae Graph Theory

Similarity:

We study random circle graphs which are generated by throwing n points (vertices) on the circle of unit circumference at random and joining them by an edge if the length of shorter arc between them is less than or equal to a given parameter d. We derive here some exact and asymptotic results on sizes (the numbers of vertices) of "typical" connected components for different ways of sampling them. By studying the joint distribution of the sizes of two components, we "go into" the structure...