Subintervals Of Length Research Articles

Asymptotic genealogies for a class of generalized Wright–Fisher models

A class of Cannings models is studied, with population size N having a mixed multinomial offspring distribution with random success probabilities ${W_{1}},\dots ,{W_{N}}$ induced by independent and identically distributed positive random variables ${X_{1}},{X_{2}},\dots $ via ${W_{i}}:={X_{i}}/{S_{N}}$, $i\in \{1,\dots ,N\}$, where ${S_{N}}:={X_{1}}+\cdots +{X_{N}}$. The ancestral lineages are hence based on a sampling with replacement strategy from a random partition of the unit interval into N subintervals of lengths ${W_{1}},\dots ,{W_{N}}$. Convergence results for the genealogy of these Cannings models are provided under assumptions that the tail distribution of ${X_{1}}$ is regularly varying. In the limit several coalescent processes with multiple and simultaneous multiple collisions occur. The results extend those obtained by Huillet [J. Math. Biol. 68 (2014), 727–761] for the case when ${X_{1}}$ is Pareto distributed and complement those obtained by Schweinsberg [Stoch. Process. Appl. 106 (2003), 107–139] for models where sampling is performed without replacement from a supercritical branching process.

Minimizing closed geodesics on polygons and disks

In this paper we study 1/k geodesics, those closed geodesics that minimize on all subintervals of length $L/k$, where $L$ is the length of the geodesic. We develop new techniques to study the minimizing properties of these curves on doubled polygons, and demonstrate a sequence of doubled polygons whose closed geodesics exhibit unbounded minimizing properties. We also compute the length of the shortest closed geodesic on doubled odd-gons and show that this length approaches 4 times the diameter.

Closed geodesics on doubled polygons

We study 1∕k-geodesics, those closed geodesics that minimize on any subinterval of length L∕k, where L is the length of the geodesic. We investigate the existence and behavior of these curves on doubled polygons and show that every doubled regular n-gon admits a 1∕(2n)-geodesic. For the doubled regular p-gons, with p an odd prime, we conjecture that k=2p is the minimum value for k such that the space admits a 1∕k-geodesic.

Mathematical Analysis of the Jin-Neelin Model of El Niño-Southern-Oscillation

The Jin-Neelin model for the El Nino–Southern Oscillation (ENSO for short) is considered for which the authors establish existence and uniqueness of global solutions in time over an unbounded channel domain. The result is proved for initial data and forcing that are sufficiently small. The smallness conditions involve in particular key physical parameters of the model such as those that control the travel time of the equatorial waves and the strength of feedback due to vertical-shear currents and upwelling; central mechanisms in ENSO dynamics. From the mathematical view point, the system appears as the coupling of a linear shallow water system and a nonlinear heat equation. Because of the very different nature of the two components of the system, the authors find it convenient to prove the existence of solution by semi-discretization in time and utilization of a fractional step scheme. The main idea consists of handling the coupling between the oceanic and temperature components by dividing the time interval into small sub-intervals of length k and on each sub-interval to solve successively the oceanic component, using the temperature T calculated on the previous sub-interval, to then solve the sea-surface temperature (SST for short) equation on the current sub-interval. The passage to the limit as k tends to zero is ensured via a priori estimates derived under the aforementioned smallness conditions.

Recovering covariance from functional fragments

We consider nonparametric estimation of a covariance function on the unit square, given a sample of discretely observed fragments of functional data. When each sample path is observed only on a subinterval of length |$\delta<1$|⁠, one has no statistical information on the unknown covariance outside a |$\delta$|-band around the diagonal. The problem seems unidentifiable without parametric assumptions, but we show that nonparametric estimation is feasible under suitable smoothness and rank conditions on the unknown covariance. This remains true even when the observations are discrete, and we give precise deterministic conditions on how fine the observation grid needs to be relative to the rank and fragment length for identifiability to hold true. We show that our conditions translate the estimation problem to a low-rank matrix completion problem, construct a nonparametric estimator in this vein, and study its asymptotic properties. We illustrate the numerical performance of our method on real and simulated data.

Ordered Orthogonal Array Construction Using LFSR Sequences

