Local Particles Numbers in Critical Branching Random Walk

Critical catalytic branching random walk on an integer lattice ? ^d is investigated for all d∈?. The branching may occur at the origin only and the start point is arbitrary. The asymptotic behavior, as time grows to infinity, is determined for the mean local particles numbers. The same problem is solved for the probability of the presence of particles at a fixed lattice point. Moreover, the Yaglom type limit theorem is established for the local number of particles. Our analysis involves construction of an auxiliary Bellman–Harris branching process with six types of particles. The proofs employ the asymptotic properties of the (improper) c.d.f. of hitting times with taboo. The latter notion was recently introduced by the author for a non-branching random walk on ? ^d .     

The loop-erased random walk and the uniform spanning tree on the four-dimensional discrete torus

Let x and y be points chosen uniformly at random from ${\mathbb {Z}_n^4}$ , the four-dimensional discrete torus with side length n. We show that the length of the loop-erased random walk from x to y is of order n ²(log n)^1/6, resolving a conjecture of Benjamini and Kozma. We also show that the scaling limit of the uniform spanning tree on ${\mathbb {Z}_n^4}$ is the Brownian continuum random tree of Aldous. Our proofs use the techniques developed by Peres and Revelle, who studied the scaling limits of the uniform spanning tree on a large class of finite graphs that includes the d-dimensional discrete torus for d ≥ 5, in combination with results of Lawler concerning intersections of four-dimensional random walks.     

Two finite embedding theorems for partial 3-quasigroups

In this paper it is shown that a finite partial (x, x, y) = y 3-quasigroup can be embedded in a finite (x, x, y) = y 3-quasigroup. This result coupled with the technique of proof is then used to show that a finite partial almost Steiner 3-quasigroup {(x, x, y) = y, (x, y, z) = (x, z, y) = (y, x, z)} can be embedded in a finite almost Steiner 3-quasigroup. Almost Steiner 3-quasigroups are of more than passing interest because just like Steiner 3-quasigroups ( = Steiner quadruple systems) all of their derived quasigroups are Steiner quasigroups.     

On the number of solutions to systems of Pell equations

We prove that, for positive integers a, b, c and d with c≠d, a>1, b>1, the number of simultaneous solutions in positive integers to ax²−cz²=1, by²−dz²=1 is at most two. This result is the best possible one. We prove a similar result for the system of equations x²−ay²=1, z²−bx²=1.     

Uniform boundary Harnack principle and generalized triangle property

Let D be a bounded open subset in R^d, d?2, and let G denote the Green function for D with respect to (-Δ)^α/2, 0<α?2, α<d. If α<2, assume that D satisfies the interior corkscrew condition; if α=2, i.e., if G is the classical Green function on D, assume—more restrictively—that D is a uniform domain. Let g=G(·,y₀)∧1 for some y₀∈D. Based on the uniform boundary Harnack principle, it is shown that G has the generalized triangle property which states that when d(z,x)?d(z,y). An intermediate step is the approximation G(x,y)≈|x-y|^α-dg(x)g(y)/g(A)², where A is an arbitrary point in a certain set B(x,y).This is discussed in a general setting where D is a dense open subset of a compact metric space satisfying the interior corkscrew condition and G is a quasi-symmetric positive numerical function on D×D which has locally polynomial decay and satisfies Harnack's inequality. Under these assumptions, the uniform boundary Harnack principle, the approximation for G, and the generalized triangle property turn out to be equivalent.     

Characterization of projective graphs

We denote the distance between vertices x and y of a graph by d(x, y), and p_ij(x, y) = ∥ {z : d(x, z) = i, d(y, z) = j} ∥. The (s, q, d)-projective graph is the graph having the s-dimensional subspaces of a d-dimensional vector space over GF(q) as vertex set, and two vertices x, y adjacent iff $\text{dim}\text{(x ? y) = s ? 1}$. These graphs are regular graphs. Also, there exist integers λ and μ > 4 so that μ is a perfect square, p₁₁(x, y) = λ whenever d(x, y) = 1, and p₁₁(x, y) = μ whenever d(x, y) = 2. The (s, q, d)-projective graphs where $\text{2d}\text{3}\text{≤ s < d ? 2}$ and $\text{(s, q, d) ≠ (}\text{2d}\text{3}\text{, 2, d)}$, are characterized by the above conditions together with the property that there exists an integer r satisfying certain inequalities.     

A construction of orthogonal arrays and applications to embedding theorems

