Search

In this note we re-examine the analysis of the paper 'On the martingale property of stochastic exponentials' by Wong and Heyde (2004). Some counterexamples are presented and alternative formulations are discussed. [ABSTRACT FROM AUTHOR]

In this paper we investigate the relationship between the sampling formula and Laplace transform associated with the two-parameter Poisson-Dirichlet distribution. We conclude that they are equivalent to determining the corresponding infinite-dimensional distribution. With these tools, a central limit theorem is established associated with the infinitely-many-neutral-alleles model at any fixed time. We also obtain the probability generating function of random sampling from a generalized two-parameter diffusion process. At the end of the paper a selection case is considered. [ABSTRACT FROM AUTHOR]

In this paper we address the general issue of estimating the sensitivity of the expectation of a random variable with respect to a parameter characterizing its evolution. In finance, for example, the sensitivities of the price of a contingent claim are called the Greeks. A new way of estimating the Greeks has recently been introduced in Elie, Fermanian and Touzi (2007) through a randomization of the parameter of interest combined with nonparametric estimation techniques. In this paper we study another type of estimator that turns out to be closely related to the score function, which is well known to be the optimal Greek weight. This estimator relies on the use of two distinct kernel functions and the main interest of this paper is to provide its asymptotic properties. Under a slightly more stringent condition, its rate of convergence is the same as the one of the estimator introduced in Elie, Fermanian and Touzi (2007) and outperforms the finite differences estimator. In addition to the technical interest of the proofs, this result is very encouraging in the dynamic of creating new types of estimator for the sensitivities. [ABSTRACT FROM AUTHOR]

We present new ideas about the type of random tessellation which evolves through successive division of its cells. These ideas are developed in an intuitive way, with many pictures and only a modicum of mathematical formalism—so that the wide application of the ideas is clearly apparent to all readers. A vast number of new tessellation models, with known probability distribution for the volume of the typical cell, follow from the concepts in this paper. There are other interesting models for which results are not presented (or presented only through simulation methods), but these models have illustrative value. A large agenda of further research is opened up by the ideas in this paper. [ABSTRACT FROM AUTHOR]

In this paper we deal with generalized fractional kinetic equations driven by a Gaussian noise, white in time and correlated in space, and where the diffusion operator is the composition of the Bessel and Riesz potentials for any fractional parameters. We give results on the existence and uniqueness of solutions by means of a weak formulation and study the Hölder continuity. Moreover, we prove the existence of a smooth density associated to the solution process and study the asymptotics of this density. Finally, when the diffusion coefficient is constant, we look for its Gaussian index. [ABSTRACT FROM AUTHOR]

In this paper we obtain some equivalent conditions and sufficient conditions for the local and nonlocal asymptotics of the φ-moments of the overshoot and undershoot of a random walk, where ~ is a nonnegative, long-tailed function. By the strong Markov property, it can be shown that the moments of the overshoot and undershoot and the moments of the first ascending ladder height of a random walk satisfy some renewal equations. Therefore, in this paper we first investigate the local and nonlocal asymptotics for the moments of the first ascending ladder height of a random walk, and then give some equivalent conditions and sufficient conditions for the asymptotics of the solutions to some renewal equations. Using the above results, the main results of this paper are obtained. [ABSTRACT FROM AUTHOR]

Designed to have power against all alternatives, omnibus consistent tests are the primary econometric tools for testing the correct specification of parametric conditional means when there is no information about the possible alternative. The main purpose of this paper is to show that, contrary to what is generally believed, omnibus specification tests only have substantial local power against alternatives in a finite-dimensional space (usually unknown to the researcher). We call such a space the principal space. We characterize and estimate the principal space for Cram?r?von Mises tests. These results are some of the by-products of a detailed theoretical power analysis carried out in the paper. This investigation focuses on the class of the so-called integrated consistent tests under possibly heteroskedastic time series. A Monte Carlo experiment examines the finite-sample properties of tests and estimators of preferred alternatives. Finally, an application of our theory to test the martingale difference hypothesis of some exchange rates provides new information on the rejection of omnibus tests and illustrates our findings. [ABSTRACT FROM AUTHOR]

