Related papers: Information transmission bounds between moving ter…
Traffic flows in a distributed computing network require both transmission and processing, and can be interdicted by removing either communication or computation resources. We study the robustness of a distributed computing network under…
We introduce a constrained optimal transport problem where origins $x$ can only be transported to destinations $y\geq x$. Our statistical motivation is to describe the sharp upper bound for the variance of the treatment effect $Y-X$ given…
In this paper we carry out a computational study of a novel microscopic follow-the-leader model for traffic flow on road networks. We assume that each driver has its own origin and destination, and wants to complete its journey in minimal…
We consider a scheme for offloading the delivery of contents to mobile devices in a vehicular networking scenario. Each content can be delivered to the requesting device either by a neighboring device or, at the expiration of a maximum…
We consider the problem of optimizing heat transport through an incompressible fluid layer. Modeling passive scalar transport by advection-diffusion, we maximize the mean rate of total transport by a divergence-free velocity field. Subject…
Internet of Things (IoT) devices and applications are generating and communicating vast quantities of data, and the rate of data collection is increasing rapidly. These high communication volumes are challenging for energy-constrained,…
This paper proposes networked dynamics to solve resource allocation problems over time-varying multi-agent networks. The state of each agent represents the amount of used resources (or produced utilities) while the total amount of resources…
We introduce a new, "worst-case" model for an asynchronous communication network and investigate the simplest (yet central) task in this model, namely the feasibility of end-to-end routing. Motivated by the question of how successful a…
We consider the problem of sending a message from a sender $s$ to a receiver $r$ through an unreliable network by specifying in a protocol what each vertex is supposed to do if it receives the message from one of its neighbors. A protocol…
We demonstrate the feasibility of end-to-end communication in highly unreliable networks. Modeling a network as a graph with vertices representing nodes and edges representing the links between them, we consider two forms of unreliability:…
Interference alignment allows multiple users to share the same frequency and time resource in a wireless communications system. At present, two performance bounds, in terms of degree of freedom, have been proposed. One is for…
Consider a device that is connected to an edge processor via a communication channel. The device holds local data that is to be offloaded to the edge processor so as to train a machine learning model, e.g., for regression or classification.…
The reachability analysis of recursive programs that communicate asynchronously over reliable FIFO channels calls for restrictions to ensure decidability. Our first result characterizes communication topologies with a decidable reachability…
We develop a general method to bound the spreading of an entire wavepacket under Schr\"odinger dynamics from above. This method derives upper bounds on time-averaged moments of the position operator from lower bounds on norms of transfer…
Optimal transport theory, originally developed in the 18th century for civil engineering, has since become a powerful optimization framework across disciplines, from generative AI to cell biology. In physics, it has recently been shown to…
An information measure based on fractional partitions of a set is used to derive a general dependence balance inequality for communication. This inequality is used to obtain new upper bounds on reliable and secret rates for multiterminal…
We propose new Lieb-Robinson bounds (bounds on the speed of propagation of information in quantum systems) with an explicit dependence on the interaction strengths of the Hamiltonian. For systems with more than two interactions it is found…
The various wireless networks have made the ambient radio frequency signals around the world. Wireless information and power transfer enables the devices to recycle energy from these ambient radio frequency signals and process information…
In ad hoc wireless networking, units are connected to each other rather than to a central, fixed, infrastructure. Constructing and maintaining such networks create several trade-off problems between robustness, communication speed, power…
We propose a universal analysis for static routings on networks and describe the congestion characteristics by the theory. The relation between average transmission time and transmission capacity is described by inequality T0Rc0<=1. For…