Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where R. J. Williams is active.

Publication


Featured researches published by R. J. Williams.


IEEE Transactions on Automatic Control | 2001

Stabilization of stochastic nonlinear systems driven by noise of unknown covariance

Hua Deng; Miroslav Krstic; R. J. Williams

This paper poses and solves a new problem of stochastic (nonlinear) disturbance attenuation where the task is to make the system solution bounded by a monotone function of the supremum of the covariance of the noise. This is a natural stochastic counterpart of the problem of input-to-state stabilization in the sense of Sontag (1989). Our development starts with a set of new global stochastic Lyapunov theorems. For an exemplary class of stochastic strict-feedback systems with vanishing nonlinearities, where the equilibrium is preserved in the presence of noise, we develop an adaptive stabilization scheme (based on tuning functions) that requires no a priori knowledge of a bound on the covariance. Next, we introduce a control Lyapunov function formula for stochastic disturbance attenuation. Finally, we address optimality and solve a differential game problem with the control and the noise covariance as opposing players; for strict-feedback systems the resulting Isaacs equation has a closed-form solution.


Stochastics and Stochastics Reports | 1987

Brownian Models of Open Queueing Networks with Homogeneous Customer Populations

J. M. Harrison; R. J. Williams

We consider a family of multidimensional diffusion processes that arise as heavy traffic approximations for open queueing networks. More precisely, the diffusion processes considered here arise as approximate models of open queueing networks with homogeneous customer populations, which means that customers occupying any given node or station of the network are essentially indistinguishable from one another. The classical queueing network model of J. R. Jackson fits this description, as do other more general types of systems, but multiclass network models do not.The objectives of this paper are (a) to explain in concrete terms how one approximates a conventional queueing model or a real physical system by a corresponding Brownian model, and (b) to state and prove some new results regarding stationary distributions of such Brownian models. The part of the paper aimed at objective (a) is largely a recapitulation of previous work on weak convegence theorems, with the emphasis placed on modeling intuition. Wit...


Queueing Systems | 1998

Diffusion approximations for open multiclass queueing networks: sufficient conditions involving state space collapse

R. J. Williams

Certain diffusion processes known as semimartingale reflecting Brownian motions (SRBMs) have been shown to approximate many single class and some multiclass open queueing networks under conditions of heavy traffic. While it is known that not all multiclass networks with feedback can be approximated in heavy traffic by SRBMs, one of the outstanding challenges in contemporary research on queueing networks is to identify broad categories of networks that can be so approximated and to prove a heavy traffic limit theorem justifying the approximation. In this paper, general sufficient conditions are given under which a heavy traffic limit theorem holds for open multiclass queueing networks with head-of-the-line (HL) service disciplines, which, in particular, require that service within each class is on a first-in-first-out (FIFO) basis. The two main conditions that need to be verified are that (a) the reflection matrix for the SRBM is well defined and completely- S, and (b) a form of state space collapse holds. A result of Dai and Harrison shows that condition (a) holds for FIFO networks of Kelly type and their proof is extended here to cover networks with the HLPPS (head-of-the-line proportional processor sharing) service discipline. In a companion work, Bramson shows that a multiplicative form of state space collapse holds for these two families of networks. These results, when combined with the main theorem of this paper, yield new heavy traffic limit theorems for FIFO networks of Kelly type and networks with the HLPPS service discipline.


Annals of Applied Probability | 2004

Fluid model for a network operating under a fair bandwidth-sharing policy

F. P. Kelly; R. J. Williams

We consider a model of Internet congestion control that represents the randomly varying number of flows present in a network where bandwidth is shared fairly between document transfers. We study critical fluid models obtained as formal limits under law of large numbers scalings when the average load on at least one resource is equal to its capacity. We establish convergence to equilibria for fluid models and identify the invariant manifold. The form of the invariant manifold gives insight into the phenomenon of entrainment whereby congestion at some resources may prevent other resources from working at their full capacity.


Molecular Systems Biology | 2014

Queueing up for enzymatic processing: correlated signaling through coupled degradation.

Natalie A. Cookson; William Mather; Tal Danino; Octavio Mondragón-Palomino; R. J. Williams; Lev S. Tsimring; Jeff Hasty