The aim of this paper is to provide the conditions necessary to reduce the complexity of state filtering for finite stochastic systems (FSSs). A concept of lumpability for FSSs is introduced. In this paper we assert that the unnormalised filter for a lumped FSS has linear dynamics. Two sufficient conditions for such a lumpability property to hold are discussed. We show that the first condition is also necessary for the lumped FSS to have linear dynamics. Next, we prove that the second condition allows the filter of the original FSS to be obtained directly from the filter for the lumped FSS. Finally, we generalise an earlier published result for the approximation of a general FSS by a lumpable FSS. [ABSTRACT FROM AUTHOR]

This paper presents the results of a study that sheds new light on the shape of indifference curves in the Marschak-Machina triangle. The most important observation, obtained non-parametrically, concerns jumps in indifference curves at the triangle legs towards the triangle origin. These jumps, however, do not appear at the hypotenuse. The pattern observed suggests discontinuity in lottery valuation when the range of lottery outcomes changes and is best explained by decision-making models based on the psychological phenomenon of range dependence (Parducci, 1965; Cohen, 1992; Kontek & Lewandowski, 2018). Models founded on other psychological phenomena, e.g., discontinuity in decision weights (Kahneman & Tversky, 1979), cumulative probability weighting (Tversky & Kahneman, 1992), attention shifting (Birnbaum, 2008), overweighting of salient payoffs (Bordallo, Gennaioli & Shefrin, 2012), and treating stated probabilities as imperfect information (Viscusi, 1989), predict indifference curve shapes that differ from the one obtained in this study. [ABSTRACT FROM AUTHOR]

In short, this paper has shown that by integrating the recent advances in network modeling and solution procedures with the most recent advances of the computer age, we can now provide financial managers with the kinds of information and communication interaction they need in a usable time frame. The implications of this study are significant for the field of finance. Clearly, it is now feasible to solve very large continuous, integer and mixed integer problems when the continuous variables can be cast as a network. Since most cash flow systems fall into this category, it appears that networks have broad application possibilities in finance. Add to this the communication advantages of networks, and the potential is very great indeed. Further research needs to be undertaken to identify and formulate financial problems as networks and to train people to think in terms of the graph structure. The important thing to bear in mind is that it is unnecessary to be able to specify all problem characteristics in a rigorous mathematical sense at the onset of constructing a network model; often parenthetical annotations will maintain these characteristics in view while the model undergoes refinement. Once the stage is finally reached at which the crucial interrelationships are singled out by the manager working with the operations researcher specialist, the effort to identify the "best" formulation and its appropriately matched solution approach can be undertaken by the mathematical programmers. [ABSTRACT FROM AUTHOR]

A semiring is a set $S$ with two binary operations $+ $ and $\cdot $ such that both the additive reduct ${S}_{+ } $ and the multiplicative reduct ${S}_{\bullet } $ are semigroups which satisfy the distributive laws. If $R$ is a ring, then, following Chaptal [‘Anneaux dont le demi-groupe multiplicatif est inverse’, C. R. Acad. Sci. Paris Ser. A–B 262 (1966), 274–277], ${R}_{\bullet } $ is a union of groups if and only if ${R}_{\bullet } $ is an inverse semigroup if and only if ${R}_{\bullet } $ is a Clifford semigroup. In Zeleznikow [‘Regular semirings’, Semigroup Forum 23 (1981), 119–136], it is proved that if $R$ is a regular ring then ${R}_{\bullet } $ is orthodox if and only if ${R}_{\bullet } $ is a union of groups if and only if ${R}_{\bullet } $ is an inverse semigroup if and only if ${R}_{\bullet } $ is a Clifford semigroup. The latter result, also known as Zeleznikow’s theorem, does not hold in general even for semirings $S$ with ${S}_{+ } $ a semilattice Zeleznikow [‘Regular semirings’, Semigroup Forum 23 (1981), 119–136]. The Zeleznikow problem on a certain class of semirings involves finding condition(s) such that Zeleznikow’s theorem holds on that class. The main objective of this paper is to solve the Zeleznikow problem for those semirings $S$ for which ${S}_{+ } $ is a semilattice. [ABSTRACT FROM AUTHOR]

Consider a circle with perimeter N > 1 on which k < N segments of length 1 are sampled in an independent and identically distributed manner. In this paper we study the probability π(k, N) that these k segments do not overlap; the density φ(⋅) of the position of the disks on the circle is arbitrary (that is, it is not necessarily assumed uniform). Two scaling regimes are considered. In the first we set k ≡ α √N, and it turns out that the probability of interest converges (N → ∞) to an explicitly given positive constant that reflects the impact of the density φ(⋅). In the other regime k scales as αN, and the nonoverlap probability decays essentially exponentially; we give the associated decay rate as the solution to a variational problem. Several additional ramifications are presented. [ABSTRACT FROM AUTHOR]

