ON THE EMPTY BALLS OF A CRITICAL OR SUBCRITICAL BRANCHING RANDOM WALK

Let{Z_(n)}_(n)≥0 be a critical or subcritical d-dimensional branching random walk started from a Poisson random measure whose intensity measure is the Lebesugue measure onℝ^(d).Denote by R_(n):=sup{u>0:Z_(n)({x∈ℝ^(d):∣x∣<u})=0}the radius of the largest empty ball centered at the origin of Zn.In this work,we prove that after suitable renormalization,Rn converges in law to some non-degenerate distribution as n→∈.Furthermore,our work shows that the renormalization scales depend on the offspring law and the dimension of the branching random walk.This completes the results of Révész[13]for the critical binary branching Wiener process.

Strong invariance principle for a counterbalanced random walk

We study a counterbalanced random walkS_(n)=X_(1)+…+X_(n),which is a discrete time non-Markovian process andX_(n) are given recursively as follows.For n≥2,X_(n) is a new independent sample from some fixed law̸=0 with a fixed probability p,andX_(n)=−X_(v(n))with probability 1−p,where v(n)is a uniform random variable on{1;…;n−1}.We apply martingale method to obtain a strong invariance principle forS_(n).

Heat Kernel Estimates on Simple Random Walks and On-Diagonal Upper Bounds

We primarily provide several estimates for the heat kernel defined on the 2-dimensional simple random walk. Additionally, we offer an estimate for the heat kernel on high-dimensional random walks, demonstrating that the heat kernel in higher dimensions converges rapidly. We also compute the constants involved in the estimate for the 1-dimensional heat kernel. Furthermore, we discuss the general case of on-diagonal estimates for the heat kernel.

基于Random Walk算法的CT图像肺实质自动分割

针对复杂情况下肺实质的分割问题,提出了一种基于Random Walk算法对肺实质自动分割的方法。首先,根据胸部组织解剖学及其计算机断层扫描(CT)图像的影像学特征,在肺实质及其周围组织分别确定目标区域种子点和背景种子点位置;然后,使用Random Walk算法对CT图像进行分割,提取近似肺区域的掩模;接下来,对掩模实施数学形态学运算,来进一步调整目标区域种子点和背景种子点的标定位置,使其适合具体的复杂情况;最后,再次使用Random Walk算法分割图像,得到最终的肺实质分割结果。实验结果显示,该方法与金标准的平均绝对距离为0.44±0.13 mm,重合率(DC)为99.21%±0.38%。与其他分割方法相比,该方法在分割精度上得到了显著提高。结果表明,提出的方法能够解决复杂情况下肺实质分割的问题,确保了分割的完整性、准确性、实时性和鲁棒性,分割结果和时间均可满足临床需求。

基于LBP的改进Random Walks算法在颅脑磁共振影像分割中的应用

目的由于颅脑结构复杂且颅脑磁共振影像易受噪声、磁场不均匀性、部分容积效应等因素的影响,精确的脑组织分割方法仍需深入研究。方法本文提出一种基于Random Walks的改进算法以提高脑白质、脑灰质及脑脊液分割的准确性。通过引入局部二值模式(local binary patterns,LBP)改进了传统Random Walks权重函数的构造,在反映相邻像素灰度变化信息的同时包含了局部图像的纹理信息,有利于合并同质区域并增强边缘轮廓的识别。本文还使用了灰度先验概率模型减少Random Walks种子点交互的次数。结果实验结果表明基于LBP的改进算法在多种不同水平的噪声及不均匀场作用下,能够有效识别磁共振影像中脑组织区域的边缘轮廓,并对噪声有良好的鲁棒性。结论基于LBP的改进Random Walks算法可精确分割颅脑磁共振影像。

基于改进Random Walk算法的磁共振图像脑组织分割

在Random Walk算法中,边的权重对算法分割性能有着重要的影响,针对原算法在计算权重时仅使用相邻像素灰度值变化信息的局限性,通过引入图像局部熵,使得权重函数同时反映相邻像素灰度变化信息和图像局部灰度离散度信息,增强算法对目标内容和边界的识别能力。同时通过Fisher评价函数构造最佳分类阈值的选取法则,增强了算法的判别能力。实验表明改进后的算法对目标内容和边界的识别能力有较大提高,且对噪声具有更好的鲁棒性。