High‐throughput technologies have led to the generation of complex wiring diagrams as a post‐sequencing paradigm for depicting the interactions between vast and diverse cellular species. While these diagrams are useful for analyzing biological systems on a large scale, a detailed understanding of the molecular mechanisms that underlie the observed network connections is critical for the further development of systems and synthetic biology. Here, we use queueing theory to investigate how ‘waiting lines’ can lead to correlations between protein ‘customers’ that are coupled solely through a downstream set of enzymatic ‘servers’. Using the E. coli ClpXP degradation machine as a model processing system, we observe significant cross‐talk between two networks that are indirectly coupled through a common set of processors. We further illustrate the implications of enzymatic queueing using a synthetic biology application, in which two independent synthetic networks demonstrate synchronized behavior when common ClpXP machinery is overburdened. Our results demonstrate that such post‐translational processes can lead to dynamic connections in cellular networks and may provide a mechanistic understanding of existing but currently inexplicable links.


Probability Theory and Related Fields | 1988

A boundary property of semimartingale reflecting Brownian motions

M. I. Reiman; R. J. Williams

SummaryWe consider a class of reflecting Brownian motions on the non-negative orthant inRK. In the interior of the orthant, such a process behaves like Brownian motion with a constant covariance matrix and drift vector. At each of the (K-1)-dimensional faces that form the boundary of the orthant, the process reflects instantaneously in a direction that is constant over the face. We give a necessary condition for the process to have a certain semimartingale decomposition, and then show that the boundary processes appearing in this decomposition do not charge the set of times that the process is at the intersection of two or more faces. This boundary property plays an essential role in the derivation (performed in a separate work) of an analytical characterization of the stationary distributions of such semimartingale reflecting Brownian motions.


Probability Theory and Related Fields | 1993

Existence and uniqueness of semimartingale reflecting Brownian motions in an orthant

L. M. Taylor; R. J. Williams

SummaryThis work is concerned with the existence and uniqueness of a class of semimartingale reflecting Brownian motions which live in the non-negative orthant of ℝd. Loosely speaking, such a process has a semimartingale decomposition such that in the interior of the orthant the process behaves like a Brownian motion with a constant drift and covariance matrix, and at each of the (d-1)-dimensional faces that form the boundary of the orthant, the bounded variation part of the process increases in a given direction (constant for any particular face) so as to confine the process to the orthant. For historical reasons, this “pushing” at the boundary is called instantaneous reflection. In 1988, Reiman and Williams proved that a necessary condition for the existence of such a semimartingale reflecting Brownian motion (SRBM) is that the reflection matrix formed by the directions of reflection be completely-L. In this work we prove that condition is sufficient for the existence of an SRBM and that the SRBM is unique in law. It follows from the uniqueness that an SRBM defines a strong Markov process. Our results have potential application to the study of diffusions arising as approximations tomulti-class queueing networks.


Theory of Probability and Its Applications | 1996

Existence and Uniqueness of Semimartingale Reflecting Brownian Motions in Convex Polyhedrons

J. G. Dai; R. J. Williams

We consider the problem of existence and uniqueness of semimartingale reflecting Brownian motions (SRBM’s) in convex polyhedrons. Loosely speaking, such a process has a semimartingale decomposition such that in the interior of the polyhedron the process behaves like a Brownian motion with a constant drift and covariance matrix, and at each of the


Queueing Systems | 1998

An invariance principle for semimartingale reflecting Brownian motions in an orthant

R. J. Williams

(d - 1)


Australian Health Review | 2007

Forecasting Emergency Department presentations

Robert Champion; Leigh Kinsman; Geraldine Lee; Kevin Masman; Elizabeth. May; Terence M. Mills; Michael D. Taylor; Paulett. Thomas; R. J. Williams

-dimensional faces that form the boundary of the polyhedron, the bounded variation part of the process increases in a given direction (constant for any particular face), so as to confine the process to the polyhedron. For historical reasons, this “pushing” at the boundary is called instantaneous reflection. For simple convex polyhedrons, we give a necessary and sufficient condition on the geometric data for the existence and uniqueness of an SRBM. For nonsimple convex polyhedrons, our condition is shown to be sufficient. It is an open question as to whether our condition is also necessary in the nonsimple case. From the uniqueness, it follows that an SRB...

Collaboration


Dive into the R. J. Williams's collaboration.

Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Amber L. Puha

University of California

View shared research outputs
Top Co-Authors

Avatar

Jeff Hasty

University of California

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Zhen-Qing Chen

University of Washington

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Z. Zhao

University of Missouri

View shared research outputs
Top Co-Authors

Avatar

F. P. Kelly

University of Cambridge

View shared research outputs
Researchain Logo
Decentralizing Knowledge