Multi-self-similar Markov processes on ℝ<Subscript>+</Subscript><Superscript><Emphasis Type="Italic">n</Emphasis></Superscript> and their Lamperti representations

 A classical result, due to Lamperti, establishes a one-to-one correspondence between a class of strictly positive Markov processes that are self-similar, and the class of one-dimensional Lévy processes. This correspondence is obtained by suitably time-changing the exponential of the Lévy process. In this paper we generalise Lamperti's result to processes in n dimensions. For the representation we obtain, it is essential that the same time-change be applied to all coordinates of the processes involved. Also for the statement of the main result we need the proper concept of self-similarity in higher dimensions, referred to as multi-self-similarity in the paper. The special case where the Lévy process ξ is standard Brownian motion in n dimensions is studied in detail. There are also specific comments on the case where ξ is an n-dimensional compound Poisson process with drift. Finally, we present some results concerning moment sequences, obtained by studying the multi-self-similar processes that correspond to n-dimensional subordinators. Received: 22 August 2002 / Revised version: 10 February 2003 Published online: 15 April 2003 RID="*" ID="*" MaPhySto – Centre for Mathematical Physics and Stochastics, funded by a grant from the Danish National Research Foundation Mathematics Subject Classification (2000): 60G18, 60G51, 60J25, 60J60, 60J75 Key words or phrases: Lévy process – Self-similarity – Time-change – Exponential functional – Brownian motion – Bessel process – Piecewise deterministic Markov process – Moment sequence     

Twisted equivariant K-theory for proper actions of discrete groups

We will make a construction of twisted equivariant K-theory for proper actions of discrete groups by using ideas of Lück and Oliver (Topology 40:585–616, 2001) to expand a construction of Adem and Ruan (Comm. Math. Phys. 237:533–556, 2003).     

Empirical characteristic function approach to goodness-of-fit tests for the Cauchy distribution with parameters estimated by MLE or EISE

We consider goodness-of-fit tests of the Cauchy distribution based on weighted integrals of the squared distance between the empirical characteristic function of the standardized data and the characteristic function of the standard Cauchy distribution. For standardization of data Gürtler and Henze (2000,Annals of the Institute of Statistical Mathematics,52, 267–286) used the median and the interquartile range. In this paper we use the maximum likelihood estimator (MLE) and an equivariant integrated squared error estimator (EISE), which minimizes the weighted integral. We derive an explicit form of the asymptotic covariance function of the characteristic function process with parameters estimated by the MLE or the EISE. The eigenvalues of the covariance function are numerically evaluated and the asymptotic distributions of the test statistics are obtained by the residue theorem. A simulation study shows that the proposed tests compare well to tests proposed by Gürtler and Henze and more traditional tests based on the empirical distribution function.     

On the non-emptiness of the fuzzy core

The seminal contribution of Debreu and Scarf (Int Econ Rev 4:235–246, 1963) connects the two concepts of core and competitive equilibrium in exchange economies. In effect, their core-equilibrium equivalence result states that, when the set of economic agents is replicated, the set of core allocations of the replica economy shrinks to the set of competitive allocations. Florenzano (J Math Anal Appl 153:18–36, 1990) defines the fuzzy core as the set of allocations which cannot be blocked by any coalition with an arbitrary rate of participation and then shows the asymptotic limit of cores of replica economies coincides with the fuzzy core. In this note, we provide an elementary proof of the non-emptiness of the fuzzy core for an exchange economy. Hence, in motivation, our result is similar to the contribution of Vohra (On Scarf’s theorem on the non-emptiness of the core: a direct proof through Kakutani’s fixed point theorem. Brown University Working Paper, 1987) and Shapley and Vohra (Econ Theory 1:108–116, 1991) for the core. Unlike the classical Debreu–Scarf limit theorem (Debreu and Scarf in Int Econ Rev 4:235–246, 1963) and its numerous extensions our result does not require any asymptotic intersection—or limit—of the set of core allocations of replica economies. The author would like to thank the Netherlands Organisation for Scientific Research (NWO) for financial support.     

Asymptotic expansions for the conditional sojourn time distribution in the <Emphasis Type="Italic">M</Emphasis>/<Emphasis Type="Italic">M</Emphasis>/1-PS queue