In this paper we generalize the martingale of Kella and Whitt to the setting of Lévy-type processes and show that the (local) martingales obtained are in fact square-integrable martingales which upon dividing by the time index converge to zero almost surely and in L². The reflected Lévy-type process is considered as an example. [ABSTRACT FROM AUTHOR]

This paper presents a powerful characterisation for the structure of internal vertices of the STIT's I-segments. The characterisation allows certain mathematical analyses to be performed easily. We demonstrate this by deriving new results for various topological properties of the tessellation: for example, the numbers of various types of edge and cell side within the typical I-segment. The characterisation also provides a tool for the calculations of metric properties of the tessellation; many new length distributions and frame-coverage results are given. [ABSTRACT FROM AUTHOR]

In this paper we quantify the efficiency of parallelism in systems that are prone to failures and exhibit power law processing delays. We characterize the performance of two prototype schemes of parallelism, redundant and split, in terms of both the power law exponent and exact asymptotics of the delay distribution tail. We also develop the optimal splitting scheme which ensures that split always outperforms redundant. [ABSTRACT FROM AUTHOR]

Sharp tail bounds for the sum of d random variables with given marginal distributions and arbitrary dependence structure have been known since Makarov (1981) and Rüschendorf (1982) ford = 2 and, in some examples, for d ≥ 3. Based on a duality result, dual bounds have been introduced in Embrechts and Puccetti (2006b). In the homogeneous case, F1 = ··· = Fn, with monotone density, sharp tail bounds were recently found in Wang and Wang (2011). In this paper we establish the sharpness of the dual bounds in the homogeneous case under general conditions which include, in particular, the case of monotone densities and concave densities. We derive the corresponding optimal couplings and also give an effective method to calculate the sharp bounds. [ABSTRACT FROM AUTHOR]

The tempered fundamental group of a p-adic variety classifies analytic étale covers that become topological covers for Berkovich topology after pullback by some finite étale cover. This paper constructs cospecialization homomorphisms between the (p′) versions of the tempered fundamental group of the fibers of a smooth morphism with polystable reduction. We study the question for families of curves in another paper. To construct them, we will start by describing the pro-(p′) tempered fundamental group of a smooth and proper variety with polystable reduction in terms of the reduction endowed with its log structure, thus defining tempered fundamental groups for log polystable varieties. [ABSTRACT FROM AUTHOR]

Almost all populations existing in the real world are finite populations. Specifically, in the areas relevant to lifetime modeling and analysis, finite populations are frequently encountered. However, descriptions of failure/survival patterns of elements in the finite population have not yet been properly established. In particular, it is questionable whether the ordinary failure rate can be defined for finite populations in the same way and whether the corresponding interpretations are still valid. In this paper we consider two kinds of finite mixed population and provide new definitions for their failure rates. Then we clarify the notion of failure rate in finite populations. [ABSTRACT FROM AUTHOR]

Two classical stochastic processes are considered, the Ehrenfest process, introduced in 1907 in the kinetic theory of gases to describe the heat exchange between two bodies, and the Engset process, one of the early (1918) stochastic models of communication networks. In this paper we investigate the asymptotic behavior of the distributions of hitting times of these two processes when the number of particles/sources goes to infinity. Results concerning the hitting times of boundaries in particular are obtained. We rely on martingale methods; a key ingredient is an important family of simple nonnegative martingales, an analogue, for the Ehrenfest process, of the exponential martingales used in the study of random walks or of Brownian motion. [ABSTRACT FROM AUTHOR]

Dependence between coordinate extremes is a key factor in any multivariate risk assessment. Hence, it is of interest to know whether the components of a given multivariate random vector exhibit asymptotic independence or asymptotic dependence. In the latter case the structure of the asymptotic dependence has to be clarified. In the multivariate setting it is common to have an explicit form of the density rather than the distribution function. In this paper we therefore give criteria for asymptotic dependence in terms of the density. We consider distributions with light tails and restrict attention to continuous unimodal densities defined on the whole space or on an open convex cone. For simplicity, the density is assumed to be homothetic: all level sets have the same shape. Balkema and Nolde (2010) contains conditions on the shape which guarantee asymptotic independence. The situation for asymptotic dependence, treated in the present paper, is more delicate. [ABSTRACT FROM AUTHOR]

