We study the small X behavior of the ground state energy, E(h), of the Hamiltonian -(@/dx") + hV(x). In particular, if V(x) N -ax? at infinity and if s V(x)dx -r 0, we prove that (-E(h))1/2 = -[ah + aXgIn A] S&V(x) + 0(X2).
On the number of equilibrium states in weakly coupled random networks
β Scribed by Akira Date; Chii-Ruey Hwang; Shuenn-Jyi Sheu
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 93 KB
- Volume
- 49
- Category
- Article
- ISSN
- 0167-7152
No coin nor oath required. For personal study only.
β¦ Synopsis
A fully interconnected network consisting of n elements with outputs x = {xi; xi = +1; -1; 16i6n}; connection weights wij = w s ij + cw a ij composed of symmetric and antisymmetric parts, and dynamics described by x β {sign( wijxj)} is considered. Here the {w s ij ; w a ij ; w kk ; i Β‘ j} are i.i.d. N(0; 1) and
The asymptotic behavior of the expected number of the equilibrium states of the network is studied as n β β.
π SIMILAR VOLUMES
We study the unique bound state which (-d2/dx2) + hV and -A + XV (in two dimensions) have when A is small and V is suitable. Our main results give necessary and sufficient conditions for there to be a bound state when h is small and we prove analyticity (resp. nonanalyticity) of the energy eigenvalu
In a previous work we have studied the time evolution of statistical distribution Pn in coupled systems and its transfer from one to the other. Here we modify the Hamiltonian model to obtain also transfer of phase distribution P(Γ). Since number and phase are canonically conjugate operators we hope
Herein, I proposed a model for gene networks and studied the steady states in the dynamics both by numerical and analytical methods. In this model, mRNA and protein levels change continuously with time; each gene alters transcriptional regulation depending on the concentration of transcription facto
We consider random mappings from an n-element set into itself with constraints on coalescence as introduced by Arney and Bender. A local limit theorem for the distribution of the number of predecessors of a random point in such a mapping is presented by using a generating function approach and singu