We consider the M/M/1 queue with processor sharing. We study the conditional sojourn time distribution, conditioned on the customer’s service requirement, in various asymptotic limits. These include large time and/or large service request, and heavy traffic, where the arrival rate is only slightly less than the service rate. The asymptotic formulas relate to, and extend, some results of Morrison (SIAM J. Appl. Math. 45:152–167, [1985]) and Flatto (Ann. Appl. Probab. 7:382–409, [1997]). This work was partly supported by NSF grant DMS 05-03745.     

Efficiency and equilibria in games of optimal derivative design

In this paper, optimal derivative design when multiple firms compete for heterogenous customers is studied. Ties in the agents’ best responses generate discontinuous payoffs. Efficient tie-breaking rules are considered: In a first step, the model presented by Carlier et al. (Math Financ Econ 1:57–80, 2007) is extended, and results of Page and Monteiro (J Math Econ 39:63–109, 2003, J Econ Theory 134:566–575, 2007, Econ Theory 34:503–524, 2008) are used to prove the existence of (mixed-strategies) Nash equilibria. In a second step, the case of risk minimizing firms is studied. Socially efficient allocations are introduced, and their existence is proved. In particular, the entropic risk measure is considered.     

Decreasing serial cost sharing: an axiomatic characterization

The increasing serial cost sharing rule of Moulin and Shenker (Econometrica 60:1009–1037, 1992) and the decreasing serial rule of de Frutos (J Econ Theory 79:245–275, 1998) are known by their intuitive appeal and striking incentive properties. An axiomatic characterization of the increasing serial rule was provided by Moulin and Shenker (J Econ Theory 64:178–201, 1994). This paper gives an axiomatic characterization of the decreasing serial rule.     

The analytic torsion of a disc

In this article, we study the Reidemeister torsion and the analytic torsion of the m dimensional disc, with the Ray and Singer homology basis (Adv Math 7:145–210, 1971). We prove that the Reidemeister torsion coincides with a power of the volume of the disc. We study the additional terms arising in the analytic torsion due to the boundary, using generalizations of the Cheeger–Müller theorem. We use a formula proved by Brüning and Ma (GAFA 16:767–873, 2006) that predicts a new anomaly boundary term beside the known term proportional to the Euler characteristic of the boundary (Lück, J Diff Geom 37:263–322, 1993). Some of our results extend to the case of the cone over a sphere, in particular we evaluate directly the analytic torsion for a cone over the circle and over the two sphere. We compare the results obtained in the low dimensional cases. We also consider a different formula for the boundary term given by Dai and Fang (Asian J Math 4:695–714, 2000), and we compare the results. The results of these work were announced in the study of Hartmann et al. (BUMI 2:529–533, 2009).     

The pseudo-average rule: bankruptcy,cost allocation and bargaining

A division rule for claims problems, also known as bankruptcy or rationing problems, based on the pseudo-average solution is studied (for 2-person problems). This solution was introduced in Moulin (Jpn Econ Rev 46:303–332, 1995) for discrete cost allocation problems. Using the asymptotic approach, we obtain a division rule for claims problems. We characterize the division rule axiomatically and show that it coincides with the rule associated to the equal area bargaining solution (this is not true for n = 3). Moreover, following Moulin and Shenker (J Econ Theor 64:178–201, 1994), we show that its associated solution for continuous homogeneous goods is precisely the continuous pseudo-average solution.     

Convex underestimation for posynomial functions of positive variables

The approximation of the convex envelope of nonconvex functions is an essential part in deterministic global optimization techniques (Floudas in Deterministic Global Optimization: Theory, Methods and Application, 2000). Current convex underestimation algorithms for multilinear terms, based on arithmetic intervals or recursive arithmetic intervals (Hamed in Calculation of bounds on variables and underestimating convex functions for nonconvex functions, 1991; Maranas and Floudas in J Global Optim 7:143–182, (1995); Ryoo and Sahinidis in J Global Optim 19:403–424, (2001)), introduce a large number of linear cuts. Meyer and Floudas (Trilinear monomials with positive or negative domains: Facets of convex and concave envelopes, pp. 327–352, (2003); J Global Optim 29:125–155, (2004)), introduced the complete set of explicit facets for the convex and concave envelopes of trilinear monomials with general bounds. This study proposes a novel method to underestimate posynomial functions of strictly positive variables.     

Crisp and fuzzy <Emphasis Type="Italic">k</Emphasis>-means clustering algorithms for multivariate functional data

