Localization for branching random walks in random environment

We consider branching random walks in d$d$-dimensional integer lattice with time–space i.i.d. offspring distributions. This model is known to exhibit a phase transition: If d≥3$d\ge 3$ and the environment is “not too random”, then, the total population grows as fast as its expectation with strictly positive probability. If, on the other hand, d≤2$d\le 2$, or the environment is “random enough”, then the total population grows strictly slower than its expectation almost surely. We show the equivalence between the slow population growth and a natural localization property in terms of “replica overlap”. We also prove a certain stronger localization property, whenever the total population grows strictly slower than its expectation almost surely.     

Heat-kernel estimates for random walk among random conductances with heavy tail

We study models of discrete-time, symmetric, Z^d${\mathbb{Z}}^d$-valued random walks in random environments, driven by a field of i.i.d. random nearest-neighbor conductances _ωxy∈[0,1]${\omega }_{xy}\in [0,1]$, with polynomial tail near 0 with exponent γ>0$\gamma >0$. We first prove for all d≥5$d\ge 5$ that the return probability shows an anomalous decay (non-Gaussian) that approaches (up to sub-polynomial terms) a random constant times n⁻²$n^{-2}$ when we push the power γ$\gamma$ to zero. In contrast, we prove that the heat-kernel decay is as close as we want, in a logarithmic sense, to the standard decay n^−d/2$n^{-d/2}$ for large values of the parameter γ$\gamma$.     

Limit theorems for occupation time fluctuations of branching systems II: Critical and large dimensions

We give functional limit theorems for the fluctuations of the rescaled occupation time process of a critical branching particle system in R^d${\mathbb{R}}^d$ with symmetric α$\alpha$-stable motion in the cases of critical and large dimensions, d=2α$d=2\alpha$ and d>2α$d>2\alpha$. In a previous paper [T. Bojdecki, L.G. Gorostiza, A. Talarczyk, Limit theorems for occupation time fluctuations of branching systems I: long-range dependence, Stochastic Process. Appl., this issue.] we treated the case of intermediate dimensions, α<d<2α$\alpha <d<2\alpha$, which leads to a long-range dependence limit process. In contrast, in the present cases the limits are generalized Wiener processes. We use the same space–time random field method of the previous paper, the main difference being that now the tightness requires a new approach and the proofs are more difficult. We also give analogous results for the system without branching in the cases d=α$d=\alpha$ and d>α$d>\alpha$.     

Large deviations of infinite intersections of events in Gaussian processes

Consider events of the form {_Zs≥ζ(s),s∈S}$\{Z_s\ge \zeta \left(s\right),s\in S\}$, where Z$Z$ is a continuous Gaussian process with stationary increments, ζ$\zeta$ is a function that belongs to the reproducing kernel Hilbert space R$R$ of process Z$Z$, and S⊂R$S\subset \mathbb{R}$ is compact. The main problem considered in this paper is identifying the function β^∗∈R${\beta }^{\ast }\in R$ satisfying β^∗(s)≥ζ(s)${\beta }^{\ast }\left(s\right)\ge \zeta \left(s\right)$ on S$S$ and having minimal R$R$-norm. The smoothness (mean square differentiability) of Z$Z$ turns out to have a crucial impact on the structure of the solution. As examples, we obtain the explicit solutions when ζ(s)=s$\zeta \left(s\right)=s$ for s∈[0,1]$s\in [0,1]$ and Z$Z$ is either a fractional Brownian motion or an integrated Ornstein–Uhlenbeck process.     

On functional limits of short- and long-memory linear processes with GARCH(1,1) noises

