Related papers: A Density-Delay Law for Stable Event-Driven State …
The decay of a moving system is studied in case the system is initially prepared in a two-mass unstable quantum state. The survival probability $\mathcal{P}_p(t)$ is evaluated over short and long times in the reference frame where the…
This paper considers a distributed stochastic optimization problem where the goal is to minimize the time average of a cost function subject to a set of constraints on the time averages of a related stochastic processes called penalties. We…
In this paper we propose and analyze a distributed algorithm for achieving globally optimal decisions, either estimation or detection, through a self-synchronization mechanism among linearly coupled integrators initialized with local…
Spreading on networks is influenced by a number of factors including different parts of the inter-event time distribution (IETD), the topology of the network and non-stationarity. In order to understand the role of these factors we study…
A substantial portion of distributed computing research is dedicated to terminating problems like consensus and similar agreement problems. However, non-terminating problems have been intensively studied in the context of self-stabilizing…
This thesis addresses the question of stability of systems defined by differential equations which contain nonlinearity and delay. In particular, we analyze the stability of a well-known delayed nonlinear implementation of a certain…
The key challenges in design of predictor-based control laws for switched systems with arbitrary switching and long input delay are the potential unavailability of the future values of the switching signal (at current time) and the fact…
Distributed optimization finds applications in large-scale machine learning, data processing and classification over multi-agent networks. In real-world scenarios, the communication network of agents may encounter latency that may affect…
A project schedule contains a network of activities, the activity durations, the early and late finish dates for each activity, and the associated total float or slack times, the difference between the late and early dates. Here I show that…
Owing to the influence of real-world networks both in science and society, numerous mathematical models have been developed to understand the structure and evolution of these systems, particularly in a temporal context. Recent advancements…
This paper presents a characterization of distributed controllers subject to delay constraints induced by a strongly connected communication graph that achieve a prescribed closed loop $\mathcal{H}_\infty$ norm. Inspired by the solution to…
Time-invariant finite-dimensional systems, under reasonable continuity assumptions, exhibit the property that if solutions exist for all future times, the set of vectors reachable from a bounded set of initial conditions over bounded time…
An ab-initio numerical study of the density-dependent, evolutionary stable dispersal strategy is presented. The simulations are based on a simple discretei generation island model with four processes: reproduction, dispersal, competition…
Timely and efficient dissemination of server status is critical in compute-first networking systems, where user tasks arrive dynamically and computing resources are limited and stochastic. In such systems, the access point plays a key role…
Robustness of routing policies for networks is a central problem which is gaining increased attention with a growing awareness to safeguard critical infrastructure networks against natural and man-induced disruptions. Routing under limited…
Systems whose time evolutions are entirely deterministic can nevertheless be studied probabilistically, i.e. in terms of the evolution of probability distributions rather than individual trajectories. This approach is central to the…
We study the long-time behavior of the probability density associated with the decoupled continuous-time random walk which is characterized by a superheavy-tailed distribution of waiting times. It is shown that if the random walk is…
Threshold rules of spreading in binary-state networks lead to cascades. We study persistent cascade-recovery dynamics on quasi-robust networks, i.e., networks which are robust against small trigger but may collapse for larger one. It is…
A model for the evolution of a large population interacting system is considered in which a marked Poisson processes influences their evolution, together with a Brownian motion. Mean field McKean-Vlasov limits of such system are formulated…
Due to the presence of buffers in the inner network nodes, each congestion event leads to buffer queueing and thus to an increasing end-to-end delay. In the case of delay sensitive applications, a large delay might not be acceptable and a…