• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

Private communications (0)

by H-D Cao
Add To MetaCart

Tools

Sorted by:
Results 1 - 10 of 14
Next 10 →

Analysis of explicit tau-leaping schemes for simulating chemically reacting systems

by Tiejun Li - Multiscale Model. Simul
"... Abstract. This paper builds a convergence analysis of explicit tau-leaping schemes for simulating chemical reactions from the viewpoint of stochastic differential equations. Mathematically, the chemical reaction process is a pure jump process on a lattice with state-dependent intensity. The stochast ..."
Abstract - Cited by 28 (6 self) - Add to MetaCart
Abstract. This paper builds a convergence analysis of explicit tau-leaping schemes for simulating chemical reactions from the viewpoint of stochastic differential equations. Mathematically, the chemical reaction process is a pure jump process on a lattice with state-dependent intensity. The stochastic differential equation form of the chemical master equation can be given via Poisson random measures. Based on this form, different types of tau-leaping schemes can be proposed. In order to make the problem well-posed, a modified explicit tau-leaping scheme is considered. It is shown that the mean square strong convergence is of order 1/2 and the weak convergence is of order 1 for this modified scheme. The novelty of the analysis is to handle the non-Lipschitz property of the coefficients and jumps on the integer lattice.
(Show Context)

Citation Context

...al methods of SDE may be referenced in Schurz [39]. Remark 2.2. An important numerical issue must be addressed is that all of the numerical schemes proposed so far are of first order weak convergence =-=[9, 11, 37]-=-. This can be explained as follows. Now all of the methods take Runge–Kutta-type form. From the results for SDEs driven by Wiener process in [7, 38], the mean square strong order barrier is 0.5 for th...

Degree Fluctuations and the Convergence Time of Consensus Algorithms

by Alex Olshevsky, John N. Tsitsiklis , 2012
"... We consider a consensus algorithm in which every node in a sequence of undirected, B-connected graphs assigns equal weight to each of its neighbors. Under the assumption that the degree of each node is fixed (except for times when the node has no connections to other nodes), we show that consensus i ..."
Abstract - Cited by 6 (0 self) - Add to MetaCart
We consider a consensus algorithm in which every node in a sequence of undirected, B-connected graphs assigns equal weight to each of its neighbors. Under the assumption that the degree of each node is fixed (except for times when the node has no connections to other nodes), we show that consensus is achieved within a given accuracy ɛ on n nodes in time B+4n3Bln(2n/ɛ). Because there is a direct relation between consensus algorithms in time-varying environments and inhomogeneous random walks, our result also translates into a general statement on such random walks. Moreover, we give a simple proof of a result of Cao, Spielman, and Morse that the worst case convergence time becomes exponentially large in the number of nodes n under slight relaxation of the degree constancy assumption.
(Show Context)

Citation Context

... degree sequence (say, in non-increasing order) is independent of t (thus allowing nodes to “swap” degrees), exponential convergence time is possible. While this fact was known (although unpublished) =-=[5]-=-, our contribution is to provide a simple proof. The presentation of our counterexamples capitalizes on the correspondence with Markov chains discussed in Section III. In summary: for connected bidire...

Liouville properties of plurisubharmonic functions

by Lei Ni, Luen-fai Tam
"... §0 Introduction. In this paper we will prove a Liouville theorem on smooth plurisubharmonic functions on a complete noncompact Kähler manifold with nonnegative bisectional curvature. Using this Liouville theorem we prove a splitting theorem for such manifolds as well as a gap theorem in terms of the ..."
Abstract - Cited by 4 (0 self) - Add to MetaCart
§0 Introduction. In this paper we will prove a Liouville theorem on smooth plurisubharmonic functions on a complete noncompact Kähler manifold with nonnegative bisectional curvature. Using this Liouville theorem we prove a splitting theorem for such manifolds as well as a gap theorem in terms of the curvature decay of such a manifold.
(Show Context)

Citation Context

...is it is easy to see that u α ¯ β(x) ≡ 0. By applying the gradient estimate of Cheng-Yau [C-Y] and the fact that u satisfies (2.14), we know that u is a constant. Remarks. 1. There is a result by Cao =-=[Co2]-=- related to the splitting phenomena in the above proof. Cao has told the second author that using the Kähler-Ricci flow he has proved that if M is a complete noncompact simply connected Kähler manifol...

LIST OF TABLES.................................... v

by Lei Ding, Lei Ding, Marzia Rosati, Jianwei Qiu, Chunhui Chen, Klaus Schmidt-rohr , 2013
"... Measurement of heavy flavor electron flow in Au + Au collisions at sqrt(sNN) = 62.4 GeV ..."
Abstract - Add to MetaCart
Measurement of heavy flavor electron flow in Au + Au collisions at sqrt(sNN) = 62.4 GeV
(Show Context)