We present a new construction of ordered orthogonal arrays (OOA) of strength $t$ with $(q + 1)t$ columns over a finite field $\mathbb{F}_{q}$ using linear feedback shift register sequences (LFSRs). OOAs are naturally related to $(t, m, s)$-nets, linear codes, and MDS codes. Our construction selects suitable columns from the array formed by all subintervals of length $\frac{q^{t}-1}{q-1}$ of an LFSR sequence generated by a primitive polynomial of degree $t$ over $\mathbb{F}_{q}$. We prove properties about the relative positions of runs in an LFSR which guarantee that the constructed OOA has strength $t$. The set of parameters of our OOAs are the same as the ones given by Rosenbloom and Tsfasman (1997) and Skriganov (2002), but the constructed arrays are different. We experimentally verify that our OOAs are stronger than the Rosenbloom-Tsfasman-Skriganov OOAs in the sense that ours are "closer" to being a "full" orthogonal array. We also discuss how our OOA construction relates to previous techniques to build OOAs from a set of linearly independent vectors over $\mathbb{F}_{q}$, as well as to hypergraph homomorphisms.

To the History of the Appearance of the Notion of the ε-Entropy of an Authomorphism of a Lebesgue Space and (ε,T)-Entropy of a Dynamical System with Continuous Time

The paper is devoted to the master thesis on “information theory” which was written by the author in 1956–57. The topic was suggested by his advisor A. A. Bobrov (a student of A. Ya. Khinchin and A. N. Kolmogorov), and the thesis was written under the influence of lectures by N. I. Gavrilov (a student of I. G. Petrovskii) on the qualitative theory of differential equations, which included the statement of Birkhoff’s theorem for ergodic dynamical systems. In the thesis, the author used the concept of Shannon entropy in the study of ergodic dynamical systems f(p, t) in a separable compact metric space R with an invariant measure μ (where μ(R) = 1) and introduced the notion of the (ϵ, T)-entropy of a system as a quantitative characteristic of the degree of mixing. In the work, not only partitions of R were considered, but also partitions of the interval (−∞,∞) into subintervals of length T > 0. In particular, f(p, T) was regarded as an automorphism S of X = R, and the (ϵ, T)-entropy is essentially the e-entropy of S. But, despite some “oversights” in the definition of the (ϵ, T)-entropy and many years that have passed, the author decided to publish the corresponding chapter of the thesis in connection with the following: 1) There is a number of papers that refer to this work in the explanation of the history of the concept of Kolmogorov’s entropy. 2) Recently, B. M. Gurevich obtained new results on the ϵ-entropy hϵ(S), which show that for two ergodic automorphisms with equal finite entropies their ϵ-entropies also coincide for all ϵ, but, on the other hand, there are unexpected nonergodic automorphisms with equal finite entropies, but different ϵ-entropies for some ϵ. This shows that the concept of ϵ-entropy is of scientific value.

Minimizing closed geodesics via critical points of the uniform energy

In this paper we study 1/k-geodesics, those closed geodesics that minimize on any subinterval of length $l(\gamma)/k$. We employ energy methods to provide a relationship between the 1/k-geodesics and what we define as the balanced points of the uniform energy. We show that classes of balanced points of the uniform energy persist under the Gromov-Hausdorff convergence of Riemannian manifolds. Additionally, we relate half-geodesics (1/2-geodesics) to the Grove-Shiohama critical points of the distance function. This relationship affords us the ability to study the behavior of half-geodesics via the well developed field of critical point theory. Along the way we provide a complete characterization of the differentiability of the Riemannian distance function.

Quasisymmetrically Minimal Moran Sets

AbstractM. Hu and S. Wen considered quasisymmetrically minimal uniform Cantor sets of Hausdorff dimension 1, where at the k-th set one removes from each interval I a certain number nk of open subintervals of length ck|I|, leaving (nk + 1) closed subintervals of equal length. Quasisymmetrically Moran sets of Hausdorff dimension 1 considered in the paper are more general than uniform Cantor sets in that neither the open subintervals nor the closed subintervals are required to be of equal length.

Soft-decision decoding using punctured codes