Functional data analysis, as proposed by Ramsay (Psychometrika 47:379–396, 1982), has recently attracted many researchers. The most popular approach taken in recent studies of functional data has been the extension of statistical methods for the analysis of usual data to that of functional data (e.g., Ramsay and Silverman in Functional data Analysis Springer, Berlin Heidelberg New York, 1997, Applied functional data analysis: methods and case studies. Springer, Berlin Heidelberg New York, 2002; Mizuta in Proceedings of the tenth Japan and Korea Joint Conference of Statistics, pp 77–82, 2000; Shimokawa et al. in Japan J Appl Stat 29:27–39, 2000). In addition, several methods for clustering functional data have been proposed (Abraham et al. in Scand J Stat 30:581–595, 2003; Gareth and Catherine in J Am Stat Assoc 98:397–408, 2003; Tarpey and kinateder in J Classif 20:93–114, 2003; Rossi et al. in Proceedings of European Symposium on Artificial Neural Networks pp 305–312, 2004). Furthermore, Tokushige et al. (J Jpn Soc Comput Stat 15:319–326, 2002) defined several dissimilarities between functions for the case of functional data. In this paper, we extend existing crisp and fuzzy k-means clustering algorithms to the analysis of multivariate functional data. In particular, we consider the dissimilarity between functions as a function. Furthermore, cluster centers and memberships, which are defined as functions, are determined at the minimum of a certain target function by using a calculus-of-variations approach.     

A general divergence criterion for prior selection

The paper revisits the problem of selection of priors for regular one-parameter family of distributions. The goal is to find some “objective” or “default” prior by approximate maximization of the distance between the prior and the posterior under a general divergence criterion as introduced by Amari (Ann Stat 10:357–387, 1982) and Cressie and Read (J R Stat Soc Ser B 46:440–464, 1984). The maximization is based on an asymptotic expansion of this distance. The Kullback–Leibler, Bhattacharyya–Hellinger and Chi-square divergence are special cases of this general divergence criterion. It is shown that with the exception of one particular case, namely the Chi-square divergence, the general divergence criterion yields Jeffreys’ prior. For the Chi-square divergence, we obtain a prior different from that of Jeffreys and also from that of Clarke and Sun (Sankhya Ser A 59:215–231, 1997).     

Asymptotic Mean-Square Stability of Two-Step Methods for Stochastic Ordinary Differential Equations

We deal with linear multi-step methods for SDEs and study when the numerical approximation shares asymptotic properties in the mean-square sense of the exact solution. As in deterministic numerical analysis we use a linear time-invariant test equation and perform a linear stability analysis. Standard approaches used either to analyse deterministic multi-step methods or stochastic one-step methods do not carry over to stochastic multi-step schemes. In order to obtain sufficient conditions for asymptotic mean-square stability of stochastic linear two-step-Maruyama methods we construct and apply Lyapunov-type functionals. In particular we study the asymptotic mean-square stability of stochastic counterparts of two-step Adams–Bashforth- and Adams–Moulton-methods, the Milne–Simpson method and the BDF method. AMS subject classification (2000) 60H35, 65C30, 65L06, 65L20     

Averaging Special Values of Dirichlet <Emphasis Type="Italic">L</Emphasis>-Series

In this paper we derive estimates for weighted averages of the special values of Dirichlet L-series which generalize similar estimates of David and Pappalardi [1]. The author is partially supported by NSF grant DMS-0090117. 2000 Mathematics Subject Classification: Primary–11M06; Secondary–11G05     

Contribution to the bandwidth choice for kernel density estimates

In the present paper we focus on the problem of the bandwidth choice for the kernel density estimates. The problem of finding the optimal bandwidth belongs to the crucial problems of the kernel estimates. As a criterion of quality of the estimates the L ₂ type measure is used. A special iterative method based on a relevant estimation of mean integrated square error given in papers Müller and Wang (Prob Theor Relat Fields 85:523–538, 1990), Jones et al. (Ann Stat 19:1919–1932, 1991) is suggested. Moreover the idea of maximal smoothing principle (Terrell in J Am Stat Assoc 85:470–477, 1990) is extended to the higher order kernels. A simulation study brings a comparison of the proposed method and the cross-validation method. Research supported by the GACR:402/04/1308.     

Regular Score Tests of Independence in Multivariate Extreme Values

