Pretentiously detecting power cancellation

Granville and Soundararajan have recently introduced the notion of pretentiousness in the study of multiplicative functions of modulus bounded by 1, essentially the idea that two functions which are similar in a precise sense should exhibit similar behavior. It turns out, somewhat surprisingly, that this does not directly extend to detecting power cancellation - there are multiplicative functions which exhibit as much cancellation as possible in their partial sums that, modified slightly, give rise to functions which exhibit almost as little as possible. We develop two new notions of pretentiousness under which power cancellation can be detected, one of which applies to a much broader class of multiplicative functions

One Simple Test of Samuelson's Dictum for the Stock Market

Samuelson [1998] offered the dictum that the stock market is "micro efficient" but "macro inefficient." That is, the efficient markets hypothesis works much better for individual stocks than it does for the aggregate stock market. In this paper, we present one simple test, based both on regressions and on a simple scatter diagram that vividly illustrates that there is some truth to Samuelson's dictum. The data comprise all U.S. firms on the CRSP tape that have survived since 1926.Market efficiency, Random walk, Dividend yield, Dividend price ratio, Present value, Excess volatility, Gordon model

One Simple Test of Samuelson's Dictum for the Stock Market

Samuelson (1998) offered the dictum that the stock market is 'micro efficient' but 'macro inefficient.' That is, the efficient markets hypothesis works much better for individual stocks than it does for the aggregate stock market. In this paper, we present one simple test, based both on regressions and on a simple scatter diagram that vividly illustrates that there is some truth to Samuelson's dictum. The data comprise all U.S. firms on the CRSP tape that have survived since 1926.

Time Series of Count Data : Modelling and Estimation

This paper compares various models for time series of counts which can account for discreetness, overdispersion and serial correlation. Besides observation- and parameter-driven models based upon corresponding conditional Poisson distributions, we also consider a dynamic ordered probit model as a flexible specification to capture the salient features of time series of counts. For all models, we present appropriate efficient estimation procedures. For parameter-driven specifications this requires Monte Carlo procedures like simulated Maximum likelihood or Markov Chain Monte-Carlo. The methods including corresponding diagnostic tests are illustrated with data on daily admissions for asthma to a single hospital. --Efficient Importance Sampling,GLARMA,Markov Chain Monte-Carlo,Observation-driven model,Parameter-driven model,Ordered Probit

Data expansion with Huffman codes

The following topics were dealt with: Shannon theory; universal lossless source coding; CDMA; turbo codes; broadband networks and protocols; signal processing and coding; coded modulation; information theory and applications; universal lossy source coding; algebraic geometry codes; modelling analysis and stability in networks; trellis structures and trellis decoding; channel capacity; recording channels; fading channels; convolutional codes; neural networks and learning; estimation; Gaussian channels; rate distortion theory; constrained channels; 2D channel coding; nonparametric estimation and classification; data compression; synchronisation and interference in communication systems; cyclic codes; signal detection; group codes; multiuser systems; entropy and noiseless source coding; dispersive channels and equalisation; block codes; cryptography; image processing; quantisation; random processes; wavelets; sequences for synchronisation; iterative decoding; optical communications