基于Random Walks算法的心脏双源CT左心房分割

针对在传统的CT介入式治疗过程中,胸腔中软组织较多软组织的厚度和注射的造影剂在心脏中呈现的不均匀分布,导致在采用CT成像的图像中胸腔内部各组织之间存在边界模糊或者确实等状况,本文提出一种采用形态重构和随机行走相结合的分割方法。首先利用形态学开闭运算对图像进行化简,并使得心脏CT腔体边界分离,进而使得各个组织组织分离,再结合Random walks算法。从而使得不需要标记太多种子点的情况下提高了分割的速度和准确性,实验证明该方法能够达到预期的目标。

基于Random-Walk算法的DR图像分割方法

本文算法对原图像进行快速Mallat小波分解得到骨干图后,利用其高频子带梯度信息优化边的权重,并在概率阈值的准则下对争议区域做进一步划分,最后把最大到达概率所在类的标签赋予未标定顶点,并扩展到原图像,得到分割边界。用微软GrabCut分割数据库图像和实际DR图像对该算法进行了验证,该算法能快速而有效地分割出特定的图像,适用于DR图像的分割,为进行组织增强和进一步提高DR图像质量打下基础。

Immunization for scale-free networks by random walker

Based on the random walk and the intentional random walk, we propose two types of immunization strategies which require only local connectivity information. On several typical scale-free networks, we demonstrate that these strategies can lead to the eradication of the epidemic by immunizing a small fraction of the nodes in the networks. Particularly, the immunization strategy based on the intentional random walk is extremely efficient for the assortatively mixed networks.

ASYMPTOTIC PROPERTIES OF A BRANCHING RANDOM WALK WITH A RANDOM ENVIRONMENT IN TIME

We consider a branching random walk in an independent and identically distributed random environment ξ=(ξn) indexed by the time. Let W be the limit of the martingale Wn=∫e^-txZn(dx)/Eξ∫e^-txZn(dx), with Zn denoting the counting measure of particles of generation n, and Eξ the conditional expectation given the environment ξ. We find necessary and sufficient conditions for the existence of quenched moments and weighted moments of W, when W is non-degenerate.

CENTRAL LIMIT THEOREMS FOR A BRANCHING RANDOM WALK WITH A RANDOM ENVIRONMENT IN TIME

We consider a branching random walk with a random environment m time, in which the offspring distribution of a particle of generation n and the distribution of the displacements of its children depend on an environment indexed by the time n. The envi- ronment is supposed to be independent and identically distributed. For A C R, let Zn（A） be the number of particles of generation n located in A. We show central limit theorems for the counting measure Zn （-） with appropriate normalization.

Random walk search in unstructured P2P

Unstructured P2P has power-law link distribution, and the random walk in power-law networks is analyzed. The analysis results show that the probability that a random walker walks through the high degree nodes is high in the power-law network, and the information on the high degree nodes can be easily found through random walk. Random walk spread and random walk search method （RWSS） is proposed based on the analysis result. Simulation results show that RWSS achieves high success rates at low cost and is robust to high degree node failure.

A random walk evolution model of wireless sensor networks and virus spreading

In this paper, considering both cluster heads and sensor nodes, we propose a novel evolving a network model based on a random walk to study the fault tolerance decrease of wireless sensor networks （WSNs） due to node failure, and discuss the spreading dynamic behavior of viruses in the evolution model. A theoretical analysis shows that the WSN generated by such an evolution model not only has a strong fault tolerance, but also can dynamically balance the energy loss of the entire network. It is also found that although the increase of the density of cluster heads in the network reduces the network efficiency, it can effectively inhibit the spread of viruses. In addition, the heterogeneity of the network improves the network efficiency and enhances the virus prevalence. We confirm all the theoretical results with sufficient numerical simulations.

Some Probability Properties of Random Walk in Time-Random Environment

