Simple Random Walks on Tori

We consider a Markov chain whose phase space is a d-dimensional torus. A point x jumps to x+ with probability p(x) and to x– with probability 1–p(x). For Diophantine and smooth p we prove that this Markov chain has an absolutely continuous invariant measure and the distribution of any point after n steps converges to this measure.     

Computer Simulations for Some One-Dimensional Models of Random Walks in Fluctuating Random Environment

We report some results of computer simulations for two models of random walks in random environment (rwre) on the one-dimensional lattice for fixed space–time configuration of the environment (“quenched rwre”): a “Markov model” with Markov dependence in time, and a “quasi stationary” model with long range space–time correlations. We compare with the corresponding results for a model with i.i.d. (in space time) environment. In the range of times available to us the quenched distributions of the random walk displacement are far from gaussian, but as the behavior is similar for all three models one cannot exclude asymptotic gaussianity, which is proved for the model with i.i.d. environment. We also report results on the random drift and on some time correlations which show a clear power decay     

An explanation of the phenomenon of polytypism

Based on the analogy between polytypes and spin-half Ising chains, polytypes can be considered as different phases of a spin-half Ising system with competing nearest neighbour and next nearest neighbour interactions operating in a single direction. It is known that such an Ising system exhibits extremely rich and complicated phase behaviour. This behaviour is shown to be very similar to the phase behaviour exhibited by polytypes.     

Characterization of Critical Values of Branching Random Walks on Weighted Graphs through Infinite-Type Branching Processes

We study the branching random walk on weighted graphs; site-breeding and edge-breeding branching random walks on graphs are seen as particular cases. Two kinds of survival can be identified: a weak survival (with positive probability there is at least one particle alive somewhere at any time) and a strong survival (with positive probability the colony survives by returning infinitely often to a fixed site). The behavior of the process depends on the value of a certain parameter which controls the birth rates; the threshold between survival and (almost sure) extinction is called critical value. We describe the strong critical value in terms of a geometrical parameter of the graph. We characterize the weak critical value and relate it to another geometrical parameter. We prove that, at the strong critical value, the process dies out locally almost surely; while, at the weak critical value, global survival and global extinction are both possible.     

Random walk on distant mesh points Monte Carlo methods

A new technique for obtaining Monte Carlo algorithms based on the Markov chains with a finite number of states is suggested. Instead of the classical random walk on neighboring mesh points, a general way of constructing Monte Carlo algorithms that could be called random walk on distant mesh points is considered. It is applied to solve boundary value problems. The numerical examples indicate that the new methods are less laborious and therefore more efficient.In conclusion, we mention that all Monte Carlo algorithms are parallel and could be easily realized on parallel computers.     

Transport Efficiency of Continuous-Time Quantum Walks on Graphs

Continuous-time quantum walk describes the propagation of a quantum particle (or an excitation) evolving continuously in time on a graph. As such, it provides a natural framework for modeling transport processes, e.g., in light-harvesting systems. In particular, the transport properties strongly depend on the initial state and specific features of the graph under investigation. In this paper, we address the role of graph topology, and investigate the transport properties of graphs with different regularity, symmetry, and connectivity. We neglect disorder and decoherence, and assume a single trap vertex that is accountable for the loss processes. In particular, for each graph, we analytically determine the subspace of states having maximum transport efficiency. Our results provide a set of benchmarks for environment-assisted quantum transport, and suggest that connectivity is a poor indicator for transport efficiency. Indeed, we observe some specific correlations between transport efficiency and connectivity for certain graphs, but, in general, they are uncorrelated.     

Rigorous solution of a Hubbard model extended by nearest‐neighbour Coulomb and exchange interaction on a triangle and tetrahedron

