Inequalities for the Moments and Distribution of the Ladder Height of a Random Walk

We obtain upper bounds for the tail distribution of the first nonnegative sum of a random walk and for the moments of the overshoot over an arbitrary nonnegative level if the expectation of jumps is positive and close to zero. In addition, we find an estimate for the expectation of the first ladder epoch.     

Moments of an exponential functional of random walks and permutations with given descent sets

The exponential functional of simple, symmetric random walks with negative drift is an infinite polynomial Y = 1 + ξ₁ + ξ₁ξ₂ + ξ₁ξ₂ξ₃ + ⋯ of independent and identically distributed non-negative random variables. It has moments that are rational functions of the variables μ _k = E(ξ ^k ) < 1 with universal coefficients. It turns out that such a coefficient is equal to the number of permutations with descent set defined by the multiindex of the coefficient. A recursion enumerates all numbers of permutations with given descent sets in the form of a Pascal-type triangle. This revised version was published online in August 2006 with corrections to the Cover Date.     

Resonance method for IR sensing

A highly sensitive method for infrared radiation detection based on thermal resonance in an active bolometer is set forth. An active bolometer is a self-oscillating system consisting of an IR-sensitive cell in a feedback circuit of an adjustable proportional controller. The analysis of an active bolometer autonomous (dark) dynamics reveals that with a generalized gain factor A variation the system evolves from relaxation type towards oscillating and self-oscillating type. When A=A_c, where A_c is a critical value of the generalized gain factor A, the steady state loses stability through self-excited thermal oscillations. The resonance in a system weakly perturbed by IR radiation modulated at self-oscillation frequency q₀[1+exp(iω_ct)] is considered. It is shown that in a small precritical vicinity =(A−A_c)/A_c of the gain factor the amplitude of forced thermal oscillations is proportional to q₀/A_c. The D^* calculation reveals that the detection power of a passive (A=0) bolometer increases with feedback introduction by a factor of 1/||. The detection powers of feasible versions of an active bolometer are compared.     

One-dimensional non-nearest-neighbor random walks in the presence of traps

A one-dimensional lattice random walk in the presence ofm equally spaced traps is considered. The step length distribution is a symmetric exponential. An explicit analytic expression is obtained for the probability that the random walk will be trapped at thejth trapping site.     

C-Fe chains due to segregated carbon impurities on Fe(1 0 0)

Bulk carbon impurities segregate at the Fe(1 0 0) surface and, upon thermal annealing, can form metastable surface phases with local and long range order and peculiar electronic properties. We present a surface science study of C-segregated Fe(1 0 0) with scanning tunneling microscopy, angle resolved photoemission, and ab initio calculations of the surface structure and electron states. In particular the c(3√2 × √2) structure, observed for 0.67 atomic layers of C segregated at the iron surface, is found to be due to self-organized carbon stripes made of zig-zag chains. The strong hybridization between C and Fe was observed in ARPES spectra.     

随机环境中多物种分枝随机游动

引进了随机环境中多物种分枝随机游动的一般模型.在分枝过程非灭绝的情况下,讨论了系统的状态分类,得到了系统暂留及强常返的充要条件是存在k个定义在整数集上的函数分别满足某种性质.最后给出了系统强暂留的充分条件.     

Escape Through a Small Opening: Receptor Trafficking in a Synaptic Membrane

We model the motion of a receptor on the membrane surface of a synapse as free Brownian motion in a planar domain with intermittent trappings in and escapes out of corrals with narrow openings. We compute the mean confinement time of the Brownian particle in the asymptotic limit of a narrow opening and calculate the probability to exit through a given small opening, when the boundary contains more than one. Using this approach, it is possible to describe the Brownian motion of a random particle in an environment containing domains with small openings by a coarse grained diffusion process. We use the results to estimate the confinement time as a function of the parameters and also the time it takes for a diffusing receptor to be anchored at its final destination on the postsynaptic membrane, after it is inserted in the membrane. This approach provides a framework for the theoretical study of receptor trafficking on membranes. This process underlies synaptic plasticity, which relates to learning and memory. In particular, it is believed that the memory state in the brain is stored primarily in the pattern of synaptic weight values, which are controlled by neuronal activity. At a molecular level, the synaptic weight is determined by the number and properties of protein channels (receptors) on the synapse. The synaptic receptors are trafficked in and out of synapses by a diffusion process. Following their synthesis in the endoplasmic reticulum, receptors are trafficked to their postsynaptic sites on dendrites and axons. In this model the receptors are first inserted into the extrasynaptic plasma membrane and then random walk in and out of corrals through narrow openings on their way to their final destination.     

The spectrum of BSA(v, 3, λ; α) with α = 2,3

In this article, a kind of auxiliary design BSA^* for constructing BSAs is introduced and studied. Two powerful recursive constructions on BSAs from 3‐IGDDs and BSA^*s are exploited. Finally, the necessary and sufficient conditions for the existence of a BSA(v, 3, λ; α) with α = 2, 3 are established. © 2006 Wiley Periodicals, Inc. J Combin Designs 15: 61–76, 2007     

A multifractal decomposition according to rate of returns

For one‐dimensional simple symmetric random walk, the Hausdorff and packing dimensions of sets of sample paths with prescribed rate of returns to the origin are determined. This gives a multifractal decomposition of the underlying sample space. (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Lower bounds for transition probabilities on graphs

The paper presents two results. The first one provides separate conditions for the upper and lower estimates of the distribution of the time of exit from balls of a random walk on a weighted graph. The main result of the paper is that the lower estimate follows from the elliptic Harnack inequality. The second result is an off-diagonal lower bound for the transition probability of the random walk.