Tessellations of ℝ³ that use convex polyhedral cells to fill the space can be extremely complicated. This is especially so for tessellations which are not 'facet-to-facet', that is, for those where the facets of a cell do not necessarily coincide with the facets of that cell's neighbours. Adjacency concepts between neighbouring cells (or between neighbouring cell elements) are not easily formulated when facets do not coincide. In this paper we make the first systematic study of these topological relationships when a tessellation of ℝ³ is not facet-to-facet. The results derived can also be applied to the simpler facet-tofacet case. Our study deals with both random tessellations and deterministic 'tilings'. Some new theory for planar tessellations is also given. [ABSTRACT FROM AUTHOR]

This paper describes an estimator of the additive components of a nonparametric additive model with an unknown link function. When the additive components and link function are twice differentiable with sufficiently smooth second derivatives, the estimator is asymptotically normally distributed with a rate of convergence in probability of n−2/5. This is true regardless of the (finite) dimension of the explanatory variable. Thus, the estimator has no curse of dimensionality. Moreover, the asymptotic distribution of the estimator of each additive component is the same as it would be if the link function and the other components were known with certainty. Thus, asymptotically there is no penalty for not knowing the link function or the other components. [ABSTRACT FROM AUTHOR]

The notion of completeness between two random elements has been considered recently to provide identification in nonparametric instrumental problems. This condition is quite abstract, however, and characterizations have been obtained only in special cases. This paper considers a nonparametric model between the two variables with an additive separability and a large support condition. In this framework, different versions of completeness are obtained, depending on which regularity conditions are imposed. This result allows one to establish identification in an instrumental nonparametric regression with limited endogenous regressor, a case where the control variate approach breaks down. [ABSTRACT FROM AUTHOR]

In this paper we consider the probabilities of finite- and infinite-time absolute ruins in the renewal risk model with constant premium rate and constant force of interest. In the particular case of the compound Poisson model, explicit asymptotic expressions for the finite- and infinite-time absolute ruin probabilities are given. For the general renewal risk model, we present an asymptotic expression for the infinite-time absolute ruin probability. Conditional distributions of Poisson processes and probabilistic techniques regarding randomly weighted sums are employed in the course of this study. [ABSTRACT FROM AUTHOR]

Studying the geometry generated by Gaussian and Gaussian-related random fields via their excursion sets is now a well-developed and well-understood subject. The purely non-Gaussian scenario has, however, not been studied at all. In this paper we look at three classes of stable random fields, and obtain asymptotic formulae for the mean values of various geometric characteristics of their excursion sets over high levels. While the formulae are asymptotic, they contain enough information to show that not only do stable random fields exhibit geometric behaviour very different from that of Gaussian fields, but they also differ significantly among themselves. [ABSTRACT FROM AUTHOR]

In this paper we present formulae for contact distributions of a Voronoi tessellation generated by a homogeneous Poisson point process in the d-dimensional Euclidean space. Expressions are given for the probability density functions and moments of the linear and spherical contact distributions. They are double and simple integral formulae, which are tractable for numerical evaluation and for large d. The special cases d = 2 and d = 3 are investigated in detail, while, for d = 3, the moments of the spherical contact distribution function are expressed by standard functions. Also, the closely related chord length distribution functions are considered. [ABSTRACT FROM AUTHOR]

In this paper, using the framework of self-regularity, we propose a hybrid adaptive algorithm for the linear optimization problem. If the current iterates are far from a central path, the algorithm employs a self-regular search direction, otherwise the classical Newton search direction is employed. This feature of the algorithm allows us to prove a worst case iteration bound. Our result matches the best iteration bound obtained by the pure self-regular approach and improves on the worst case iteration bound of the classical algorithm. [ABSTRACT FROM AUTHOR]

This paper presents a sharp boundary growth estimate for all positive superharmonic functions u in a smooth domain Ω in ℝ2 satisfying the nonlinear inequality -Δu(x) ≤ cδΩ(x)-αu(x)p for all x ϵ Ωwhere c > 0, α ϵ ℝ and p > 0, and δΩ(x) stands for the distance from a point x to the boundary of Ω. A result is applied to show the existence of nontangential limits of such superharmonic functions. [ABSTRACT FROM AUTHOR]