The Hubbard model extended by both nearest‐neighbour (nn) Coulomb correlation and nearest‐neighbour Heisenberg exchange is solved rigorously for a triangle and tetrahedron. All eigenvalues and eigenvectors are given as functions of the model parameters in a closed analytical form. For fixed electron numbers we found a multitude of level crossings, both in the ground state and in the excited states in dependence on the various model parameters. By coupling an ensemble of clusters to an electron bath we get the cluster gas model or the cluster gas approximation, if an extended array of weak‐interacting clusters is considered. The grand‐canonical potential Ω (μ, T, h) and the electron occupation N (μ, T, h) of the related cluster gases were calculated for arbitrary values (attractive and repulsive) of the three interaction constants. For the cluster gases without the additional interactions we found various steps in N (μ, T = 0, h = 0) higher than one. The reason is the degeneration of ground states differing in their electron occupation by more than one electron. For the triangular cluster gas we have one such degeneration point. For the tetrahedral cluster gas two. As a consequence, we do not find areas with one electron in the μ‐U ground‐state phase diagram of the triangular cluster gas or with one, two and five electrons in the case of the tetrahedral cluster gas. The degeneration point of the triangular cluster gas can not be destroyed by an applied magnetic field. This holds also for the lower degeneration point of the tetrahedral cluster gas. Otherwise, the upper degeneration point breaks down at a critical magnetic field h_c. The dependence of h_c on U shows a maximum for strong on‐site correlation. The influence of nn‐exchange and nn‐Coulomb correlation on the ground‐state phase diagrams is calculated. Whereas antiferromagnetic nn‐exchange breaks the degeneration points of the tetrahedral cluster gas partially only, a repulsive nn‐Coulomb correlation lifts the underlying degeneracies completely. Otherwise both ferromagnetic nn‐exchange and attractive nn‐Coulomb interaction stabilise the degeneration points. The consequences of the cluster gas results for extended cluster arrays are discussed.     

Power law scaling of the top Lyapunov exponent of a Product of Random Matrices

A sequence of i.i.d. matrix-valued random variables with probabilityp and with probability 1–p is considered. Leta() = a ₀ + O(), c() = c ₀ + O() lim ₀ b() = Oa ₀,c ₀, >0, andb()>0 for all >0. It is shown show that the top Lyapunov exponent of the matrix productX _n X _n-1...X ₁, = lim_n (1/n) n X _n X _n-1...X ₁ satisfies a power law with an exponent 1/2. That is, lim ₀(ln /ln ) = 1/2.     

Mean Hitting Time for Random Walks on a Class of Sparse Networks

For random walks on a complex network, the configuration of a network that provides optimal or suboptimal navigation efficiency is meaningful research. It has been proven that a complete graph has the exact minimal mean hitting time, which grows linearly with the network order. In this paper, we present a class of sparse networks G(t) in view of a graphic operation, which have a similar dynamic process with the complete graph; however, their topological properties are different. We capture that G(t) has a remarkable scale-free nature that exists in most real networks and give the recursive relations of several related matrices for the studied network. According to the connections between random walks and electrical networks, three types of graph invariants are calculated, including regular Kirchhoff index, M-Kirchhoff index and A-Kirchhoff index. We derive the closed-form solutions for the mean hitting time of G(t), and our results show that the dominant scaling of which exhibits the same behavior as that of a complete graph. The result could be considered when designing networks with high navigation efficiency.     

Transport Properties of Random Walks on Scale-Free/Regular-Lattice Hybrid Networks

We study numerically the mean access times for random walks on hybrid disordered structures formed by embedding scale-free networks into regular lattices, considering different transition rates for steps across lattice bonds (F) and across network shortcuts (f). For fast shortcuts (f/F≫1) and low shortcut densities, traversal time data collapse onto a universal curve, while a crossover behavior that can be related to the percolation threshold of the scale-free network component is identified at higher shortcut densities, in analogy to similar observations reported recently in Newman-Watts small-world networks. Furthermore, we observe that random walk traversal times are larger for networks with a higher degree of inhomogeneity in their shortcut distribution, and we discuss access time distributions as functions of the initial and final node degrees. These findings are relevant, in particular, when considering the optimization of existing information networks by the addition of a small number of fast shortcut connections.     

The Physical Property of Susceptibility for One-Dimensional Ferrimagnetic Chain with Alternating Spins 1 and 1/2 in Finite Magnetic Field

We further calculate the dependence of xT on T in high magnetic fields,where X denotes susceptibility and T is temperature,using our previous research work - Green function‘s decoupling approximate approach,for the one-dimensional ferrimagnetic chain with alternating spins 1 and 1/2.We find a linear correlation in certain range of magnetic field between the temperature of xT maximum and the magnetic field.Moreover,we simply analyze its physical meaning by our approach.``     

The Physical Property of Susceptibility for One-Dimensional Ferrimagnetic Chain with Alternating Spins 1 and 1/2 in Finite Magnetic Field

We further calculate the dependence of χT on T in high magnetic fields,where χ denotes susceptibility and T is temperature,using our previous research work - Green function's decoupling approximate approach,for the one-dimensional ferrimagnetic chain with alternating spins 1 and 1/2.We find a linear correlation in certain range of magnetic field between the temperature of χT maximum and the magnetic field.Moreover,we simply analyze its physical meaning by our approach.     

