Australian Mathematical Society (AustMS): E-Journals
Not a member yet
3379 research outputs found
Sort by
A sparsity result for the dynamical Mordell-Lang conjecture in positive characteristic
No full texthttp://dx.doi.org/10.1017/S000497271200033
Bounds on the critical times for the Fisher-KPP equation
No full textThe Fisher–Kolmogorov–Petrovsky–Piskunov (Fisher–KPP) equation is one of the prototypical reaction–diffusion equations and is encountered in many areas, primarily in population dynamics. An important consideration for the phenomena modelled by diffusion equations is the length of the diffusive process. In this paper, three definitions of the critical time are given, and bounds are obtained by a careful construction of the upper and lower solutions. The comparison functions satisfy the nonlinear, but linearizable, partial differential equations of Fisher–KPP type. Results of the numerical simulations are displayed. Extensions to some classes of reaction–diffusion systems and an application to a spatially heterogeneous harvesting model are also presented.
doi:10.1017/S144618112100036
Central sequences in subhomogeneous unital C*-algebras
No full textAbstract. Suppose A is a unital subhomogeneous C*-algebra. We show that every central sequence in A is hypercentral if and only if every pointwise limit of a sequence of irreducible representations is multiplicity free. We also show that every central sequence in A is trivial if and only if every pointwise limit of irreducible representations is irreducible. We also give a nice repesentation of the latter algebras
Asymptotic behaviour of the stochastic Maki-Thompson model with a forgetting mechanism on open populations
No full textRumours have become part of our daily lives, and their spread has a negative impact on a variety of human affairs. Therefore, how to control the spread of rumours is an important topic. In this paper, we extend the classic Maki–Thompson model from a deterministic framework to a stochastic framework with a forgetting mechanism, because real-world person-to-person communications are inevitably affected by random factors. By constructing suitable stochastic Lyapunov functions, we show that the asymptotic behaviour of the stochastic rumour model is governed by the basic reproductive number. If this number is less than one, then the solution of the stochastic rumour model oscillates around the rumour-free equilibrium under extra mild conditions, indicating the extinction of the rumour with a probability of one. Otherwise, the solution always fluctuates around the endemic equilibrium under certain parametric restrictions, implying that the rumour will continually persist. In addition, we discuss a possible intervention strategy that stops the spread of rumours by strengthening the intensity of white noise, which is very different from the deterministic rumour model without white noise. Also, numerical simulations are conducted to support our analytical results.
doi: 10.1017/S144618112000017
Partitions of with identical representation function
No full textFor a given set and ,
is defined as the number of solutions of the equation with ordered pair . In this paper, we determine the structure of with such that for all , where is even integer
Space of initial values of a map with a quartic invariant
No full texthttp://dx.doi.org/10.1017/S000497271200033
On good approximations and Bowen-Series expansion
No full texthttp://dx.doi.org/10.1017/S000497271200033
On the growth of linear recurrences in function fields
No full texthttp://dx.doi.org/10.1017/S000497271200033
Investigation of determinism-related issues in the Sobol′ low-discrepancy sequence for producing sound global sensitivity analysis indices
Get PDFA computationally efficient and robust sampling scheme can support a sensitivity analysis of models to discover their behaviour through Quasi Monte Carlo approximation. This is especially useful for complex models, as often occur in environmental domains when model runtime can be prohibitive. The Sobol' sequence is one of the most used quasi-random low-discrepancy sequences as it can explore the parameter space significantly more evenly than pseudo-random sequences. The built-in determinism of the Sobol' sequence assists in achieving this attractive property. However, the Sobol' sequence tends to deteriorate in the sense that the estimated errors are distributed inconsistently across model parameters as the dimensions of a model increase. By testing multiple Sobol' sequence implementations, it is clear that the deterministic nature of the Sobol' sequence occasionally introduces relatively large errors in sensitivity indices produced by well-known global sensitivity analysis methods, and that the errors do not diminish by averaging through multiple replications. Problematic sensitivity indices may mistakenly guide modellers to make type I and II errors in trying to identify sensitive parameters, and this will potentially impact model reduction attempts based on these sensitivity measurements. This work investigates the cause of the Sobol' sequence's determinism-related issues.
References
I. A. Antonov and V. M. Saleev. An economic method of computing LPτ-sequences. USSR Comput. Math. Math. Phys. 19.1 (1979), pp. 252–256. doi: 10.1016/0041-5553(79)90085-5
P. Bratley and B. L. Fox. Algorithm 659: Implementing Sobol’s quasirandom sequence generator. ACM Trans. Math. Soft. 14.1 (1988), pp. 88–100. doi: 10.1145/42288.214372
J. Feinberg and H. P. Langtangen. Chaospy: An open source tool for designing methods of uncertainty quantification. J. Comput. Sci. 11 (2015), pp. 46–57. doi: 10.1016/j.jocs.2015.08.008 on p. C90).
S. Joe and F. Y. Kuo. Constructing Sobol sequences with better two-dimensional projections. SIAM J. Sci. Comput. 30.5 (2008), pp. 2635–2654. doi: 10.1137/070709359
S. Joe and F. Y. Kuo. Remark on algorithm 659: Implementing Sobol’s quasirandom sequence generator. ACM Trans. Math. Soft. 29.1 (2003), pp. 49–57. doi: 10.1145/641876.641879
W. J. Morokoff and R. E. Caflisch. Quasi-random sequences and their discrepancies. SIAM J. Sci. Comput. 15.6 (1994), pp. 1251–1279. doi: 10.1137/0915077
X. Sun, B. Croke, S. Roberts, and A. Jakeman. Comparing methods of randomizing Sobol’ sequences for improving uncertainty of metrics in variance-based global sensitivity estimation. Reliab. Eng. Sys. Safety 210 (2021), p. 107499. doi: 10.1016/j.ress.2021.107499
S. Tarantola, W. Becker, and D. Zeitz. A comparison of two sampling methods for global sensitivity analysis. Comput. Phys. Com. 183.5 (2012), pp. 1061–1072. doi: 10.1016/j.cpc.2011.12.015
S. Tezuka. Discrepancy between QMC and RQMC, II. Uniform Dist. Theory 6.1 (2011), pp. 57–64. url: https://pcwww.liv.ac.uk/~karpenk/JournalUDT/vol06/no1/5Tezuka11-1.pdf
I. M. Sobol′. On the distribution of points in a cube and the approximate evaluation of integrals. USSR Comput. Math. Math. Phys. 7.4 (1967), pp. 86–112. doi: 10.1016/0041-5553(67)90144-9
I. M. Sobol′. Sensitivity estimates for nonlinear mathematical models. Math. Model. Comput. Exp 1.4 (1993), pp. 407–414
A review of one-phase Hele-Shaw flows and a level-set method for nonstandard configurations
No full textThe classical model for studying one-phase Hele-Shaw flows is based on a highly nonlinear moving boundary problem with the fluid velocity related to pressure gradients via a Darcy-type law. In a standard configuration with the Hele-Shaw cell made up of two flat stationary plates, the pressure is harmonic. Therefore, conformal mapping techniques and boundary integral methods can be readily applied to study the key interfacial dynamics, including the Saffman–Taylor instability and viscous fingering patterns. As well as providing a brief review of these key issues, we present a flexible numerical scheme for studying both the standard and nonstandard Hele-Shaw flows. Our method consists of using a modified finite-difference stencil in conjunction with the level-set method to solve the governing equation for pressure on complicated domains and track the location of the moving boundary. Simulations show that our method is capable of reproducing the distinctive morphological features of the Saffman–Taylor instability on a uniform computational grid. By making straightforward adjustments, we show how our scheme can easily be adapted to solve for a wide variety of nonstandard configurations, including cases where the gap between the plates is linearly tapered, the plates are separated in time, and the entire Hele-Shaw cell is rotated at a given angular velocity.
doi:10.1017/S144618112100033