Let X be a pure-jump subordinator (i.e. nondecreasing Lévy process with no drift) with infinite Lévy measure, let Xϵ be the sum of jumps not exceeding ϵ, and let μ(ϵ) = E[Xϵ(l)]. We study the question of weak convergence of Xϵ/μ(ϵ) as ϵ ↓ 0, in terms of the limit behavior of μ(ϵ)/ϵ. The most interesting case reduces to the weak convergence of Xϵ/ϵ to a subordinator whose marginals are generalized Dickman distributions; we give some necessary and sufficient conditions for this to hold. For a certain significant class of subordinators for which the latter convergence holds, and whose most prominent representative is the gamma process, we give some detailed analysis regarding the convergence quality (in particular, in the context of approximating X itself). This paper completes, in some respects, the study made by Asmussen and Rosiński (2001). [ABSTRACT FROM AUTHOR]

In this paper we consider two classes of reflected Ornstein-Uhlenbeck (OU) processes: the reflected OU process with jumps and the Markov-modulated reflected OU process. We prove that their stationary distributions exist. Furthermore, for the jump reflected OU process, the Laplace transform (LT) of the stationary distribution is given. As for the Markov-modulated reflected OU process, we derive an equation satisfied by the LT of the stationary distribution. [ABSTRACT FROM AUTHOR]

In this paper we study a generalized Pólya urn with balls of two colors and a random triangular replacement matrix. We extend some results of Janson (2004), (2005) to the case where the largest eigenvalue of the mean of the replacement matrix is not in the dominant class. Using some useful martingales and the embedding method introduced in Athreya and Karlin (1968), we describe the asymptotic composition of the urn after the nth draw, for large n. [ABSTRACT FROM AUTHOR]

In this paper we study efficient simulation algorithms for estimating P(X > x), where X is the total time of a job with ideal time T that needs to be restarted after a failure. The main tool is importance sampling, where a good importance distribution is identified via an asymptotic description of the conditional distribution of T given X > x. If T is constant, the problem reduces to the efficient simulation of geometric sums, and a standard algorithm involving a Cramér-type root, γ(t), is available. However, we also discuss an algorithm that avoids finding the root. If T is random, particular attention is given to T having either a gamma-like tail or a regularly varying tail, and to failures at Poisson times. Different types of conditional limit occur, in particular exponentially tilted Gumbel distributions and Pareto distributions. The algorithms based upon importance distributions for T using these asymptotic descriptions have bounded relative error as x → ∞ when combined with the ideas used for a fixed t. Nevertheless, we give examples of algorithms carefully designed to enjoy bounded relative error that may provide little or no asymptotic improvement over crude Monte Carlo simulation when the computational effort is taken into account. To resolve this problem, an alternative algorithm using two-sided Lundberg bounds is suggested. [ABSTRACT FROM AUTHOR]

In this paper, a stochastic integral of Ornstein-Uhlenbeck type is represented to be the sum of two independent random variables: one has a tempered stable distribution and the other has a compound Poisson distribution. In distribution, the compound Poisson random variable is equal to the sum of a Poisson-distributed number of positive random variables, which are independent and identically distributed and have a common specified density function. Based on the representation of the stochastic integral, we prove that the transition distribution of the tempered stable Ornstein-Uhlenbeck process is self- decomposable and that the transition density is a C∞-function. [ABSTRACT FROM AUTHOR]

The goal of this paper is to provide formulae for the expectation and variance of the height and length of the ancestral recombination graph (ARG). While the formula for the expectation of the height is known (see, e.g. Krone and Neuhauser (1997)), the other formulae seem to be new. We obtain in particular (see Theorem 4.1) a very simple formula which expresses the expectation of the length of the ARG as a linear combination of the expectations of both the length of the coalescent tree and the height of the ARO. Finally, we study the speed at which the ARG comes down from infinity. [ABSTRACT FROM AUTHOR]

This paper derives an exact discrete time representation corresponding to a triangular cointegrated continuous time system with mixed stock and flow variables and observable stochastic trends. The discrete time model inherits the triangular structure of the underlying continuous time system and does not suffer from the apparent excess differencing that has been found in some related work. It can therefore serve as a basis for the study of the asymptotic sampling properties of estimators of the model's parameters. Some further analytical and computational results that enable Gaussian estimation to be implemented are also provided. [ABSTRACT FROM AUTHOR]

