Randomized broadcast in networks

In this paper we study the rate at which a rumor spreads through an undirected graph. This study has two important applications in distributed computation: in simple, robust and efficient broadcast protocols, and in the maintenance of replicated databases.     

Invariance Principle Under Self-Normalization for Nonidentically Distributed Random Variables

Let V _n ^–1 _n be the adaptive process of self-normalized partial sums S _k of independent random variables X _i , defined by linear interpolation between the points (V _k ²/V _n ²,S _k /V _n ), kn, where V _k ²= _ik X _i ². We prove that if the X _k 's are symmetric, V _n ^–1 _n converges weakly to the Brownian motion W in each Hölder space supporting W if and only if V _n ^–1 max _kn |X _k |=o _P (1). We give some partial extension to the non symmetric case.     

Compact Kähler Surfaces with Trivial Canonical Bundle

The classical conjectures of Weil on K3 surfaces – that the set of suchsurfaces is connected; that a version of the Torelli theorem holds; thateach such surface is Kähler; and that the period map issurjective – are reconsidered in the light of a generalisation of theNakai–Moishezon criterion, and short proofs of all the conjectures aregiven. Most of the proofs apply equally or with minor variation tocomplex 2-tori, the only other compact Kähler surfaces with trivialcanonical bundle.     

A general Hsu-Robbins-Erdős Type estimate of tail probabilities of sums of independent identically distributed random variables

Periodica Mathematica Hungarica - Let X 1,X 2,... be a sequence of independent and identically distributed random variables, and put % MATHTYPE!MTEF!2!1!+-%...     

Recovery of Band-Limited Functions on Locally Compact Abelian Groups from Irregular Samples

Using the techniques of approximation and factorization of convolution operators we study the problem of irregular sampling of band-limited functions on a locally compact Abelian group G. The results of this paper relate to earlier work by Feichtinger and Gröchenig in a similar way as Kluvánek's work published in 1969 relates to the classical Shannon Sampling Theorem. Generally speaking we claim that reconstruction is possible as long as there is sufficient high sampling density. Moreover, the iterative reconstruction algorithms apply simultaneously to families of Banach spaces.     

The Paley--Wiener Theorem for the Generalized Radon Transform on the Plane

We consider the problem of reconstructing a function on the disk from its integrals over curves close to straight lines, i.e., the inversion problem for the generalized Radon transform. Necessary and sufficient conditions on the range of the generalized Radon transform are obtained for functions supported in a smaller disk under the additional condition that the curves that do not meet coincide with the corresponding straight lines.     

Inhomogeneous Voter Models in One Dimension

We establish conditions for survival and extinction of types of one-dimensional voter models, and show that increasing the flip rates at a finite number of sites typically does not affect survival, unless the flipping mechanism is altered. We provide an example of a modified voter model that does not survive but can be made to survive simply by altering the flip mechanism at one site. We also show that a rather general class of such models have clustering behavior.     

Path Collapse for an Inhomogeneous Random Walk

On an open interval we follow the paths of a Brownian motion which returns to a fixed point as soon as it reaches the boundary and restarts afresh indefinitely. We determine that two paths starting at different points either cannot collapse or they do so almost surely. The problem can be modelled as a spatially inhomogeneous random walk on a group and contrasts sharply with the higher dimensional case in that if two paths may collapse they do so almost surely.     

The Topology of Algebra: Combinatorics of Squaring

We study the graph each of whose edges connects an element of a given ring with the square of itself. For a finite commutative group (e.g., for the multiplicative group of coprime residue classes modulo a positive integer), we describe this graph explicitly: each of its connected components is an oriented attracting cycle equipped with identical -vertex rooted trees of special form whose roots reside on the cycle. We also compute the graphs of permutation groups on not too many elements and of the subgroups of even permutations; the connected components of these graphs are also uniformly equipped cycles.     

Probability Inequalities and Limit Theorems for Generalized L-Statistics

We obtain exponential upper bounds for tails of distributions of generalized L-statistics based on a sample from an exponential distribution. We prove the asymptotic normality of generalized L-statistics based on a sample from the uniform distribution on [0,1] and of L-statistics with decomposed kernels (without any restrictions on the sample distribution type).