Self-avoiding random walk: A Brownian motion model with local time drift

Summary A natural model for a self-avoiding Brownian motion inR ^d, when specialised and simplified tod=1, becomes the stochastic differential equation , where {L(t, x):t0,xR} is the local time process ofX. ThoughX is not Markovian, an analogue of the Ray-Knight theorem holds for {L(,x):xR}, which allows one to prove in many cases of interest that exists almost surely, and to identify the limit.     

Sharpness of the phase transition in percolation models

The equality of two critical points — the percolation thresholdp _H and the pointp _T where the cluster size distribution ceases to decay exponentially — is proven for all translation invariant independent percolation models on homogeneousd-dimensional lattices (d1). The analysis is based on a pair of new nonlinear partial differential inequalities for an order parameterM(,h), which forh=0 reduces to the percolation densityP — at the bond densityp=1–e ^– in the single parameter case. These are: (1)MhM/h+M ²+MM/, and (2) M/|J|MM/h. Inequality (1) is intriguing in that its derivation provides yet another hint of a ³ structure in percolation models. Moreover, through the elimination of one of its derivatives, (1) yields a pair of ordinary differential inequalities which provide information on the critical exponents and . One of these resembles an Ising model inequality of Fröhlich and Sokal and yields the mean field bound 2, and the other implies the result of Chayes and Chayes that . An inequality identical to (2) is known for Ising models, where it provides the basis for Newman's universal relation and for certain extrapolation principles, which are now made applicable also to independent percolation. These results apply to both finite and long range models, with or without orientation, and extend to periodic and weakly inhomogeneous systems.Research supported in part by the NSF Grant PHY-8605164Also in the Physics Department     

Multiqueue System with Non-Exhaustive Cyclic Service Modelled as a Linear-Programming Problem

In modern processor-controlled systems, it is common to find a central processor polling a number of message queues, where at most one message is processed from each queue during one polling cycle. This paper shows how one important parameter can be estimated quickly, namely the cycle-time distribution. This is the distribution of times taken for the cyclic server to perform one complete cycle in its continuous scan of a number of queues. The method of solution is to identify various constraints which will determine the cycle-time distribution, formulate them as linear inequality and equality constraints and, by determining an appropriate objective function, apply the simplex method to find upper and lower bounds on the values taken by the cycle-time distribution itself. A great strength of this technique is its overall simplicity, which enables it to be used to obtain important results very quickly and cheaply.     

Comparing ordered-entry queues with heterogeneous servers

We study a queueing system withm exponential servers with distinct service rates. Jobs arrive at the system following an arbitrary point process. Arrived jobs receive service at the first unoccupied server (if any) according to an entry order , which is a permutation of the integers 1, 2,...,m. The system has a finite buffer capacity. When the buffer limit is reached, arrivals will be blocked. Blocked jobs will either be lost or come back as New arrivals after a random travel time. We are concerned with the dynamic stochastic behavior of the system under different entry orders. A partial ordering is established among entry orders, and is shown to result in some quite strong orderings among the associated stochastic processes that reflect the congestion and the service characteristics of the system. The results developed here complement existing comparison results for queues with homogeneous servers, and can be applied to aid the design of conveyor and communication systems.     

Further evidence for magnetic charge from meson spectroscopy

Recently evidence was presented for the existence of magnetic charge from Zeeman splitting in meson states. The model by Akers predicted the existence of a new meson at 1814 MeV withI ^G(J ^PC )=0⁺(0^–+). Experimental evidence for this new meson is cited and discussed.     

On the periodic points of a two-parameter family of maps of the plane

We study the dynamics of a two-parameter family of noninvertible maps of the plane, derived from a model in population dynamics. We prove that, as one parameter varies with the other held fixed, the nonwandering set changes from the empty set to an unstable Cantor set on which the map is topologically equivalent to the shift endomorphism on two symbols. With the help of some numerical work, we trace the genealogies of the periodic points of the family of period 5, and describe their stability types and bifurcations. Among our results we find that the family has a fixed point which undergoes fold, flip and Hopf bifurcations, and that certain families of period five points are interconnected through a codimension-two cusp bifurcation.     

Racemization barriers of 1,1'-binaphthyl and 1,1'-binaphthalene-2,2'-diol: a DFT study

Density functional theory has been applied to the study of various pathways and transition states for the configurational inversion of 1,1'-binaphthyl (1) and 1,1'-binaphthalene-2,2'-diol (2). The preferred pathway is found to be anti with centrosymmetric transition state. Whereas the reaction path of 1 goes downhill from transition to ground state, in the case of 2 it contains one unexpected local minimum. Very satisfactory agreement with available experimental values of activation Gibbs energies is achieved.