On pendant vertices in random graphs
Zbigniew Palka (1981)
Colloquium Mathematicae
Similarity:
Zbigniew Palka (1981)
Colloquium Mathematicae
Similarity:
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...
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...
Fountoulakis, Nikolaos, McDiarmid, Colin (2002)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
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.
Jan Rosiński, Wojbor A. Woyczyński (1987)
Colloquium Mathematicae
Similarity:
Balachandran, K., Kim, J.-H. (2010)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Ž. Mijajlović, P. Peruničić (1986)
Matematički Vesnik
Similarity:
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...
J. Legoupil (1966-1967)
Publications mathématiques et informatique de Rennes
Similarity:
J. Legoupil (1967-1968)
Publications mathématiques et informatique de Rennes
Similarity:
Mustafa, Ghulam, Nosh, Nusrat Anjum, Rashid, Abdur (2005)
Lobachevskii Journal of Mathematics
Similarity:
G. Trybuś (1974)
Applicationes Mathematicae
Similarity:
Subramanian, C.R. (2001)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
R. Kaufman (1970)
Studia Mathematica
Similarity:
Nguyen, Quy Hy, Nguyen, Ngoc Cuong (2015-12-08T12:59:38Z)
Acta Universitatis Lodziensis. Folia Mathematica
Similarity:
Ove Frank, Krzysztof Nowicki (1989)
Banach Center Publications
Similarity: