Multitarget search on complex networks: A logarithmic growth of global mean random cover time.
Sign Up to like & getrecommendations! Published in 2017 at "Chaos"
DOI: 10.1063/1.4990866
Abstract: We investigate multitarget search on complex networks and derive an exact expression for the mean random cover time that quantifies the expected time a walker needs to visit multiple targets. Based on this, we recover… read more here.
Keywords: time; multitarget search; mean random; random ... See more keywords
Weak pullback mean random attractors for the stochastic convective Brinkman–Forchheimer equations and locally monotone stochastic partial differential equations
Sign Up to like & getrecommendations! Published in 2022 at "Infinite Dimensional Analysis, Quantum Probability and Related Topics"
DOI: 10.1142/s0219025722500059
Abstract: This work is concerned about the asymptotic behavior of the solutions of the two- and three-dimensional stochastic convective Brinkman–Forchheimer (SCBF) equations [Formula: see text] driven by white noise with nonlinear diffusion terms (for some [Formula:… read more here.
Keywords: mean random; random attractors; weak pullback; formula see ... See more keywords