Critical percolation of free product of groups

In this article we study percolation on the Cayley graph of a free product of groups. The critical probability $p_c$ of a free product $G_1*G_2*...*G_n$ of groups is found as a solution of an equation involving only the expected subcritical cluster size of factor groups $G_1,G_2,...,G_n$. For finite groups these equations are polynomial and can be explicitly written down. The expected subcritical cluster size of the free product is also found in terms of the subcritical cluster sizes of the factors. In particular, we prove that $p_c$ for the Cayley graph of the modular group $\hbox{PSL}_2(\mathbb Z)$ (with the standard generators) is $.5199...$, the unique root of the polynomial $2p^5-6p^4+2p^3+4p^2-1$ in the interval $(0,1)$. In the case when groups $G_i$ can be "well approximated" by a sequence of quotient groups, we show that the critical probabilities of the free product of these approximations converge to the critical probability of $G_1*G_2*...*G_n$ and the speed of convergence is exponential. Thus for residually finite groups, for example, one can restrict oneself to the case when each free factor is finite. We show that the critical point, introduced by Schonmann, $p_{\mathrm{exp}}$ of the free product is just the minimum of $p_{\mathrm{exp}}$ for the factors

Point-wise mutual information-based video segmentation with high temporal consistency

In this paper, we tackle the problem of temporally consistent boundary detection and hierarchical segmentation in videos. While finding the best high-level reasoning of region assignments in videos is the focus of much recent research, temporal consistency in boundary detection has so far only rarely been tackled. We argue that temporally consistent boundaries are a key component to temporally consistent region assignment. The proposed method is based on the point-wise mutual information (PMI) of spatio-temporal voxels. Temporal consistency is established by an evaluation of PMI-based point affinities in the spectral domain over space and time. Thus, the proposed method is independent of any optical flow computation or previously learned motion models. The proposed low-level video segmentation method outperforms the learning-based state of the art in terms of standard region metrics

A nanoflare model for active region radiance: application of artificial neural networks

Context. Nanoflares are small impulsive bursts of energy that blend with and possibly make up much of the solar background emission. Determining their frequency and energy input is central to understanding the heating of the solar corona. One method is to extrapolate the energy frequency distribution of larger individually observed flares to lower energies. Only if the power law exponent is greater than 2, is it considered possible that nanoflares contribute significantly to the energy input. Aims. Time sequences of ultraviolet line radiances observed in the corona of an active region are modelled with the aim of determining the power law exponent of the nanoflare energy distribution. Methods. A simple nanoflare model based on three key parameters (the flare rate, the flare duration time, and the power law exponent of the flare energy frequency distribution) is used to simulate emission line radiances from the ions Fe XIX, Ca XIII, and Si iii, observed by SUMER in the corona of an active region as it rotates around the east limb of the Sun. Light curve pattern recognition by an Artificial Neural Network (ANN) scheme is used to determine the values. Results. The power law exponents, alpha 2.8, 2.8, and 2.6 for Fe XIX, Ca XIII, and Si iii respectively. Conclusions. The light curve simulations imply a power law exponent greater than the critical value of 2 for all ion species. This implies that if the energy of flare-like events is extrapolated to low energies, nanoflares could provide a significant contribution to the heating of active region coronae.Comment: 4 pages, 5 figure

Weak convergence of Vervaat and Vervaat Error processes of long-range dependent sequences

Following Cs\"{o}rg\H{o}, Szyszkowicz and Wang (Ann. Statist. {\bf 34}, (2006), 1013--1044) we consider a long range dependent linear sequence. We prove weak convergence of the uniform Vervaat and the uniform Vervaat error processes, extending their results to distributions with unbounded support and removing normality assumption

Efficient Entropy Estimation for Mutual Information Analysis Using B-Splines

International audienceThe Correlation Power Analysis (CPA) is probably the most used side-channel attack because it seems to fit the power model of most standard CMOS devices and is very efficiently computed. However, the Pearson correlation coefficient used in the CPA measures only linear statistical dependences where the Mutual Information (MI) takes into account both linear and nonlinear dependences. Even if there can be simultaneously large correlation coefficients quantified by the correlation coefficient and weak dependences quantified by the MI, we can expect to get a more profound understanding about interactions from an MI Analysis (MIA). We study methods that improve the non-parametric Probability Density Functions (PDF) in the estimation of the entropies and, in particular, the use of B-spline basis functions as pdf estimators. Our results indicate an improvement of two fold in the number of required samples compared to a classic MI estimation. The B-spline smoothing technique can also be applied to the rencently introduced Cramér-von-Mises test

On line power spectra identification and whitening for the noise in interferometric gravitational wave detectors

In this paper we address both to the problem of identifying the noise Power Spectral Density of interferometric detectors by parametric techniques and to the problem of the whitening procedure of the sequence of data. We will concentrate the study on a Power Spectral Density like the one of the Italian-French detector VIRGO and we show that with a reasonable finite number of parameters we succeed in modeling a spectrum like the theoretical one of VIRGO, reproducing all its features. We propose also the use of adaptive techniques to identify and to whiten on line the data of interferometric detectors. We analyze the behavior of the adaptive techniques in the field of stochastic gradient and in the Least Squares ones.Comment: 28 pages, 21 figures, uses iopart.cls accepted for pubblication on Classical and Quantum Gravit

Linear Estimation of Location and Scale Parameters Using Partial Maxima

Consider an i.i.d. sample X^*_1,X^*_2,...,X^*_n from a location-scale family, and assume that the only available observations consist of the partial maxima (or minima)sequence, X^*_{1:1},X^*_{2:2},...,X^*_{n:n}, where X^*_{j:j}=max{X^*_1,...,X^*_j}. This kind of truncation appears in several circumstances, including best performances in athletics events. In the case of partial maxima, the form of the BLUEs (best linear unbiased estimators) is quite similar to the form of the well-known Lloyd's (1952, Least-squares estimation of location and scale parameters using order statistics, Biometrika, vol. 39, pp. 88-95) BLUEs, based on (the sufficient sample of) order statistics, but, in contrast to the classical case, their consistency is no longer obvious. The present paper is mainly concerned with the scale parameter, showing that the variance of the partial maxima BLUE is at most of order O(1/log n), for a wide class of distributions.Comment: This article is devoted to the memory of my six-years-old, little daughter, Dionyssia, who leaved us on August 25, 2010, at Cephalonia isl. (26 pages, to appear in Metrika

Symplectic tracking using point magnets and a reference orbit made of circular arcs and straight lines

Symplectic tracking of beam particles using point magnets is achieved using a reference orbit made of circular arcs and straight lines that join smoothly with each other. For this choice of the reference orbit, results are given for the transfer functions, transfer matrices, and the transit times of the magnets and drift spaces. These results provide a symplectic integrator, and allow the linear orbit parameters to be computed by multiplying transfer matrices. It is shown that this integrator is a second-order integrator, and that the transfer functions can be derived from a hamiltonian.Comment: 16 pages, PDF fil

Asymptotic normality of the Parzen-Rosenblatt density estimator for strongly mixing random fields

We prove the asymptotic normality of the kernel density estimator (introduced by Rosenblatt (1956) and Parzen (1962)) in the context of stationary strongly mixing random fields. Our approach is based on the Lindeberg's method rather than on Bernstein's small-block-large-block technique and coupling arguments widely used in previous works on nonparametric estimation for spatial processes. Our method allows us to consider only minimal conditions on the bandwidth parameter and provides a simple criterion on the (non-uniform) strong mixing coefficients which do not depend on the bandwith.Comment: 16 page