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

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

Magnetic behavior of the bond random mixed compound FE(BR x I1−x )2(x = 0.9) with Mössbauer spectroscopy

The bond random mixed compound Fe(Br_0.9I_0.1)₂ has been studied by magnetization and Mössbauer measurements. Although the zero-field cooled and field-cooled magnetization variations are not like a typical spin glass one, the Mössbauer spectrum below Néel temperature shows a hyperfine field distribution. It implies that the 10% FeI₂ mixed in FeBr₂ can be induced by the bond random effect which causes the sample to exhibit a spin glass-like behavior.     

Algorithmic and explicit determination of the Lovász number for certain circulant graphs

We consider the problem of computing the Lovász theta function for circulant graphs C_n,J of degree four with n vertices and chord length J, 2?J?n. We present an algorithm that takes O(J) operations if J is an odd number, and O(n/J) operations if J is even. On the considered class of graphs our algorithm strongly outperforms the known algorithms for theta function computation. We also provide explicit formulas for the important special cases J=2 and J=3.     

Upper and lower bounds for the energy of bipartite graphs

Using Lagrange's multiplier rule, we find upper and lower bounds of the energy of a bipartite graph G, in terms of the number of vertices, edges and the spectral moment of fourth order. Moreover, the upper bound is attained in a graph G if and only if G is the graph of a symmetric balanced incomplete block design (BIBD). Also, we determine the graphs for which the lower bound is sharp.     

Maximum norms of random sums and transient pattern formation

Many interesting and complicated patterns in the applied sciences are formed through transient pattern formation processes. In this paper we concentrate on the phenomenon of spinodal decomposition in metal alloys as described by the Cahn-Hilliard equation. This model depends on a small parameter, and one is generally interested in establishing sharp lower bounds on the amplitudes of the patterns as the parameter approaches zero. Recent results on spinodal decomposition have produced such lower bounds. Unfortunately, for higher-dimensional base domains these bounds are orders of magnitude smaller than what one would expect from simulations and experiments. The bounds exhibit a dependence on the dimension of the domain, which from a theoretical point of view seemed unavoidable, but which could not be observed in practice.

In this paper we resolve this apparent paradox. By employing probabilistic methods, we can improve the lower bounds for certain domains and remove the dimension dependence. We thereby obtain optimal results which close the gap between analytical methods and numerical observations, and provide more insight into the nature of the decomposition process. We also indicate how our results can be adapted to other situations.

     

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.     

2‐connected 7‐coverings of 3‐connected graphs on surfaces

An m‐covering of a graph G is a spanning subgraph of G with maximum degree at most m. In this paper, we shall show that every 3‐connected graph on a surface with Euler genus k ≥ 2 with sufficiently large representativity has a 2‐connected 7‐covering with at most 6k ? 12 vertices of degree 7. We also construct, for every surface F² with Euler genus k ≥ 2, a 3‐connected graph G on F² with arbitrarily large representativity each of whose 2‐connected 7‐coverings contains at least 6k ? 12 vertices of degree 7. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 26–36, 2003     

一些随机重合点定理

本文引入了一种满足更一般的收缩不等式的多重函数类,并证明了属于该类的可测多重函数对的一些随机重合点定理。     

Discrete limit theorems for general Dirichlet series. III

Here we prove a limit theorem in the sense of the weak convergence of probability measures in the space of meromorphic functions for a general Dirichlet series. The explicit form of the limit measure in this theorem is given. Partially supported by Lithuanian Foundation of Studies and Science     

B值随机变量阵列加权和的完全收敛性

设{X_ni:1≤i≤n,n≥1}为行间独立的B值r.v.阵列,g(z)是指数为1/p的正则变化函数,r>0,{ani 1≤t≤n,n≥1}为实数阵列,本文得到了使(?)成立的条件,推广并改进了Stout及Sung等的著名结论.