Continuous-Time Classical and Quantum Random Walk on Direct Product of Cayley Graphs

In this paper we define direct product of graphs and give a recipe for obtaining probability of observing particle on vertices in the continuous-time classical and quantum random walk. In the recipe, the probability of observing particle on direct product of graph is obtained by multiplication of probability on the corresponding to sub-graphs, where this method is useful to determining probability of walk on compficated graphs. Using this method, we calculate the probability of Continuous-time classical and quantum random walks on many of finite direct product Cayley graphs （complete cycle, complete Kn, charter and n-cube）. Also, we inquire that the classical state the stationary uniform distribution is reached as t→∞ but for quantum state is not always satisfied.     

基于Markov随机场的自适应正则化三维显微图像复原

提出了基于马尔可夫随机场模型的正则化因子自适应调整三维显微图像复原算法,并用模拟序列样本和真实生物样本进行了实验.为了保持复原图像的边缘等细节信息,以Markov随机场模型作为图像的先验概率模型,对代价函数添加边缘约束惩罚项.其中,正则化因子在迭代过程中自适应地进行更新.实验结果表明此算法在对原始图像进行估计的同时,能够有效地保留图像的边缘等细节信息.而EM算法虽然能够有效地去除层间干扰,却丢失了大量的细节信息.     

Electronic transport properties of silicon chains sandwiched between graphene electrodes: first-principles study

The effects of orientation and silicon chain length on the electronic transport properties for linear silicon chains sandwiched between two graphene electrodes are investigated by using non-equilibrium Green’s functions combined with density functional theory. Our results demonstrate that the conductance of single silicon chains can hardly be affected by its orientation, as there is negligible difference between the conductance of tilted and un-tilted chains, and the conductance is impacted greatly by the length of chains, i.e. the transmission coefficient is doubled for double chains. The equilibrium conductance of single silicon chains shows even-odd oscillating behavior, and its tendency decreases with the increase of the chain length. The non-equilibrium electronic transport properties for all types of chains are also calculated, and all current–voltage curves of silicon chains show a linear character. The frontier molecular orbitals, the total and projected density of states are used to analyse the electronic transport properties for all types of chains.     

Calculations of paramagnetic susceptibility of rare-earth compounds based on contour integration and the green function method

The paramagnetic susceptibility of rare-earth metal compounds, such as Er_{1 ? x} Ho _x Rh₄B₄, is studied in terms of the microscopic theory of complex compounds. It is shown that the inverse statistical susceptibility of these systems obeys the Curie-Weiss law, with the Curie temperature being determined by the exchange interaction in the self-consistent approximation. The obtained results are compared with experimental data.     

Different Versions of Perturbation Expansion Based on the Single-Trajectory Quadrature Method

The newly developed single trajectory quadrature method is applied to a two-dimensional example. Theresults based on different versions of new perturbation expansion and the new Green‘s function deduced from thismethod are compared with each other, also compared with the result from the traditional perturlbation theory. As thefirst application to higher-dimensional non-separable potential thc obtained result further confirms the applicability andpotential of this new method.     

Strain effect on transport properties of hexagonal boron—nitride nanoribbons

<正>The transport properties of hexagonal boron-nitride nanoribbons under the uniaxial strain are investigated by the Green's function method.We find that the transport properties of armchair boron-nitride nanoribbon strongly depend on the strain.In particular,the features of the conductance steps such as position and width are significantly changed by strain.As a strong tensile strain is exerted on the nanoribbon,the highest conductance step disappears and subsequently a dip emerges instead.The energy band structure and the local current density of armchair boron-nitride nanoribbon under strain are calculated and analysed in detail to explain these characteristics.In addition,the effect of strain on the conductance of zigzag boron-nitride nanoribbon is weaker than that of armchair boron nitride nanoribbon.     

Non-Markovian reversible Chapman-Kolmogorov measures on subshifts of finite type

We consider shift-invariant probability measures on subshift dynamical systems with a transition matrixA which satisfies the Chapman-Kolmogorov equation for some stochastic matrix compatible withA. We call them Chapman-Kolmogorov measures. A nonequilibrium entropy is associated to this class of dynamical systems. We show that ifA is irreducible and aperiodic, then there are Chapman-Kolmogorov measures distinct from the Markov chain associated with and its invariant row probability vectorq. If, moreover, (q, ) is a reversible chain, then we construct reversible Chapman-Kolmogorov measures on the subshift which are distinct from (q, ).