A general formulation of the stochastic model for random walk in time-random environment and an equivalent definition is established in this paper. Moreover, some basic probability relations similar to the classical case which are very useful in the corresponding research of fractal properties are given. At the end, a typical example is provided to show the recurrence and transience. Key words random environment - random walk in timerandom environment - skew product Markov chain CLC number O 211.6 Foudation item: Supported by the National Natural Science Foundation of China (10371092) and Foundation of Wuhan University.Biography: Zhang Xiao-min (1977-), male, Ph. D candidate, research direction: stochastic processes and random fractal.

RENEWAL THEOREM FOR(L,1)-RANDOM WALK IN RANDOM ENVIRONMENT

We consider a random walk on Z in random environment with possible jumps {-L,…, -1, 1}, in the case that the environment {ωi ： i ∈ Z} are i.i.d.. We establish the renewal theorem for the Markov chain of ＂the environment viewed from the particle＂ in both annealed probability and quenched probability, which generalize partially the results of Kesten （1977） and Lalley （1986） for the nearest random walk in random environment on Z, respectively. Our method is based on （L, 1）-RWRE formulated in Hong and Wang the intrinsic branching structure within the （2013）.

Random walk modeling of wake dispersion for the exhaust tower of an underground tunnel in urban area

In this paper, some experimental studies on the impact of effluent from an exhaust tower of an underground tunnel with special construction are reported. By measuring the flow field downstream of the tower in NJU meteorological wind tunnel, some flow characteristics in the make area were established. Based on these, an advanced random\|walk dispersion model was set up and applied successfully to the simulation of dispersion in the wake area. The modelling results were in accordance with wind tunnel measurements. The computed maximum of ground surface concentration in the building case was a factor of 3-4 higher than that in the flat case and appeared much closer to the source. The simulation indicated that random walk modelling is an effective and practical tool for the wake stream impact assessment.

Exact scaling for the mean first-passage time of random walks on a generalized Koch network with a trap

In this paper, we study the scaling for the mean first-passage time （MFPT） of the random walks on a generalized Koch network with a trap. Through the network construction, where the initial state is transformed from a triangle to a polygon, we obtain the exact scaling for the MFPT. We show that the MFPT grows linearly with the number of nodes and the dimensions of the polygon in the large limit of the network order. In addition, we determine the exponents of scaling efficiency characterizing the random walks. Our results are the generalizations of those derived for the Koch network, which shed light on the analysis of random walks over various fractal networks.

Modelling of the behavior of marine oil spills: applications based on random walk techniques

A numerical model has been developed to simulate the transport and fate of oil spilled at sea. The model combines the transport and fate processes of spilled oil with the random walk technique. Oil movement under the influence of tidal currents, wind driven currents, and turbulent eddies is simulated by the PLUME RW dispersion model developed by HR Wallingford. The weathering processes in the model represent physical and chemical changes of soil slicks with time, and comprise mechanical spreading, dispersion, evaporation and emulsification. Shoreline stranding is determined approximately using a capacity method for different shoreline types. This paper presents details of the model, and describe the results of various sensitivity tests. The model is suitable for oil spill contingency planning.

Application of random walk model to fit temperature in 46 gamma world cities from 1901 to 1998

Very recently, we have applied the random walk model to fit the global temperature anomaly, CRUTEM3. With encouraging results, we apply the random walk model to fit the temperature walk that is the conversion of recorded tem-perature and real recorded temperature in 46 gamma world cities from 1901 to 1998 in this study. The results show that the random walk model can fit both temperature walk and real recorded temperature although the fitted results from other climate models are unavailable for comparison in these 46 cities. Therefore, the random walk model can fit not only the global temperature anomaly, but also the real recorded temperatures in various cities around the world.

Competition between two kinds of information among random-walking individuals

A model is proposed to describe the competition between two kinds of information among N random-walking individuals in an L x L square, starting from a half-and-half mixture of two kinds of information. Individuals remain or change their information according to their neighbors＇ information. When the moving speed of individuals v is zero, the two kinds of information typically coexist, and the ratio between them increases with L and decreases with N. In the dynamic case （v 〉 0）, only one information eventually remains, and the time required for one information being left scales as Td -v^αL^β^γ.