Long paths in random Apollonian networks

We consider the length $L(n)$ of the longest path in a randomly generated Apollonian Network (ApN) ${\cal A}_n$. We show that w.h.p. $L(n)\leq ne^{-\log^cn}$ for any constant $c<2/3$

Vacant sets and vacant nets: Component structures induced by a random walk

Given a discrete random walk on a finite graph $G$, the vacant set and vacant net are, respectively, the sets of vertices and edges which remain unvisited by the walk at a given step $t$.%These sets induce subgraphs of the underlying graph. Let $\Gamma(t)$ be the subgraph of $G$ induced by the vacant set of the walk at step $t$. Similarly, let $\widehat \Gamma(t)$ be the subgraph of $G$ induced by the edges of the vacant net. For random $r$-regular graphs $G_r$, it was previously established that for a simple random walk, the graph $\Gamma(t)$ of the vacant set undergoes a phase transition in the sense of the phase transition on Erd\H{os}-Renyi graphs $G_{n,p}$. Thus, for $r \ge 3$ there is an explicit value $t^*=t^*(r)$ of the walk, such that for $t\leq (1-\epsilon)t^*$, $\Gamma(t)$ has a unique giant component, plus components of size $O(\log n)$, whereas for $t\geq (1+\epsilon)t^*$ all the components of $\Gamma(t)$ are of size $O(\log n)$. We establish the threshold value $\widehat t$ for a phase transition in the graph $\widehat \Gamma(t)$ of the vacant net of a simple random walk on a random $r$-regular graph. We obtain the corresponding threshold results for the vacant set and vacant net of two modified random walks. These are a non-backtracking random walk, and, for $r$ even, a random walk which chooses unvisited edges whenever available. This allows a direct comparison of thresholds between simple and modified walks on random $r$-regular graphs. The main findings are the following: As $r$ increases the threshold for the vacant set converges to $n \log r$ in all three walks. For the vacant net, the threshold converges to $rn/2 \; \log n$ for both the simple random walk and non-backtracking random walk. When $r\ge 4$ is even, the threshold for the vacant net of the unvisited edge process converges to $rn/2$, which is also the vertex cover time of the process.Comment: Added results pertaining to modified walk

The height of random kk-trees and related branching processes

We consider the height of random k-trees and k-Apollonian networks. These random graphs are not really trees, but instead have a tree-like structure. The height will be the maximum distance of a vertex from the root. We show that w.h.p. the height of random k-trees and k-Apollonian networks is asymptotic to clog t, where t is the number of vertices, and c=c(k) is given as the solution to a transcendental equation. The equations are slightly different for the two types of process. In the limit as k-->oo the height of both processes is asymptotic to log t/(k log 2)

The coalescing-branching random walk on expanders and the dual epidemic process

Information propagation on graphs is a fundamental topic in distributed computing. One of the simplest models of information propagation is the push protocol in which at each round each agent independently pushes the current knowledge to a random neighbour. In this paper we study the so-called coalescing-branching random walk (COBRA), in which each vertex pushes the information to $k$ randomly selected neighbours and then stops passing information until it receives the information again. The aim of COBRA is to propagate information fast but with a limited number of transmissions per vertex per step. In this paper we study the cover time of the COBRA process defined as the minimum time until each vertex has received the information at least once. Our main result says that if $G$ is an $n$-vertex $r$-regular graph whose transition matrix has second eigenvalue $\lambda$, then the COBRA cover time of $G$ is $\mathcal O(\log n )$, if $1-\lambda$ is greater than a positive constant, and $\mathcal O((\log n)/(1-\lambda)^3))$, if $1-\lambda \gg \sqrt{\log( n)/n}$. These bounds are independent of $r$ and hold for $3 \le r \le n-1$. They improve the previous bound of $O(\log^2 n)$ for expander graphs. Our main tool in analysing the COBRA process is a novel duality relation between this process and a discrete epidemic process, which we call a biased infection with persistent source (BIPS). A fixed vertex $v$ is the source of an infection and remains permanently infected. At each step each vertex $u$ other than $v$ selects $k$ neighbours, independently and uniformly, and $u$ is infected in this step if and only if at least one of the selected neighbours has been infected in the previous step. We show the duality between COBRA and BIPS which says that the time to infect the whole graph in the BIPS process is of the same order as the cover time of the COBRA proces

Viral processes by random walks on random regular graphs

We study the SIR epidemic model with infections carried by $k$ particles making independent random walks on a random regular graph. Here we assume $k\leq n^{\epsilon}$, where $n$ is the number of vertices in the random graph, and $\epsilon$ is some sufficiently small constant. We give an edge-weighted graph reduction of the dynamics of the process that allows us to apply standard results of Erd\H{o}s-R\'{e}nyi random graphs on the particle set. In particular, we show how the parameters of the model give two thresholds: In the subcritical regime, $O(\ln k)$ particles are infected. In the supercritical regime, for a constant $\beta\in(0,1)$ determined by the parameters of the model, $\beta k$ get infected with probability $\beta$, and $O(\ln k)$ get infected with probability $(1-\beta)$. Finally, there is a regime in which all $k$ particles are infected. Furthermore, the edge weights give information about when a particle becomes infected. We exploit this to give a completion time of the process for the SI case.Comment: Published in at http://dx.doi.org/10.1214/13-AAP1000 the Annals of Applied Probability (http://www.imstat.org/aap/) by the Institute of Mathematical Statistics (http://www.imstat.org