An n^t by k orthogonal array is a collection of k-tuples of elements from an n-set, such that if a matrix is formed with the k-tuples as rows then each ordered t-tuple of elements appears exactly once as a row of each t columned and n^t rowed submatrix. If such an array has its set of k-tuples invariant under the elements of a subgroup G of S_t then the array is referred to as a G-array. A method is described for constructing a G-array of order nr from an array of order n and G-arrays of order r.The above described construction is used to produce finite embedding theorems for partial 3-quasigroups of various types. For a class of 3-quasigroups, such a theorem shows that a finite partial member of the class can be embedded in a finite complete member of the class. Theorems included produce finite embedding theorems for 3-quasigroups satisfying the identities 〈x,y,〈y,x,z〉〉=z and 〈〈z,x,y〉,y,x〉=z, for cyclic 3-quasigroup s, and conditional embedding theorems are presented for semi-symmetric 3-quasigroups.     

C1-algebras with finite duals

A forest is a finite partially ordered set F such that for x, y, z?F with x ? z, y ? z one has x ? y or y ? x. In this paper we give a complete characterization of all separable C¹-algebras $\text{A}$ with a finite dual $\text{A}\text{?}$, for which Prim $\text{A}$ is a forest with inclusion as partial order. These results are extended to certain separable C¹-algebras $\text{A}$ with a countable dual$\text{A}\text{?}$. As an example these results are used to characterize completely all separable C¹-algebras $\text{A}$ with a three point dual.     

Convexity in finite metric spaces

A subsetS of a metric space (X,d) is calledd-convex if for any pair of pointsx,y S each pointz X withd(x,z) +d(z,y) =d(x,y) belongs toS. We give some results and open questions concerning isometric and convexity-preserving embeddings of finite metric spaces into standard spaces and the number ofd-convex sets of a finite metric space.     

Catalytic branching random walks in ℤ d with branching at the origin

A time-continuous branching random walk on the lattice ? ^d , d ≥ 1, is considered when the particles may produce offspring at the origin only. We assume that the underlying Markov random walk is homogeneous and symmetric, the process is initiated at moment t = 0 by a single particle located at the origin, and the average number of offspring produced at the origin is such that the corresponding branching random walk is critical. The asymptotic behavior of the survival probability of such a process at moment t → ∞ and the presence of at least one particle at the origin is studied. In addition, we obtain the asymptotic expansions for the expectation of the number of particles at the origin and prove Yaglom-type conditional limit theorems for the number of particles located at the origin and beyond at moment t.     

On the Rédei zeta function

Let L be a locally finite lattice. An order function ν on L is a function defined on pairs of elements x, y (with x ≤ y) in L such that ν(x, y) = ν(x, z) ν(z, y). The Rédei zeta function of L is given by ?(s; L) = Σ_x∈Lμ(Ô, x) ν(Ô, x)^?s. It generalizes the following functions: the chromatic polynomial of a graph, the characteristic polynomial of a lattice, the inverse of the Dedekind zeta function of a number field, the inverse of the Weil zeta function for a variety over a finite field, Philip Hall's φ-function for a group and Rédei's zeta function for an abelian group. Moreover, the paradigmatic problem in all these areas can be stated in terms of the location of the zeroes of the Rédei zeta function.     

Metastability of reversible condensed zero range processes on a finite set

Let ${r: S\times S\to \mathbb R_{+}}$ be the jump rates of an irreducible random walk on a finite set S, reversible with respect to some probability measure m. For α >?1, let ${g: \mathbb N\to \mathbb R_{+}}$ be given by g(0)?=?0, g(1)?=?1, g(k) =? (k/k ? 1) ^α , k?≥ 2. Consider a zero range process on S in which a particle jumps from a site x, occupied by k particles, to a site y at rate g(k)r (x, y). Let N stand for the total number of particles. In the stationary state, as ${N\uparrow\infty}$ , all particles but a finite number accumulate on one single site. We show in this article that in the time scale N ^1+α the site which concentrates almost all particles evolves as a random walk on S whose transition rates are proportional to the capacities of the underlying random walk.     

On the Structure of Entrance Laws in Discrete Spatial Critical Branching Processes

MARKOVian branching population-valued stochastic processes in discrete time are considered, in which the individuals live on a discrete space of sites and an individual at site x produces, independently of the others, in the next generation a random offspring whose distribution depends on x, whose mean total number is assumed to be one and whose mean number at site y is denoted by J(x, [y]). It is proved that, provided the MARKOV chain associated with the transition matrix J is null-recurrent, exactly those among the entrance laws for the population-valued process are extremal and have a finite mean number of individuals at any site and time, which are ?of POISSON type”?, i.e. arise in a natural way from a POISSONian remote past. This generalizes a result of LIGGETT/PORT [3] on the pure motion case to the case of branching, and also comments on a remark of DYNKIN ([1], p. 110).     

