We present a new method for calculation of quasi-potential,which is a key concept in the large deviation theory.This method adopts the"ordered"idea in the ordered upwind algorithm and different from the fini...We present a new method for calculation of quasi-potential,which is a key concept in the large deviation theory.This method adopts the"ordered"idea in the ordered upwind algorithm and different from the finite difference upwind scheme,the first-order line integral is used as its update rule.With sufficient accuracy,the new simplified method can greatly speed up the computational time.Once the quasi-potential has been computed,the minimum action path(MAP)can also be obtained.Since the MAP is of concern in most stochastic situations,the effectiveness of this new method is checked by analyzing the accuracy of the MAP.Two cases of isotropic diffusion and anisotropic diffusion are considered.It is found that this new method can both effectively compute the MAPs for systems with isotropic diffusion and reduce the computational time.Meanwhile anisotropy will affect the accuracy of the computed MAP.展开更多
A graph has the unique path property UPPn if there is a unique path of length n between any ordered pair of nodes. This paper reiterates Royle and MacKay＇s technique for constructing orderly algorithms. We wish to u...A graph has the unique path property UPPn if there is a unique path of length n between any ordered pair of nodes. This paper reiterates Royle and MacKay＇s technique for constructing orderly algorithms. We wish to use this technique to enumerate all UPP2 graphs of small orders 3^2 and 4^2. We attempt to use the direct graph formalism and find that the algorithm is inefficient. We introduce a generalised problem and derive algebraic and combinatoric structures with appropriate structure. Then we are able to design an orderly algorithm to determine all UPP2 graphs of order 3^2, which runs fast enough. We hope to be able to determine the UPP2 graphs of order 4^2 in the near future.展开更多
基金the National Natural Science Foundation of China(Grant Nos.11772149 and 12172167)the Project Funded by the Priority Academic Program Development of Jiangsu Higher Education Institutions(PAPD)the Research Fund of State Key Laboratory of Mechanics and Control of Mechanical Structures(Grant No.MCMS-I19G01).
文摘We present a new method for calculation of quasi-potential,which is a key concept in the large deviation theory.This method adopts the"ordered"idea in the ordered upwind algorithm and different from the finite difference upwind scheme,the first-order line integral is used as its update rule.With sufficient accuracy,the new simplified method can greatly speed up the computational time.Once the quasi-potential has been computed,the minimum action path(MAP)can also be obtained.Since the MAP is of concern in most stochastic situations,the effectiveness of this new method is checked by analyzing the accuracy of the MAP.Two cases of isotropic diffusion and anisotropic diffusion are considered.It is found that this new method can both effectively compute the MAPs for systems with isotropic diffusion and reduce the computational time.Meanwhile anisotropy will affect the accuracy of the computed MAP.
基金supported in part by Project P15691 from the Austrian Federal FWF,the national science finding body,as well as by several ongoing grants from Stadt Linz,Land Obersterreich and the Austrian Federal BKA.Kunst
文摘A graph has the unique path property UPPn if there is a unique path of length n between any ordered pair of nodes. This paper reiterates Royle and MacKay＇s technique for constructing orderly algorithms. We wish to use this technique to enumerate all UPP2 graphs of small orders 3^2 and 4^2. We attempt to use the direct graph formalism and find that the algorithm is inefficient. We introduce a generalised problem and derive algebraic and combinatoric structures with appropriate structure. Then we are able to design an orderly algorithm to determine all UPP2 graphs of order 3^2, which runs fast enough. We hope to be able to determine the UPP2 graphs of order 4^2 in the near future.