The score tests of independence in multivariate extreme values derived by Tawn (Tawn, J.A., “Bivariate extreme value theory: models and estimation,” Biometrika 75, 397–415, 1988) and Ledford and Tawn (Ledford, A.W. and Tawn, J.A., “Statistics for near independence in multivariate extreme values,” Biometrika 83, 169–187, 1996) have non-regular properties that arise due to violations of the usual regularity conditions of maximum likelihood. Two distinct types of regularity violation are encountered in each of their likelihood frameworks: independence within the underlying model corresponding to a boundary point of the parameter space and the score function having an infinite second moment. For applications, the second form of regularity violation has the more important consequences, as it results in score statistics with non-standard normalisation and poor rates of convergence. The corresponding tests are difficult to use in practical situations because their asymptotic properties are unrepresentative of their behaviour for the sample sizes typical of applications, and extensive simulations may be needed in order to evaluate adequately their null distribution. Overcoming this difficulty is the primary focus of this paper. We propose a modification to the likelihood based approaches used by Tawn (Tawn, J.A., “Bivariate extreme value theory: models and estimation,” Biometrika 75, 397–415, 1988) and Ledford and Tawn (Ledford, A.W. and Tawn, J.A., “Statistics for near independence in multivariate extreme values,” Biometrika 83, 169–187, 1996) that provides asymptotically normal score tests of independence with regular normalisation and rapid convergence. The resulting tests are straightforward to implement and are beneficial in practical situations with realistic amounts of data. AMS 2000 Subject Classification Primary—60G70 Secondary—62H15     

Prüfer property in amalgamated algebras along an ideal

Let $$f : A \rightarrow B$$ be a ring homomorphism and J be an ideal of B. In this paper, we give a characterization of zero divisors of the amalgamation which is a generalization of Maimani’s and Yassemi’s work (see Maimani and Yassemi in J Pure Appl Algebra 212(1):168–174, 2008). Furthermore, we investigate the transfer of Prüfer domain concept to commutative rings with zero divisors in the amalgamation of A with B along J with respect to f (denoted by $$A\bowtie ^fJ),$$ introduced and studied by D’Anna et al. (Commutative algebra and its applications, Walter de Gruyter, Berlin, 2009, J Pure Appl Algebra 214:1633–1641, 2010). Our results recover well known results on duplications. The main applications constist in the construction of new original classes of Prüfer rings that are not Gaussian and Prüfer rings with weak global dimension strictly greater than 1.     

Deterministic Noises that can be Statistically Distinguished from the Random Ones

Empirical measures generated by random sequences with deterministic and random noises have same asymptotic distributions provided that the noises have same asymptotic distributions (cf., Davydov and Zitikis, 2004, Proc. Am. Math. Soc. 132, 1203–1210). This phenomenon has raised an intriguing question about the possibility of distinguishing the two types of noises based only on their asymptotic distributions. In the present paper we suggest an answer to the question by considering asymptotic variances, and distributions, of the appropriately centered and normalized empirical measures and processes. In final form 6 January 2005     

Asymptotic Approximations between the Hahn-Type Polynomials and Hermite, Laguerre and Charlier Polynomials

It has been shown in Ferreira et al. (Adv. Appl. Math 31:61–85, [2003]), López and Temme (Methods Appl. Anal. 6:131–196, [1999]; J. Cpmput. Appl. Math. 133:623–633, [2001]) that the three lower levels of the Askey table of hypergeometric orthogonal polynomials are connected by means of asymptotic expansions. In this paper we continue with that investigation and establish asymptotic connections between the fourth level and the two lower levels: we derive twelve asymptotic expansions of the Hahn, dual Hahn, continuous Hahn and continuous dual Hahn polynomials in terms of Hermite, Charlier and Laguerre polynomials. From these expansions, several limits between polynomials are derived. Some numerical experiments give an idea about the accuracy of the approximations and, in particular, about the accuracy in the approximation of the zeros of the Hahn, dual Hahn, continuous Hahn and continuous dual Hahn polynomials in terms of the zeros of the Hermite, Charlier and Laguerre polynomials.      

Further PDE methods for weak KAM theory

We introduce and make estimates for several new approximations that in appropriate asymptotic limits yield the key PDE for weak KAM theory, namely a Hamilton–Jacobi type equation for a potential u and a coupled transport equation for a measure σ. We revisit as well a singular variational approximation introduced in Evans (Calc Vari Partial Differ Equ 17:159–177, 2003) and demonstrate “approximate integrability” of certain phase space dynamics related to the Hamiltonian flow. Other examples include a pair of strongly coupled PDE suggested by the Lions–Lasry theory (Lasry and Lions in Japan J Math 2:229–260, 2007) of mean field games and a new and extremely singular elliptic equation suggested by sup-norm variational theory. Supported in part by NSF Grant DMS-0500452.