Related papers: Space-time large deviations in capacity-constraine…
This paper considers the fixed-time control problem of a multi-agent system composed of a class of Euler-Lagrange dynamics with parametric uncertainty and a dynamic leader under a directed communication network. A distributed fixed-time…
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…
The problem of multicasting multiple messages with the help of a relay, which may also have an independent message of its own to multicast, is considered. As a first step to address this general model, referred to as the compound multiple…
We study the effects of nonzero time delays in stochastic synchronization problems with linear couplings in complex networks. We consider two types of time delays: transmission delays between interacting nodes and local delays at each node…
In real-world networks the interactions between network elements are inherently time-delayed. These time-delays can not only slow the network but can have a destabilizing effect on the network's dynamics leading to poor performance. The…
The intense demands for higher data rates and ubiquitous network coverage have raised the stakes on developing new network topology and architecture to meet these ever-increasing demands in a cost-effective manner. The telecommunication…
Current is a characteristic feature of nonequilibrium systems. In stochastic systems, these currents exhibit fluctuations constrained by the rate of dissipation in accordance with the recently discovered thermodynamic uncertainty relation.…
We consider a collection of weakly interacting diffusion processes moving in a two-scale locally periodic environment. We study the large deviations principle of the empirical distribution of the particles' positions in the combined limit…
We investigate the problem of disseminating broadcast messages in wireless networks with time-varying links from a percolation-based perspective. Using a model of wireless networks based on random geometric graphs with dynamic on-off links,…
We show that subsets of interacting oscillators may synchronize in different ways within a single network. This diversity of synchronization patterns is promoted by increasing the heterogeneous distribution of coupling weights and/or…
In this paper, the secrecy performance of a cooperative relay network with outdated relay selection is investigated where an eavesdropper intercepts the channels between the source and the destination. The best relay is chosen among N…
In this paper, a class of relay networks is considered. We assume that, at a node, outgoing channels to its neighbors are orthogonal, while incoming signals from neighbors can interfere with each other. We are interested in the multicast…
The relay broadcast channel (RBC) is considered, in which a transmitter communicates with two receivers with the assistance of a relay. Based on different degradation orders among the relay and the receivers' outputs, three types of…
We study the effect of time evolution on galaxy bias. We argue that at any order in perturbations, the galaxy density contrast can be expressed in terms of a finite set of locally measurable operators made of spatial and temporal…
We investigate the dynamics of a broad class of stochastic copying processes on a network that includes examples from population genetics (spatially-structured Wright-Fisher models), ecology (Hubbell-type models), linguistics (the utterance…
We consider arbitrary dense wireless networks, in which $n$ nodes are placed in an arbitrary (deterministic) manner on a square region of unit area and communicate with each other over Gaussian fading channels. We provide inner and outer…
Given a network of fixed size $n$ and an initial distribution of data, we derive sufficient connectivity conditions on a sequence of time-varying digraphs for (a) data collection and (b) data dissemination, within at most $(n-1)$…
Most social, technological and biological networks are embedded in a finite dimensional space, and the distance between two nodes influences the likelihood that they link to each other. Indeed, in social systems, the chance that two…
We present here a system with collection of random walks relaying a signal in one dimension in the presence of delays. We are interested in the time for a signal to travel from one end (start) to the other end (finish) of the lined group of…
Small-world networks are networks in which the graphical diameter of the network is as small as the diameter of random graphs but whose nodes are highly clustered when compared with the ones in a random graph. Examples of small-world…