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 wit...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).展开更多
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 ...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.展开更多
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 environmen...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.展开更多
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 denoti...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.展开更多
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 ...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.展开更多
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...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.展开更多
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 c...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.展开更多
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 envi...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）.展开更多
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 mete...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.展开更多
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...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.展开更多
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 th...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.展开更多
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 recor...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.展开更多
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 re...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^β^γ.展开更多
The water exchange matrix is an efficient tool to study the water exchange among the sub-areas in large-scale bays. The application of the random walk method to calculate the water exchange matrix is studied. Compared...The water exchange matrix is an efficient tool to study the water exchange among the sub-areas in large-scale bays. The application of the random walk method to calculate the water exchange matrix is studied. Compared with the advection-diffusion model, the random walk model is more flexible to calculate the water exchange matrix. The forecast matrix suggested by Thompson et al. is used to evaluate the water exchange characteristics among the sub-areas fast. According to the theoretic analysis, it is found that the precision of the predicted results is mainly affected by three factors, namely, the particle number, the generated time of the forecast matrix, and the number of the sub-areas. The impact of the above factors is analyzed based on the results of a series of numerical tests. The results show that the precision of the forecast matrix increases with the increase of the generated time of the forecast matrix and the number of the particles. If there are enough particles in each sub-area, the precision of the forecast matrix will increase with the number of the sub-areas. Moreover, if the particles in each sub-area are not enough, the excessive number of the sub-areas can result in the decrease of the precision of the forecast matrix.展开更多
This study investigates the multi-solution search of the optimized quantum random-walk search algorithm on the hypercube. Through generalizing the abstract search algorithm which is a general tool for analyzing the se...This study investigates the multi-solution search of the optimized quantum random-walk search algorithm on the hypercube. Through generalizing the abstract search algorithm which is a general tool for analyzing the search on the graph to the multi-solution case, it can be applied to analyze the multi-solution case of quantum random-walk search on the graph directly. Thus, the computational complexity of the optimized quantum random-walk search algorithm for the multi-solution search is obtained. Through numerical simulations and analysis, we obtain a critical value of the proportion of solutions q. For a given q, we derive the relationship between the success rate of the algorithm and the number of iterations when q is no longer than the critical value.展开更多
基金Supported by the National Natural Science Foundation of China(11671373).
文摘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).
文摘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.
基金partially supported by the National Natural Science Foundation of China(NSFC,11101039,11171044,11271045)a cooperation program between NSFC and CNRS of France(11311130103)+1 种基金the Fundamental Research Funds for the Central UniversitiesHunan Provincial Natural Science Foundation of China(11JJ2001)
文摘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.
基金benefited from the support of the French government Investissements d’Avenir program ANR-11-LABX-0020-01partially supported by the National Natural Science Foundation of China(11571052,11401590,11731012 and 11671404)by Hunan Natural Science Foundation(2017JJ2271)
文摘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.
文摘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.
基金Project supported by the National Natural Science Foundation of China (Grant Nos. 61103231 and 61103230)the Innovation Program of Graduate Scientific Research in Institution of Higher Education of Jiangsu Province, China (Grant No. CXZZ11 0401)
文摘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.
文摘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.
文摘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）.
文摘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.
基金Project supported by the Research Foundation of Hangzhou Dianzi University,China (Grant Nos. KYF075610032 andzx100204004-7)the Hong Kong Research Grants Council,China (Grant No. CityU 1114/11E)
文摘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.
文摘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.
文摘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.
基金supported by the National Natural Science Foundation of China (Grant Nos. 61173183, 60973152, and 60573172)the Superior University Doctor Subject Special Scientific Research Foundation of China (Grant No. 20070141014)the Natural Science Foundation of Liaoning Province of China (Grant No. 20082165)
文摘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^β^γ.
基金supported by the National Natural Science Foundation of China(No.10702050)
文摘The water exchange matrix is an efficient tool to study the water exchange among the sub-areas in large-scale bays. The application of the random walk method to calculate the water exchange matrix is studied. Compared with the advection-diffusion model, the random walk model is more flexible to calculate the water exchange matrix. The forecast matrix suggested by Thompson et al. is used to evaluate the water exchange characteristics among the sub-areas fast. According to the theoretic analysis, it is found that the precision of the predicted results is mainly affected by three factors, namely, the particle number, the generated time of the forecast matrix, and the number of the sub-areas. The impact of the above factors is analyzed based on the results of a series of numerical tests. The results show that the precision of the forecast matrix increases with the increase of the generated time of the forecast matrix and the number of the particles. If there are enough particles in each sub-area, the precision of the forecast matrix will increase with the number of the sub-areas. Moreover, if the particles in each sub-area are not enough, the excessive number of the sub-areas can result in the decrease of the precision of the forecast matrix.
基金supported by the National Basic Research Program of China(Grant No.2013CB338002)
文摘This study investigates the multi-solution search of the optimized quantum random-walk search algorithm on the hypercube. Through generalizing the abstract search algorithm which is a general tool for analyzing the search on the graph to the multi-solution case, it can be applied to analyze the multi-solution case of quantum random-walk search on the graph directly. Thus, the computational complexity of the optimized quantum random-walk search algorithm for the multi-solution search is obtained. Through numerical simulations and analysis, we obtain a critical value of the proportion of solutions q. For a given q, we derive the relationship between the success rate of the algorithm and the number of iterations when q is no longer than the critical value.
