Related papers: The multi-level friendship paradox for sparse rand…

Mixing patterns in large self-organizing networks, such as the Internet, the World Wide Web, social and biological networks are often characterized by degree-degree {dependencies} between neighbouring nodes. One of the problems with the…

In this paper, we consider the problem of testing the equality of two multivariate distributions based on geometric graphs constructed using the interpoint distances between the observations. These include the tests based on the minimum…

We consider the following problem: let $n>k$ be natural numbers, and let $G$ be a graph on $n$ vertices (undirected, without loops or multiple edges). Denote by $h_k(G)$ the number of unordered pairs of vertices in the graph $G$ whose…

In this paper we study a random graph with $N$ nodes, where node $j$ has degree $D_j$ and $\{D_j\}_{j=1}^N$ are i.i.d. with $\prob(D_j\leq x)=F(x)$. We assume that $1-F(x)\leq c x^{-\tau+1}$ for some $\tau>3$ and some constant $c>0$. This…

We explore the limiting empirical eigenvalue distributions arising from matrices of the form \[A_{n+1} = \begin{bmatrix} A_n & I\\ I & A_n \end{bmatrix} , \]where $A_0$ is the adjacency matrix of a $k$-regular graph. We find that for…

We consider an Erdos-Renyi random graph consisting of N vertices connected by randomly and independently drawing an edge between every pair of them with probability c/N so that at N->infinity one obtains a graph of finite mean degree c. In…

Estimating characteristics of large graphs via sampling is a vital part of the study of complex networks. Current sampling methods such as (independent) random vertex and random walks are useful but have drawbacks. Random vertex sampling…

We are interested in the probability that two randomly selected neighbors of a random vertex of degree (at least) $k$ are adjacent. We evaluate this probability for a power law random intersection graph, where each vertex is prescribed a…

We investigate hide-and-seek games on complex networks using a random walk framework. Specifically, we investigate the efficiency of various degree-biased random walk search strategies to locate items that are randomly hidden on a subset of…

In this thesis, which is supervised by Dr. David Penman, we examine random interval graphs. Recall that such a graph is defined by letting $X_{1},\ldots X_{n},Y_{1},\ldots Y_{n}$ be $2n$ independent random variables, with uniform…

We investigate the distribution of eigenvalues of weighted adjacency matrices from a specific ensemble of random graphs. We distribute $N$ vertices across a fixed number $\kappa$ of components, with asymptotically $\alpha_j \dot N$ vertices…

This paper studies the eigenvalue distribution of the Watts-Strogatz random graph, which is known as the "small-world" random graph. The construction of the small-world random graph starts with a regular ring lattice of n vertices; each has…

A random k-out mapping (digraph) on [n] is generated by choosing k random images of each vertex one at a time, subject to a "preferential attachment" rule: the current vertex selects an image i with probability proportional to a given…

We establish bounds on the spectral radii for a large class of sparse random matrices, which includes the adjacency matrices of inhomogeneous Erd\H{o}s-R\'enyi graphs. Our error bounds are sharp for a large class of sparse random matrices.…

Consider a family of random ordered graph trees $(T_n)_{n\geq 1}$, where $T_n$ has $n$ vertices. It has previously been established that if the associated search-depth processes converge to the normalised Brownian excursion when rescaled…

We prove a $pre$-$asymptotic$ bound on the total variation distance between the uniform distribution over two types of undirected graphs with $n$ nodes. One distribution places a prescribed number of $k_T$ triangles and $k_S$ edges not…

We give upper and lower bounds on the information-theoretic threshold for community detection in the stochastic block model. Specifically, let $k$ be the number of groups, $d$ be the average degree, the probability of edges between vertices…

In a random graph, counts for the number of vertices with given degrees will typically be dependent. We show via a multivariate normal and a Poisson process approximation that, for graphs which have independent edges, with a possibly…

For various purposes and, in particular, in the context of data compression, a graph can be examined at three levels. Its structure can be described as the unlabeled version of the graph; then the labeling of its structure can be added; and…

The friendship paradox -- the observation that, on average, one's friends have more friends than oneself -- admits two common formulations depending on whether averaging is performed over edges or over nodes. These two definitions, the…