This paper considers the short- and long-memory linear processes with GARCH (1,1) noises. The functional limit distributions of the partial sum and the sample autocovariances are derived when the tail index α$\alpha$ is in (0,2)$(0,2)$, equal to 2, and in (2,∞)$(2,\infty )$, respectively. The partial sum weakly converges to a functional of α$\alpha$-stable process when α<2$\alpha <2$ and converges to a functional of Brownian motion when α≥2$\alpha \ge 2$. When the process is of short-memory and α<4$\alpha <4$, the autocovariances converge to functionals of α/2$\alpha /2$-stable processes; and if α≥4$\alpha \ge 4$, they converge to functionals of Brownian motions. In contrast, when the process is of long-memory, depending on α$\alpha$ and β$\beta$ (the parameter that characterizes the long-memory), the autocovariances converge to either (i) functionals of α/2$\alpha /2$-stable processes; (ii) Rosenblatt processes (indexed by β$\beta$, 1/2<β<3/4$1/2<\beta <3/4$); or (iii) functionals of Brownian motions. The rates of convergence in these limits depend on both the tail index α$\alpha$ and whether or not the linear process is short- or long-memory. Our weak convergence is established on the space of càdlàg functions on [0,1]$[0,1]$ with either (i) the _J1$J_1$ or the _M1$M_1$ topology (Skorokhod, 1956); or (ii) the weaker form S$S$ topology (Jakubowski, 1997). Some statistical applications are also discussed.     

A note on distance-regular graphs with a small number of vertices compared to the valency

In this note we study distance-regular graphs with a small number of vertices compared to the valency. We show that for a given α>2$\alpha >2$, there are finitely many distance-regular graphs Γ$\Gamma$ with valency k$k$, diameter D≥3$D\ge 3$ and v$v$ vertices satisfying v≤αk$v\le \alpha k$ unless (D=3$D=3$ and Γ$\Gamma$ is imprimitive) or (D=4$D=4$ and Γ$\Gamma$ is antipodal and bipartite). We also show, as a consequence of this result, that there are finitely many distance-regular graphs with valency k≥3$k\ge 3$, diameter D≥3$D\ge 3$ and _c2≥εk$c_2\ge \epsilon k$ for a given 0<ε<1$0<\epsilon <1$ unless (D=3$D=3$ and Γ$\Gamma$ is imprimitive) or (D=4$D=4$ and Γ$\Gamma$ is antipodal and bipartite).     

Limit theorems for occupation time fluctuations of branching systems I: Long-range dependence

We give a functional limit theorem for the fluctuations of the rescaled occupation time process of a critical branching particle system in R^d${\mathbb{R}}^d$ with symmetric α$\alpha$-stable motion and α<d<2α$\alpha <d<2\alpha$, which leads to a long-range dependence process involving sub-fractional Brownian motion. We also give an analogous result for the system without branching and d<α$d<\alpha$, which involves fractional Brownian motion. We use a space–time random field approach.     

Asymptotic theory for the multidimensional random on-line nearest-neighbour graph

The on-line nearest-neighbour graph on a sequence of n$n$ uniform random points in (0,1)^d${(0,1)}^d$ (d∈N$d\in \mathbb{N}$) joins each point after the first to its nearest neighbour amongst its predecessors. For the total power-weighted edge-length of this graph, with weight exponent α∈(0,d/2]$\alpha \in (0,d/2]$, we prove O(max{n^1−(2α/d),logn})$O(max\{n^{1-(2\alpha /d)},logn\})$ upper bounds on the variance. On the other hand, we give an n→∞$n\to \infty$ large-sample convergence result for the total power-weighted edge-length when α>d/2$\alpha >d/2$. We prove corresponding results when the underlying point set is a Poisson process of intensity n$n$.     

Monotonicity of the reflected Bessel transition density on the diagonal

For α∈R$\alpha \in \mathbb{R}$, let p^R(t,x,x)$p^R(t,x,x)$ denote the diagonal of the transition density of the α$\alpha$-Bessel process in (0,1]$(0,1]$, killed at 0 and reflected at 1. As a function of x$x$, if either α≥3$\alpha \ge 3$ or α=1$\alpha =1$, then for t>0$t>0$, the diagonal is nondecreasing. This monotonicity property fails if 1≠α<3$1\ne \alpha <3$.     