Let a q-ary linear (n,k)-code be used over a memoryless channel. We design a soft-decision decoding algorithm that tries to locate a few most probable error patterns on a shorter length s /spl isin/ [k,n]. First, we take s cyclically consecutive positions starting from any initial point. Then we cut the subinterval of length s into two parts and examine T most plausible error patterns on either part. To obtain codewords of a punctured (s,k)-code, we try to match the syndromes of both parts. Finally, the designed codewords of an (s,k)-code are re-encoded to find the most probable codeword on the full length n. For any long linear code, the decoding error probability of this algorithm can be made arbitrarily close to the probability of its maximum-likelihood (ML) decoding given sufficiently large T. By optimizing s, we prove that this near-ML decoding can be achieved by using only T/spl ap/q/sup (n-k)k/(n+k)/ error patterns. For most long linear codes, this optimization also gives about T re-encoded codewords. As a result, we obtain the lowest complexity order of q/sup (n-k)k/(n+k)/ known to date for near-ML decoding. For codes of rate 1/2, the new bound grows as a cubic root of the general trellis complexity q/sup min{n-k,k}/. For short blocks of length 63, the algorithm reduces the complexity of the trellis design by a few decimal orders.

Asymptotics for open‐loop window flow control

An open‐loop window flow‐control scheme regulates the flow into a system by allowing at most a specified window size W of flow in any interval of length L. The sliding window considers all subintervals of length L, while the jumping window considers consecutive disjoint intervals of length L. To better understand how these window control schemes perform for stationary sources, we describe for a large class of stochastic input processes the asymptotic behavior of the maximum flow in such window intervals over a time interval [0, T] as T and Lget large, with T substantially bigger than L. We use strong approximations to show that when T ≫ L ≫ logT an invariance principle holds, so that the asymptotic behavior depends on the stochastic input process only via its rate and asymptotic variability parameters. In considerable generality, the sliding and jumping windows are asymptotically equivalent. We also develop an approximate relation between the two maximum window sizes. We apply the asymptotic results to develop approximations for the means and standard deviations of the two maximum window contents. We apply computer simulation to evaluate and refine these approximations.

Power of the scan statistic for detection of clustering.

The scan statistic is the maximum number of events in an interval of fixed length w as the subinterval moves over the entire time frame. Previous research derived the null distribution of the scan statistic under the conditional model which assumed that the total number of events was fixed, and under the unconditional model which let the total number of events be a random variable. This paper derives approximations for the power of the scan test for a pulse alternative. Under this alternative, the relative risk of disease on a subinterval (tau, tau + w), tau unknown, is theta-fold as high as it is for other subintervals of length w. Two sets of approximations are given for each model. The first approximation gives highly accurate results, but requires use of a personal computer. The second procedure can be performed on a hand-held calculator and appears very accurate for the cases examined.

Time‐Variance Relationship: Evidence on Correlation in Common Stock Returns: Comment

THIS COMMENT ATrEMPTS TO dispell the confusion now existing between differencing intervals and measurement intervals in regard to the behavior of securities' returns. In a recent paper in this Journal, Schwartz and Whitcomb' (SW) [5] claimed to have shown that as the differencing interval lengthens, the one period returns on securities demonstrate the following behavior: a) their variance declines; b) their coefficient of determination (R2) derived by regressing these returns on the market returns increases. This, according to SW, holds regardless of the existence of intertemporal correlation. For simplicity, we shaLl focus our discussion on the case of no intertemporal dependence. Furthermore, we shall adopt SW's assumption of stationarity over time of the distribution of returns. We start by contrasting the definitions of differencing interval and measurement interval. SW define differencing interval as a T periods interval which can be T divided into subintervals of length n each. This subinterval (named by SW n shorter period) serves as the building block for the measurement of the one period returns by SW. They define the return2 for this basic unit as:

Multiple Coverage of the Line

The probability of covering [0, 1) at least $m$ times by $N$ randomly placed subintervals of length $p$ is derived for all $m, N, p$.

Sets of convergence of exponential series

THEOREM. Let { a, } denote a sequence of numbers contained in the interval [0, 27r] and dense in a subinterval of length q for some positive number r. Let J(q) denote the set of integers which are divisible by [27r/fl] where the symbol [x ] denotes the largest positive integer not greater than x. If M(77) is a prescribed subset of J(r) then there exists a series (1) that diverges for each integer k in M(77) and converges for each integer k in J(7) -M(77).