Related papers: (k,m)-connectivity in Mobile Clustered Wireless Ne…
Organization, scalability and routing have been identified as key problems hindering viability and commercial success of mobile ad hoc networks. Clustering of mobile nodes among separate domains has been proposed as an efficient approach to…
We construct a connected network of 3.9 million nodes from mobile phone call records, which can be regarded as a proxy for the underlying human communication network at the societal level. We assign two weights on each edge to reflect the…
A complex contagion is an infectious process in which individuals may require multiple transmissions before changing state. These are used to model behaviors if an individual only adopts a particular behavior after perceiving a consensus…
Random walks serve as important tools for studying complex network structures, yet their dynamics in cases where transition probabilities are not static remain under explored and poorly understood. Here we study nonlinear random walks that…
In this paper, we analyze the exact asymptotic behavior of the connectivity probability in a random binomial bipartite graph $G(n,m,p)$ under various regimes of the edge probability $p=p(n)$. To determine this probability, a method based on…
We identify the asymptotic probability of a configuration model $\mathrm{CM}_n(\boldsymbol{d})$ to produce a connected graph within its critical window for connectivity that is identified by the number of vertices of degree 1 and 2, as well…
We investigate the use of discrete-time quantum walks to sample from an almost-uniform distribution, in the absence of any external source of randomness. Integers are encoded on the vertices of a cycle graph, and a quantum walker evolves…
Apart from the role the clustering coefficient plays in the definition of the small-world phenomena, it also has great relevance for practical problems involving networked dynamical systems. To study the impact of the clustering coefficient…
In [1], the authors consider a random walk $(Z_{n,1},\ldots,Z_{n,K+1})\in \mathbb{Z}^{K+1}$ with the constraint that each coordinate of the walk is at distance one from the following one. A functional central limit theorem for the first…
We consider the problem of capacitated kinetic clustering in which $n$ mobile terminals and $k$ base stations with respective operating capacities are given. The task is to assign the mobile terminals to the base stations such that the…
Modelling the propagation of a pulse in a dense {\em milieu} poses fundamental challenges at the theoretical and applied levels. To this aim, in this paper we generalize the telegraph equation to non-ideal conditions by extending the…
We study a class of non-reversible, continuous-time random walks in random environments on $\mathbb{Z}^d$ that admit a cycle representation with finite cycle length. The law of the transition rates, taking values in $[0, \infty)$, is…
One limiting factor to the performance of mobile ad-hoc networks is the amount of interference that is experienced by each node. In this paper we use the Random Waypoint Mobility Model (RWPM) to represent such a network of mobile devices,…
Dynamic functional connectivity (dFC) is ubiquitously observed in the brain, but why functional networks should remain dynamic even at rest is unclear. We asked whether temporal reconfiguration becomes advantageous when keeping a functional…
Studying the capacity of wireless multi-hop networks is an important problem and extensive research has been done in the area. In this letter, we sift through various capacity-impacting parameters and show that the capacity of both static…
Let $X_1, X_2, \ldots$ be i.i.d. random variables with values in $\mathbb{Z}^d$ satisfying $\mathbb{P} \left(X_1=x\right) = \mathbb{P} \left(X_1=-x\right) = \Theta \left(\|x\|^{-s}\right)$ for some $s>d$. We show that the random walk…
We analyze fading interference relay networks where M single-antenna source-destination terminal pairs communicate concurrently and in the same frequency band through a set of K single-antenna relays using half-duplex two-hop relaying.…
We analyze a special class of 1-D quantum walks (QWs) realized using optical multi-ports. We assume non-perfect multi-ports showing errors in the connectivity, i.e. with a small probability the multi- ports can connect not to their nearest…
The identification of the most influential spreaders in networks is important to control and understand the spreading capabilities of the system as well as to ensure an efficient information diffusion such as in rumor-like dynamics. Recent…
An important problem in wireless sensor networks is to find the minimal number of randomly deployed sensors making a network connected with a given probability. In practice sensors are often deployed one by one along a trajectory of a…