It is shown that a simple deduction engine can be developed for a propositional logic that follows the normal rules of classical logic in symbolic form, but the description of what is known about a proposition uses two numeric state variables that conveniently describe unknown and inconsistent, as well as true and false. Partly true and partly false can be included in deductions. The multi-valued logic is easily understood as the state variables relate directly to true and false. The deduction engine provides a convenient standard method for handling multiple or complicated logical relations. It is particularly convenient when the deduction can start with different propositions being given initial values of true or false. It extends Horn clause based deduction for propositional logic to arbitrary clauses. The logic system used has potential applications in many areas. A comparison with propositional logic makes the paper self-contained. [ABSTRACT FROM AUTHOR]

The article offers focuses on the response by the authors on raised issues on their unit of root testing. It notes that authors acknowledged the issues raised by the researchers which includes the admissibility of conservative union of rejections, selection between union of rejections (UR) and conservative UR, and the representation of the UR testing strategies. It mentions that the authors draw comfort from the fact that the UR procedures are near in exploiting available information on the presence of unit roots. Furthermore, it adds that they cannot yield to downplay the influence of the initial condition on unit root test inference.

In this paper we focus on two major issues that surround testing for a unit root in practice, namely, (i) uncertainty as to whether or not a linear deterministic trend is present in the data and (ii) uncertainty as to whether the initial condition of the process is (asymptotically) negligible or not. In each case simple testing procedures are proposed with the aim of maintaining good power properties across such uncertainties. For the first issue, if the initial condition is negligible, quasi-differenced (QD) detrended (demeaned) Dickey--Fuller-type unit root tests are near asymptotically efficient when a deterministic trend is (is not) present in the data generating process. Consequently, we compare a variety of strategies that aim to select the detrended variant when a trend is present, and the demeaned variant otherwise. Based on asymptotic and finite-sample evidence, we recommend a simple union of rejections-based decision rule whereby the unit root null hypothesis is rejected whenever either of the detrended or demeaned unit root tests yields a rejection. Our results show that this approach generally outperforms more sophisticated strategies based on auxiliary methods of trend detection. For the second issue, we again recommend a union of rejections decision rule, rejecting the unit root null if either of the QD or ordinary least squares (OLS) detrended/demeaned Dickey-Fuller-type tests rejects. This procedure is also shown to perform well in practice, simultaneously exploiting the superior power of the QD (OLS) detrended/demeaned test for small (large) initial conditions. [ABSTRACT FROM AUTHOR]

In this paper we study the tail and the extremal behaviors of stationary solutions of threshold autoregressive (TAR) models. It is shown that a regularly varying noise sequence leads in general to only an O-regularly varying tail of the stationary solution. Under further conditions on the partition, it is shown however that TAR(S, 1) models of order 1 with S regimes have regularly varying tails, provided that the noise sequence is regularly varying. In these cases, the finite-dimensional distribution of the stationary solution is even multivariate regularly varying and its extremal behavior is studied via point process convergence. In particular, a TAR model with regularly varying noise can exhibit extremal clusters. This is in contrast to TAR models with noise in the maximum domain of attraction of the Gumbel distribution and which is either subexponential or in ℒ(γ) withy > 0. In this case it turns out that the tail of the stationary solution behaves like a constant times that of the noise sequence, regardless of the order and the specific partition of the TAR model, and that the process cannot exhibit clusters on high levels. [ABSTRACT FROM AUTHOR]

This paper proposes the least absolute shrinkage and selection operator?type (Lasso-type) generalized method of moments (GMM) estimator. This Lasso-type estimator is formed by the GMM objective function with the addition of a penalty term. The exponent of the penalty term in the regular Lasso estimator is equal to one. However, the exponent of the penalty term in the Lasso-type estimator is less than one in the analysis here. The magnitude of the exponent is reduced to avoid the asymptotic bias. This estimator selects the correct model and estimates it simultaneously. In other words, this method estimates the redundant parameters as zero in the large samples and provides the standard GMM limit distribution for the estimates of the nonzero parameters in the model. The asymptotic theory for our estimator is nonstandard. We conduct a simulation study that shows that the Lasso-type GMM correctly selects the true model much more often than the Bayesian information Criterion (BIC) and another model selection procedure based on the GMM objective function. [ABSTRACT FROM AUTHOR]

