Related papers: Random Information Spread in Networks
We find Gaussian cutoff profiles for the total variation distance to stationarity of a random walk on a multiplex network: a finite number of directed configuration models sharing a vertex set, each with its own bounded degree distribution…
The multicast capacity of a directed network is closely related to the $s$-$t$ maximum flow, which is equal to the $s$-$t$ minimum cut capacity due to the max-flow min-cut theorem. If the topology of a network (or link capacities) is…
A circulant graph H is defined on the set of vertices V=\left\{ 1,\ldots,n\right\} and edges E=\left\{ \left(i,j\right):\left|i-j\right|\equiv s\left(\textrm{mod}n\right),s\in S\right\} , where S\subseteq\left\{…
Random geometric graphs are a popular choice for a latent points generative model for networks. Their definition is based on a sample of $n$ points $X_1,X_2,\cdots,X_n$ on the Euclidean sphere~$\mathbb{S}^{d-1}$ which represents the latent…
We introduce a process where a connected rooted multigraph evolves by splitting events on its vertices, occurring randomly in continuous time. When a vertex splits, its incoming edges are randomly assigned between its offspring and a…
For a random graph on n vertices where the edges appear with individual rates, we give exact formulas for the expected time at which the number of components has gone down to k and the expected length of the corresponding minimal spanning…
We are interested in modeling networks in which the connectivity among the nodes and node attributes are random variables and interact with each other. We propose a probabilistic model that allows one to formulate jointly a probability…
We conjecture that the distribution of the edge-disjoint union of two random regular graphs on the same vertex set is asymptotically equivalent to a random regular graph of the combined degree, provided it grows as the number of vertices…
Spatial networks are networks where nodes are located in a space equipped with a metric. Typically, the space is two-dimensional and until recently and traditionally, the metric that was usually considered was the Euclidean distance. In…
We consider a stochastic directed graph on the integers whereby a directed edge between $i$ and a larger integer $j$ exists with probability $p_{j-i}$ depending solely on the distance between the two integers. Under broad conditions, we…
Each vertex of an arbitrary simple graph on $n$ vertices chooses $k$ random incident edges. What is the expected number of edges in the original graph that connect different connected components of the sampled subgraph? We prove that the…
We study epidemic spreading processes in large networks, when the spread is assisted by a small number of external agents: infection sources with bounded spreading power, but whose movement is unrestricted vis-\`a-vis the underlying network…
In this paper we propose a distributed algorithm for the estimation and control of the connectivity of ad-hoc networks in the presence of a random topology. First, given a generic random graph, we introduce a novel stochastic power…
In source routing, a complete path is chosen for a packet to travel from source to destination. While computing the time to traverse such a path may be straightforward in a fixed, static graph, doing so becomes much more challenging in…
We prove new results on lazy random walks on finite graphs. To start, we obtain new estimates on return probabilities $P^t(x,x)$ and the maximum expected hitting time $t_{\rm hit}$, both in terms of the relaxation time. We also prove a…
Graphlets are induced subgraph patterns that are crucial to the understanding of the structure and function of a large network. A lot of efforts have been devoted to calculating graphlet statistics where random walk based approaches are…
In this paper, the question of expected time to convergence is addressed for unbiased quantized consensus on undirected connected graphs, and some strong results are obtained. The paper first provides a tight expression for the expected…
We consider simple random walk on a realization of an Erd\H{o}s-R\'enyi graph that is asymptotically almost surely (a.a.s.) connected. We show a Central Limit Theorem (CLT) for the average starting hitting time, i.e. the expected time it…
The paper presents fault-tolerant (FT) labeling schemes for general graphs, as well as, improved FT routing schemes. For a given $n$-vertex graph $G$ and a bound $f$ on the number of faults, an $f$-FT connectivity labeling scheme is a…
We consider the discrete-time threshold-$\theta \ge 2$ contact process on a random r-regular graph on n vertices. In this process, a vertex with at least \theta occupied neighbors at time t will be occupied at time t+1 with probability p,…