Socially organized sentiments: Exploring the link between religious density and protest mobilization, 1960–1995

Extensive research has shown individual religiosity to have an impact upon U.S. protest participation. But very little work has examined the role of religious density in a community on the likelihood of protest mobilization. Our research links the religious density across 62 counties in New York State to various protest mobilization issues during the period of 1960–1995. In this research, we develop a theory of socially organized sentiments to examine religious influences on overall protest event mobilizations in local communities, a specific example of a more general theory that can link community structure to multiple forms of civic engagement. The impact of various religious traditions is assessed by using measures for the density of religious population per congregation of three religious traditions—Mainline Protestantism, Evangelical Protestantism and Catholicism. The analysis also assesses the likelihood of mobilization concerning four specific issues—African-American civil rights, gender, anti-nuclear/peace, and anti-poverty movements.     

Conditional entropy,entropy density,and strong law of large numbers for generalized controlled tree-indexed Markov chains

In this paper, we first introduces a tree model without degree boundedness restriction namely generalized controlled tree T, which is an extension of some known tree models, such as homogeneous tree model, uniformly bounded degree tree model, controlled tree model, etc. Then some limit properties including strong law of large numbers for generalized controlled tree-indexed non homogeneous Markov chain are obtained. Finally, we establish some entropy density properties, monotonicity of conditional entropy, and entropy properties for generalized controlled tree-indexed Markov chains.     

On the Estimation of the Density of a Directional Data Stream

Many directional data such as wind directions can be collected extremely easily so that experiments typically yield a huge number of data points that are sequentially collected. To deal with such big data, the traditional nonparametric techniques rapidly require a lot of time to be computed and therefore become useless in practice if real time or online forecasts are expected. In this paper, we propose a recursive kernel density estimator for directional data which (i) can be updated extremely easily when a new set of observations is available and (ii) keeps asymptotically the nice features of the traditional kernel density estimator. Our methodology is based on Robbins–Monro stochastic approximations ideas. We show that our estimator outperforms the traditional techniques in terms of computational time while being extremely competitive in terms of efficiency with respect to its competitors in the sequential context considered here. We obtain expressions for its asymptotic bias and variance together with an almost sure convergence rate and an asymptotic normality result. Our technique is illustrated on a wind dataset collected in Spain. A Monte‐Carlo study confirms the nice properties of our recursive estimator with respect to its non‐recursive counterpart.     

A modified test for testing exponentiality using transformed data

In this article, we present a test for testing uniformity. Based on the test, we provide a test for testing exponentiality. Empirical critical values for both the tests are computed. Both the tests are compared with the tests proposed by Noughabi and Arghami [H. Alizadeh Noughabi, and N.R. Arghami, Testing exponentiality using transformed data, J. Statist. Comput. Simul. 81 (4) (2011), pp. 511–516] using simulation experiments for a wide class of alternatives. The tests possess attractive power properties.     

Asymptotic behaviour of binned kernel density estimators for locally non-stationary random fields

We investigate the asymptotic behaviour of binned kernel density estimators for dependent and locally non-stationary random fields converging to stationary random fields. We focus on the study of the bias and the asymptotic normality of the estimators. A simulation experiment conducted shows that both the kernel density estimator and the binned kernel density estimator have the same behavior and both estimate accurately the true density when the number of fields increases. We apply our results to the 2002 incidence rates of tuberculosis in the departments of France.     

Testing independence based on Bernstein empirical copula and copula density

In this paper we provide three nonparametric tests of independence between continuous random variables based on the Bernstein copula distribution function and the Bernstein copula density function. The first test is constructed based on a Cramér-von Mises divergence-type functional based on the empirical Bernstein copula process. The two other tests are based on the Bernstein copula density and use Cramér-von Mises and Kullback–Leibler divergence-type functionals, respectively. Furthermore, we study the asymptotic null distribution of each of these test statistics. Finally, we consider a Monte Carlo experiment to investigate the performance of our tests. In particular we examine their size and power which we compare with those of the classical nonparametric tests that are based on the empirical distribution function.     

A new algorithm for clustering based on kernel density estimation

In this paper, we present an algorithm for clustering based on univariate kernel density estimation, named ClusterKDE. It consists of an iterative procedure that in each step a new cluster is obtained by minimizing a smooth kernel function. Although in our applications we have used the univariate Gaussian kernel, any smooth kernel function can be used. The proposed algorithm has the advantage of not requiring a priori the number of cluster. Furthermore, the ClusterKDE algorithm is very simple, easy to implement, well-defined and stops in a finite number of steps, namely, it always converges independently of the initial point. We also illustrate our findings by numerical experiments which are obtained when our algorithm is implemented in the software Matlab and applied to practical applications. The results indicate that the ClusterKDE algorithm is competitive and fast when compared with the well-known Clusterdata and K-means algorithms, used by Matlab to clustering data.     

A robust automatic clustering algorithm for probability density functions with application to categorizing color images

This study develops a robust automatic algorithm for clustering probability density functions based on the previous research. Unlike other existing methods that often pre-determine the number of clusters, this method can self-organize data groups based on the original data structure. The proposed clustering method is also robust in regards to noise. Three examples of synthetic data and a real-world COREL dataset are utilized to illustrate the accurateness and effectiveness of the proposed approach.     

Subsampling-extrapolation bandwidth selection in bivariate kernel density estimation

This paper focuses on bivariate kernel density estimation that bridges the gap between univariate and multivariate applications. We propose a subsampling-extrapolation bandwidth matrix selector that improves the reliability of the conventional cross-validation method. The proposed procedure combines a U-statistic expression of the mean integrated squared error and asymptotic theory, and can be used in both cases of diagonal bandwidth matrix and unconstrained bandwidth matrix. In the subsampling stage, one takes advantage of the reduced variability of estimating the bandwidth matrix at a smaller subsample size m (m < n); in the extrapolation stage, a simple linear extrapolation is used to remove the incurred bias. Simulation studies reveal that the proposed method reduces the variability of the cross-validation method by about 50% and achieves an expected integrated squared error that is up to 30% smaller than that of the benchmark cross-validation. It shows comparable or improved performance compared to other competitors across six distributions in terms of the expected integrated squared error. We prove that the components of the selected bivariate bandwidth matrix have an asymptotic multivariate normal distribution, and also present the relative rate of convergence of the proposed bandwidth selector.