Let F(z)be a rational map with degree at least three. Suppose that there exists an annulus H ⊂^C such that (1) H separates two critical points of F, and (2) F : H → F(H) is a homeomorphism. Our goal in this paper is to show how to construct a rational map G by twisting F on H such that G has the same degree as F and, moreover, G has a Herman ring with any given Diophantine type rotation number. [ABSTRACT FROM AUTHOR]

In this paper a branching process approximation for the spread of a Reed-Frost epidemic on a network with tunable clustering is derived. The approximation gives rise to expressions for the epidemic threshold and the probability of a large outbreak in the epidemic. We investigate how these quantities vary with the clustering in the graph and find that, as the clustering increases, the epidemic threshold decreases. The network is modeled by a random intersection graph, in which individuals are independently members of a number of groups and two individuals are linked to each other if and only if there is at least one group that they are both members of. [ABSTRACT FROM AUTHOR]

Nanosystems are devices that are in the size range of a billionth of a meter (1×10-9) and therefore are built necessarily from individual atoms. The one-dimensional nanosystems or linear nanosystems cover all the nanosized systems which possess one dimension that exceeds the other two dimensions, i.e. extension over one dimension is predominant over the other two dimensions. Here only two of the dimensions have to be on the nanoscale (less than 100 nanometers). In this paper we consider the structural relationship between a linear nanosystem and its atoms acting as components of the nanosystem. Using such information, we then assess the nanosystem's limiting reliability which is, of course, probabilistic in nature. We consider the linear nanosystem at a fixed moment of time, say the present moment, and we assume that the present state of the linear nanosystem depends only on the present states of its atoms. [ABSTRACT FROM AUTHOR]

Stability is among the most important concepts in dynamical systems. Local stability is well-studied, whereas determining the 'global stability' of a nonlinear system is very challenging. Over the last few decades, many different ideas have been developed to address this issue, primarily driven by concrete applications. In particular, several disciplines suggested a web of concepts under the headline 'resilience'. Unfortunately, there are many different variants and explanations of resilience, and often, the definitions are left relatively vague, sometimes even deliberately. Yet, to allow for a structural development of a mathematical theory of resilience that can be used across different areas, one has to ensure precise starting definitions and provide a mathematical comparison of different resilience measures. In this work, we provide a systematic review of the most relevant indicators of resilience in the context of continuous dynamical systems, grouped according to their mathematical features. The indicators are also generalised to be applicable to any attractor. These steps are important to ensure a more reliable, quantitatively comparable and reproducible study of resilience in dynamical systems. Furthermore, we also develop a new concept of resilience against certain nonautonomous perturbations to demonstrate how one can naturally extend our framework. All the indicators are finally compared via the analysis of a classic scalar model from population dynamics to show that direct quantitative application-based comparisons are an immediate consequence of a detailed mathematical analysis. [ABSTRACT FROM AUTHOR]

In this paper, we prove the existence of nontrivial solutions to the following Schrödinger equation with critical Sobolev exponent: $$\begin{eqnarray}\left\{\begin{array}{@{}l@{}}-{\rm\Delta}u+V(x)u=K(x)|u|^{2^{\ast }-2}u+f(x,u),\quad x\in \mathbb{R}^{N},\\ u\in H^{1}(\mathbb{R}^{N})\end{array}\right.\end{eqnarray}$$ under assumptions that (i) $V(x_{0})<0$ for some $x_{0}\in \mathbb{R}^{N}$ and (ii) there exists $b>0$ such that the set ${\mathcal{V}}_{b}:=\{x\in \mathbb{R}^{N}:V(x)

The cover page of the journal "Journal of the Australian Mathematical Society" is presented.

In this paper, we combine group-theoretic and combinatorial techniques to study $\wedge$-transitive digraphs admitting a cartesian decomposition of their vertex set. In particular, our approach uncovers a new family of digraphs that may be of considerable interest. [ABSTRACT FROM PUBLISHER]

The goal of this paper is to obtain restrictions on the prime-to-$p$ quotient of the étale fundamental group of a smooth projective variety in characteristic $p\geqslant 0$. The results are analogues of some theorems from the study of Kähler groups. Our first main result is that such groups are indecomposable under coproduct. The second result gives a classification of the pro-$\ell$ parts of one-relator groups in this class. [ABSTRACT FROM PUBLISHER]