Unified Solution of the Expected Maximum of a Discrete Time Random Walk and the Discrete Flux to a Spherical Trap

Two random-walk related problems which have been studied independently in the past, the expected maximum of a random walker in one dimension and the flux to a spherical trap of particles undergoing discrete jumps in three dimensions, are shown to be closely related to each other and are studied using a unified approach as a solution to a Wiener-Hopf problem. For the flux problem, this work shows that a constant c = 0.29795219 which appeared in the context of the boundary extrapolation length, and was previously found only numerically, can be derived analytically. The same constant enters in higher-order corrections to the expected-maximum asymptotics. As a byproduct, we also prove a new universal result in the context of the flux problem which is an analogue of the Sparre Andersen theorem proved in the context of the random walker's maximum.     

Biosensors based on gold nanoelectrode ensembles and screen printed electrodes

Gold nanowires were synthesized within polycarbonate membranes according to an electroless deposition method, obtaining nanoelectrode ensembles (NEEs) with special electrochemical features. NEEs were coupled with home-produced carbon graphite screen printed electrodes and the electrochemical properties of the original nanoelectrode ensemble on screen printed substrate (NEE/SPS) assembly has been tested for sensors application. Glucose oxidase has been used as model enzyme in order to verify the feasibility of disposable gold NEE/SPS biosensors. Finally, different immobilisation and electrochemical deposition techniques based on either self assembled monolayers of cysteamine (CYS) or amino-propyl-triethoxysilane (APTES) and conductive polyaniline (PANI) molecular wires were used. Spatial patterning of the enzyme on the polycarbonate surface and of PANI wires on gold nanoelectrodes was obtained. Possible direct electron transfer between the enzyme and the PANI modified gold nanoelectrodes has been evaluated.     

TLP-CCC: Temporal Link Prediction Based on Collective Community and Centrality Feature Fusion

In the domain of network science, the future link between nodes is a significant problem in social network analysis. Recently, temporal network link prediction has attracted many researchers due to its valuable real-world applications. However, the methods based on network structure similarity are generally limited to static networks, and the methods based on deep neural networks often have high computational costs. This paper fully mines the network structure information and time-domain attenuation information, and proposes a novel temporal link prediction method. Firstly, the network collective influence (CI) method is used to calculate the weights of nodes and edges. Then, the graph is divided into several community subgraphs by removing the weak link. Moreover, the biased random walk method is proposed, and the embedded representation vector is obtained by the modified Skip-gram model. Finally, this paper proposes a novel temporal link prediction method named TLP-CCC, which integrates collective influence, the community walk features, and the centrality features. Experimental results on nine real dynamic network data sets show that the proposed method performs better for area under curve (AUC) evaluation compared with the classical link prediction methods.     

大型海湾水交换计算中随机游动方法的应用研究

水交换矩阵是反映大型海湾不同子区域之间水交换关系的有效工具,该文对随机游动方法在水交换矩阵计算中的应用进行了研究．通过与对流扩散模型的对比,指出用随机游动方法计算水交换矩阵比用对流扩散方程求解更快更灵活．同时,为了对不同区域之间的水交换特性进行长期快速预测,采用了Thompson提出的预测矩阵方法．通过理论分析得出,影响该矩阵预测效果的因素主要有:粒子数目、分区数和预测矩阵取值时间．以一个矩形海湾为例,将数值模拟结果和预测矩阵预测结果进行对比,分析了以上各因素对预测效果的影响．结果表明,粒子数目越多,预测矩阵取值时间越长,预测矩阵的预测效果越好．在粒子数目足够多的情形下,分区数越多,预测效果越好．相反,粒子数目如果较少,过多的分区数将可能导致预测矩阵效果太差而不可用．     

Discrete Green's Function for Lattice Random Walk

A lattice random walk model based on particles scattering on discrete lattice of homogenous space is introduced. The discrete Green's function (DFG) for two-dimensional and three-dimensional lattice random walk of photon is found and proved by mathematical induction. The convolution theorem of photon lattice random walk is presented. They can be used with the method of images to calculate the photon density distribution in semi-infinite and finite slab homogenous turbid media such as tissue.     

Compressibility of random walker trajectories on growing networks

We find that the simple coupling of network growth to the position of a random walker on the network generates a traveling wave in the probability distribution of nodes visited by the walker. We argue that the entropy of this probability distribution is bounded as the network size tends to infinity. This means that the growth of a space coupled to a random walker situated in it constrains its dynamics to a set of typical random walker trajectories, and walker trajectories inside the growing space are compressible.     

磷酰化氨基酸自聚成肽的FTIR研究

本文通过对傅里叶变换红外光谱（ＦＴＩＲ）技术研究证明了磷酰化氨基酸可以知聚成肽，并由此说明了在仿生化成肽反应过程中，磷（酰化）起着十分重要的作用，同时了说明了ＦＴＩＲ技术为仿生化的过程研究提供了新的研究方法。     

The O(n) Loop Model on the 3–12 Lattice

The partition function of the O(n) loop model on the honeycomb lattice is mapped to that of the O(n) loop model on the 3–12 lattice. Both models share the same operator content and thus critical exponents. The critical points are related via a simple transformation of variables. When n = 0 this gives the recently found exact value = 1.711041... for the connective constant of self-avoiding walks on the 3–12 lattice. The exact critical points are recovered for the Ising model on the 3–12 lattice and the dual asanoha lattice at n = 1.