Related papers: Throughput and Delay in Random Wireless Networks w…
This paper studies regulated state synchronization of discrete-time homogeneous networks of non-introspective agents in presence of unknown non-uniform input delays. A scale free protocol is designed based on additional information…
It has been alleged in several papers that the so called delayed continuous-time random walks (DCTRWs) provide a model for the one-dimensional telegraph equation at microscopic level. This conclusion, being widespread now, is strange, since…
Recently, De Martino et al have presented a general framework for the study of transportation phenomena on complex networks. One of their most significant achievements was a deeper understanding of the phase transition from the uncongested…
In this paper, we focus on the scheduling problem in multi-channel wireless networks, e.g., the downlink of a single cell in fourth generation (4G) OFDM-based cellular networks. Our goal is to design practical scheduling policies that can…
This paper considers the time evolution of a queue that is embedded in a Poisson point process of moving wireless interferers. The queue is driven by an external arrival process and is subject to a time-varying service process that is a…
The use of existing network devices as relays has a potential to improve the overall network performance. In this work, we consider a two-hop wireless relay setting, where the channels between the source and relay nodes to the destination…
Graph-limit theory focuses on the convergence of sequences of graphs when the number of nodes becomes arbitrarily large. This framework defines a continuous version of graphs allowing for the study of dynamical systems on very large graphs,…
We analyze the problem of scheduling in wireless networks to meet end-to-end service guarantees, defined by instantaneous throughput and hard packet deadlines. Using a network slicing model to decouple the queueing dynamics between flows,…
This paper proposes a dynamic primal-dual type algorithm to solve the optimal scheduling problem in wireless networks subject to uncertain parameters, which are generated by stochastic network processes such as random packet arrivals,…
Many biological, social, and communication systems can be modeled by ``searchers'' moving through a complex network. For example, intracellular cargo is transported on tubular networks, news and rumors spread through online social networks,…
We study the random walk problem on a class of deterministic Scale-Free networks displaying a degree sequence for hubs scaling as a power law with an exponent $\gamma=\log 3/\log2$. We find exact results concerning different first-passage…
In this article, we first give a comprehensive description of random walk (RW) problem focusing on self-similarity, dynamic scaling and its connection to diffusion phenomena. One of the main goals of our work is to check how robust the RW…
We study a minimal model of traffic flows in complex networks, simple enough to get analytical results, but with a very rich phenomenology, presenting continuous, discontinuous as well as hybrid phase transitions between a free-flow phase…
In arbitrary spatial dimension $d\ge 1$, we study a generalized model of random walks in a time-varying random environment (RWRE) defined by a stochastic flow of kernels. We consider the quenched probability distribution of the random…
Many real-world scale-free networks, such as neural networks and online communication networks, consist of a fixed number of nodes but exhibit dynamic edge fluctuations. However, traditional models frequently overlook scenarios where the…
We consider the single-file dynamics of $N$ identical random walkers moving with diffusivity $D$ in one dimension (walkers bounce off each other when attempting to overtake). Additionally, we require that the separation between neighboring…
This investigation is motivated by a result we proved recently for the random transposition random walk: the distance from the starting point of the walk has a phase transition from a linear regime to a sublinear regime at time $n/2$. Here,…
Wireless network applications, such as, searching, routing, self stabilization and query processing can be modeled as random walks on graphs. Stateless Opportunistic routing technique is a robust distributed routing technique based on…
While steady-state solutions of backlog and delay have been derived for essential wireless systems, the analysis of transient phases still poses significant challenges. Considering the majority of short-lived and interactive flows,…
Strong, scale-free disorder disrupts typical transport properties like the Stokes-Einstein relation and linear response, leading to anomalous, non-diffusive motion observed in amorphous materials, glasses, living cells, and other systems.…