On probabilistic results for the discrepancy of a hybrid-Monte Carlo sequence

In many applications it has been observed that hybrid-Monte Carlo sequences perform better than Monte Carlo and quasi-Monte Carlo sequences, especially in difficult problems. For a mixed s$s$-dimensional sequence m$m$, whose elements are vectors obtained by concatenating d$d$-dimensional vectors from a low-discrepancy sequence q$q$ with (s−d)$(s-d)$-dimensional random vectors, probabilistic upper bounds for its star discrepancy have been provided. In a paper of G. Ökten, B. Tuffin and V. Burago [G. Ökten, B. Tuffin, V. Burago, J. Complexity 22 (2006), 435–458] it was shown that for arbitrary ε>0$\epsilon >0$ the difference of the star discrepancies of the first N$N$ points of m$m$ and q$q$ is bounded by ε$\epsilon$ with probability at least 1−2exp(−ε²N/2)$1-2exp(-{\epsilon }^{2}N/2)$ for N$N$ sufficiently large. The authors did not study how large N$N$ actually has to be and if and how this actually depends on the parameters s$s$ and ε$\epsilon$. In this note we derive a lower bound for N$N$, which significantly depends on s$s$ and ε$\epsilon$. Furthermore, we provide a probabilistic bound for the difference of the star discrepancies of the first N$N$ points of m$m$ and q$q$, which holds without any restrictions on N$N$. In this sense it improves on the bound of Ökten, Tuffin and Burago and is more helpful in practice, especially for small sample sizes N$N$. We compare this bound to other known bounds.     

Directed graphs,decompositions, and spatial linkages

The decomposition of a linkage into minimal components is a central tool of analysis and synthesis of linkages. In this paper we prove that every pinned d$d$-isostatic (minimally rigid) graph (grounded linkage) has a unique decomposition into minimal strongly connected components (in the sense of directed graphs), or equivalently into minimal pinned isostatic graphs, which we call d$d$-Assur graphs. We also study key properties of motions induced by removing an edge in a d$d$-Assur graph — defining a sharper subclass of strongly d$d$-Assur graphs by the property that all inner vertices go into motion, for each removed edge. The strongly 3-Assur graphs are the central building blocks for kinematic linkages in 3-space and the 3-Assur graphs are components in the analysis of built linkages. The d$d$-Assur graphs share a number of key combinatorial and geometric properties with the 2-Assur graphs, including an associated lower block-triangular decomposition of the pinned rigidity matrix which provides modular information for extending the motion induced by inserting one driver in a bottom Assur linkage to the joints of the entire linkage. We also highlight some problems in combinatorial rigidity in higher dimensions (d≥3$d\ge 3$) which cause the distinction between d$d$-Assur and strongly d$d$-Assur which did not occur in the plane.     

Multidimensional extension of the Morse–Hedlund theorem

A celebrated result of Morse and Hedlund, stated in 1938, asserts that a sequence x$x$ over a finite alphabet is ultimately periodic if and only if, for some n$n$, the number of different factors of length n$n$ appearing in x$x$ is less than n+1$n+1$. Attempts to extend this fundamental result, for example, to higher dimensions, have been considered during the last fifteen years. Let d≥2$d\ge 2$. A legitimate extension to a multidimensional setting of the notion of periodicity is to consider sets of Z^d${\mathbb{Z}}^d$ definable by a first order formula in the Presburger arithmetic 〈Z;<,+〉$〈\mathbb{Z};<,+〉$. With this latter notion and using a powerful criterion due to Muchnik, we exhibit a complete extension of the Morse–Hedlund theorem to an arbitrary dimension d$d$ and characterize sets of Z^d${\mathbb{Z}}^d$ definable in 〈Z;<,+〉$〈\mathbb{Z};<,+〉$ in terms of some functions counting recurrent blocks, that is, blocks occurring infinitely often.