Several recent experiments have established by measuring the Mandel parameter that the number of Rydberg excitations in ultracold gases exhibits sub-Poissonian statistics. This effect is attributed to the Rydberg blockade that occurs due to the strong interatomic interactions between highly excited atoms. Because of this blockade effect, the system can end up in a state in which all particles are either excited or blocked: a jamming limit. We analyze appropriately constructed random-graph models that capture the blockade effect, and derive formulae for the mean and variance of the number of Rydberg excitations in jamming limits. This yields an explicit relationship between the Mandel parameter and the blockade effect, and comparison to measurement data shows strong agreement between theory and experiment.
We identify a relation between the dynamics of ultracold Rydberg gases in which atoms experience a strong dipole blockade and spontaneous emission, and a stochastic process that models certain wireless random-access networks. We then transfer insights and techniques initially developed for these wireless networks to the realm of Rydberg gases, and explain how the Rydberg gas can be driven into crystal formations using our understanding of wireless networks. Finally, we propose a method to determine Rabi frequencies (laser intensities) such that particles in the Rydberg gas are excited with specified target excitation probabilities, providing control over mixed-state populations.
We consider exploration algorithms of the random sequential adsorption type both for homogeneous random graphs and random geometric graphs based on spatial Poisson processes. At each step, a vertex of the graph becomes active and its neighboring nodes become blocked. Given an initial number of vertices N growing to infinity, we study statistical properties of the proportion of explored (active or blocked) nodes in time using scaling limits. We obtain exact limits for homogeneous graphs and prove an explicit central limit theorem for the final proportion of active nodes, known as the jamming constant, through a diffusion approximation for the exploration process which can be described as a unidimensional process. We then focus on bounding the trajectories of such exploration processes on random geometric graphs, i.e., random sequential adsorption. As opposed to exploration processes on homogeneous random graphs, these do not allow for such a dimensional reduction. Instead we derive a fundamental relationship between the number of explored nodes and the discovered volume in the spatial process, and we obtain generic bounds for the fluid limit and jamming constant: bounds that are independent of the dimension of space and the detailed shape of the volume associated to the discovered node. Lastly, using coupling techinques, we give trajectorial interpretations of the generic bounds.
We consider Markovian many-server systems with admission control operating in a Quality-and-Efficiency-Driven (QED) regime, where the relative utilization approaches unity while the number of servers grows large, providing natural Economies-of-Scale. In order to determine the optimal admission control policy, we adopt a revenue maximization framework, and suppose that the revenue rate attains a maximum when no customers are waiting and no servers are idling. When the revenue function scales properly with the system size, we show that a nondegenerate optimization problem arises in the limit. Detailed analysis demonstrates that the revenue is maximized by nontrivial policies that bar customers from entering when the queue length exceeds a certain threshold of the order of the typical square-root level variation in the system occupancy. We identify a fundamental equation characterizing the optimal threshold, which we extensively leverage to provide broadly applicable upper/lower bounds for the optimal threshold, establish its monotonicity, and examine its asymptotic behavior, all for general revenue structures. For linear and exponential revenue structures, we present explicit expressions for the optimal threshold.