A note on multitype branching process with bounded immigration in random environment

In this paper, we study the total number of progeny, W, before regenerating of multitype branching process with immigration in random environment. We show that the tail probability of |W| is of order t-κ as t→∞, with κ some constant. As an application, we prove a stable law for (L-1) random walk in random environment, generalizing the stable law for the nearest random walk in random environment (see "Kesten, Kozlov, Spitzer: A limit law for random walk in a random environment. Compositio Math., 30, 145-168 (1975)").     

A Dini type test on the pointwise convergence of double Fourier integrals

We give sufficient conditions for the convergence of the double Fourier integral of a complex-valued function f ∈ L ¹(?²) with bounded support at a given point (x ₀,y ₀) ∈ ?². It turns out that this convergence essentially depends on the convergence of the single Fourier integrals of the marginal functions f(x,y ₀), x ∈ ?, and f(x ₀,y), y ∈ ?, at the points x:= x ₀ and y:= y ₀, respectively. Our theorem applies to functions in the multiplicative Zygmund classes of functions in two variables.     

Commutativity of rings with derivations

I. N. Herstein [10] proved that a prime ring of characteristic not two with a nonzero derivation d satisfying d(x)d(y) = d(y)d(x) for all x, y must be commutative, and H. E. Bell and M. N. Daif [8] showed that a prime ring of arbitrary characteristic with nonzero derivation d satisfying d(xy) = d(yx) for all x, y in some nonzero ideal must also be commutative. For semiprime rings, we show that an inner derivation satisfying the condition of Bell and Daif on a nonzero ideal must be zero on that ideal, and for rings with identity, we generalize all three results to conditions on derivations of powers and powers of derivations. For example, let R be a prime ring with identity and nonzero derivation d, and let m and n be positive integers such that, when charR is finite, m ∨ n < charR. If d(x ^m y ⁿ ) = d(y ⁿ x ^m ) for all x, y ∈ R, then R is commutative. If, in addition, charR≠ 2 and the identity is in the image of an ideal I under d, then d(x) ^m d(y) ⁿ = d(y) ⁿ d(x) ^m for all x, y ∈ I also implies that R is commutative.     

Planar Graded Lattices and the <Emphasis Type="Bold">c</Emphasis><Subscript>1</Subscript>-Median Property

Let L be a lattice of finite length, ξ = (x ₁,…, x _k )∈L ^k , and y ∈ L. The remoteness r(y, ξ) of y from ξ is d(y, x ₁)+?+d(y, x _k ), where d stands for the minimum path length distance in the covering graph of L. Assume, in addition, that L is a graded planar lattice. We prove that whenever r(y, ξ) ≤ r(z, ξ) for all z ∈ L, then y ≤ x ₁∨?∨x _k . In other words, L satisfies the so-called c ₁ -median property.     

Applications of utility functions defined on quasi-metric spaces

A quasi-metric space (X,d) is called sup-separable if (X,d^s) is a separable metric space, where d^s(x,y)=max{d(x,y),d(y,x)} for all x,y∈X. We characterize those preferences, defined on a sup-separable quasi-metric space, for which there is a semi-Lipschitz utility function. We deduce from our results that several interesting examples of quasi-metric spaces which appear in different fields of theoretical computer science admit semi-Lipschitz utility functions. We also apply our methods to the study of certain kinds of dynamical systems defined on quasi-metric spaces.     

Structure of the Particle Population for a Branching Random Walk with a Critical Reproduction Law

We consider a continuous-time symmetric branching random walk on the d-dimensional lattice, d ≥?1, and assume that at the initial moment there is one particle at every lattice point. Moreover, we assume that the underlying random walk has a finite variance of jumps and the reproduction law is described by a continuous-time Markov branching process (a continuous-time analog of a Bienamye-Galton-Watson process) at every lattice point. We study the structure of the particle subpopulation generated by the initial particle situated at a lattice point x. We replay why vanishing of the majority of subpopulations does not affect the convergence to the steady state and leads to clusterization for lattice dimensions d =?1 and d =?2.

     

On the Mean Number of Particles of a Branching Random Walk on ℤ<Superscript><Emphasis Type="Italic">d</Emphasis></Superscript> with Periodic Sources of Branching

We consider a continuous-time branching random walk on ? ^d , where the particles are born and die on a periodic set of points (sources of branching). The spectral properties of the evolution operator for the mean number of particles at an arbitrary point of ? ^d are studied. This operator is proved to have a positive spectrum, which leads to an exponential asymptotic behavior of the mean number of particles as t → ∞.