Citation Context

...t wave and the energy loss model. 6.3.1 Comparison to the Energy Loss Based Model Fig. 6.10 shows the comparison between our results and the theoretical curves calculated in a energy loss based model =-=[55]-=-. The theoretical predictions are calculated in the framework of a modified Langevin equation [56] coupled to a (2+1)-dimensional viscous hydrodynamic model [57]. The classical Langevin approach is im...

Ricci Solitons on Sasakian Manifolds

by Chenxu He, Meng Zhu , 2011
"... ..."
Abstract - Add to MetaCart
Abstract not found

SIMPLICIAL RICCI FLOW

by Warner A. Miller, Jonathan R. Mcdonald, Paul M. Alsing, David Gu, Shing-tung Yau , 2013
"... ..."
Abstract - Add to MetaCart
Abstract not found

Ferromagnetism in a Realistic Two-Band Model: ∗ A Slave-Boson Study

by Raymond Frésard, Mathieu Lamboley , 2001
"... Using a slave boson representation of multi-band Hubbard models, we investigate a two-band model relevant to layered perovskites in the vicinity of half-filling. Beside the strong influence of the Hund’s rule coupling, we obtain that the phase diagram separates into two regions: a weak to moderate c ..."
Abstract - Add to MetaCart
Using a slave boson representation of multi-band Hubbard models, we investigate a two-band model relevant to layered perovskites in the vicinity of half-filling. Beside the strong influence of the Hund’s rule coupling, we obtain that the phase diagram separates into two regions: a weak to moderate coupling region where the effective mass is weakly renormalized, and a strong coupling regime where it is strongly renormalized. The transition between these two regimes is very sharp. It takes place in a (vanishingly) small domain. A ferromagnetic instability in only found in the strongly correlated regime, and is triggered by the Hund’s rule coupling. The results are compared to La-doped layered ruthenates. PACS numbers: 71.10.Fd, 71.30.h, 74.70.Pq, 75.30.Kz. 1.
(Show Context)

Citation Context

...amiltonian: Hint = U ∑ + U1 i,σ,ρ ′ <ρ ni,ρ,σni,ρ ′ ,σ ∑ i,ρ ′ ni,ρ,↑ni,ρ =ρ ′ ∑ ,↓ + U3 i,ρ ni,ρ,↑ni,ρ,↓ , (4) where σ (ρ) is a spin (band) index. The relation between the coefficients Un ≡ U + nJH =-=(5)-=- holds for perfect cubic symmetry 17,18 , otherwise one should work with the matrix elements F0, F2, and F4 19 . In the following we nevertheless stick to the minimal model using the relation Eq. (5)....

1Degree Fluctuations and the Convergence Time of Consensus Algorithms

by Alex Olshevsky, John N. Tsitsiklis
"... We consider a consensus algorithm in which every node in a sequence of undirected, B-connected graphs assigns equal weight to each of its neighbors. Under the assumption that the degree of each node is fixed (except for times when the node has no connections to other nodes), we show that consensus i ..."
Abstract - Add to MetaCart
We consider a consensus algorithm in which every node in a sequence of undirected, B-connected graphs assigns equal weight to each of its neighbors. Under the assumption that the degree of each node is fixed (except for times when the node has no connections to other nodes), we show that consensus is achieved within a given accuracy on n nodes in time B+4n3Bln(2n/). Because there is a direct relation between consensus algorithms in time-varying environments and inhomogeneous random walks, our result also translates into a general statement on such random walks. Moreover, we give a simple proof of a result of Cao, Spielman, and Morse that the worst case convergence time becomes exponentially large in the number of nodes n under slight relaxation of the degree constancy assumption. I.
(Show Context)

Citation Context

... degree sequence (say, in non-increasing order) is independent of t (thus allowing nodes to “swap” degrees), exponential convergence time is possible. While this fact was known (although unpublished) =-=[5]-=-, our contribution is to provide a simple proof. In summary: for connected bidirectional graphs with self-loops, unchanging degrees is a sufficient condition for polynomial time convergence, but relax...

Conductivity of Dirac fermions with phonon induced topological crossover

by Zhou Li, J. P. Carbotte , 2013
"... ar ..."
Abstract - Add to MetaCart
Abstract not found

Longitudinal and spin/valley Hall optical conductivity in single layer MoS2

by Zhou Li, J. P. Carbotte , 2014
"... ar ..."
Abstract - Add to MetaCart
Abstract not found
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2016 The Pennsylvania State University