Zobrazeno 1 - 10
of 993
pro vyhledávání: '"Jones, Nicholas P"'
Autor:
Ghosh, Souradeep, Langlett, Christopher M., Hunter-Jones, Nicholas, Rodriguez-Nieva, Joaquin F.
Quantum states undergoing quantum chaotic dynamics are expected to evolve into featureless states at late times. While this expectation holds true on an average, coarse-grained level, it is unclear if this expectation applies to higher statistical mo
Externí odkaz:
http://arxiv.org/abs/2409.02187
We design and implement two variants of a practical random access protocol called WiFair, based on IEEE 802.11 and designed to mitigate spatial unfairness in Age of Information (AoI). Drawing on previous theoretical work, we modify the mechanics of 8
Externí odkaz:
http://arxiv.org/abs/2408.16120
Autor:
Jones, Nicholas, Modiano, Eytan
We analyze the problem of scheduling in wireless networks to meet end-to-end service guarantees. Using network slicing to decouple the queueing dynamics between flows, we show that the network's ability to meet hard throughput and deadline requiremen
Externí odkaz:
http://arxiv.org/abs/2404.08637
Leveraging advances in machine learning for the robust classification and interpretation of networks
The ability to simulate realistic networks based on empirical data is an important task across scientific disciplines, from epidemiology to computer science. Often simulation approaches involve selecting a suitable network generative model such as Er
Externí odkaz:
http://arxiv.org/abs/2403.13215
Autor:
Mittal, Shivan, Hunter-Jones, Nicholas
We consider random quantum circuits (RQC) on arbitrary connected graphs whose edges determine the allowed $2$-qudit interactions. Prior work has established that such $n$-qudit circuits with local dimension $q$ on 1D, complete, and $D$-dimensional gr
Externí odkaz:
http://arxiv.org/abs/2310.19355
Autor:
Jones, Nicholas, Modiano, Eytan
We analyze Age of Information (AoI) in wireless networks where nodes use a spatially adaptive random access scheme to send status updates to a central base station. We show that the set of achievable AoI in this setting is convex, and design policies
Externí odkaz:
http://arxiv.org/abs/2212.03998
We consider the design of distributed scheduling algorithms that minimize age of information in single-hop wireless networks. The centralized max-weight policy is known to be nearly optimal in this setting; hence, our goal is to design a distributed
Externí odkaz:
http://arxiv.org/abs/2212.03087
Quantum complexity is a measure of the minimal number of elementary operations required to approximately prepare a given state or unitary channel. Recently, this concept has found applications beyond quantum computing -- in studying the dynamics of q
Externí odkaz:
http://arxiv.org/abs/2205.09734
Autor:
Garwood Tyler J., Richards Jessie E., Macchietto Marissa G., Gerhold Richard W., Kania Stephen A., Garbe John R., Fountain-Jones Nicholas M., Larsen Peter A., Wolf Tiffany M.
Publikováno v:
Journal of Nematology, Vol 56, Iss 1, Pp 2114-2120 (2024)
Parelaphostrongylus tenuis causes ungulate morbidity and mortality in eastern and central North America, but no reference genome sequence exists to facilitate research. Here, we present a P. tenuis genome assembly and annotation, generated with PacBi
Externí odkaz:
https://doaj.org/article/071c3d1dad484735817e199700bbff71
We study the distribution over measurement outcomes of noisy random quantum circuits in the low-fidelity regime. We show that, for local noise that is sufficiently weak and unital, correlations (measured by the linear cross-entropy benchmark) between
Externí odkaz:
http://arxiv.org/abs/2111.14907