Related papers: Degree distributions in AB random geometric graphs
We define and study the statistical models in exponential family form whose sufficient statistics are the degree distributions and the bi-degree distributions of undirected labelled simple graphs. Graphs that are constrained by the joint…
It is widely believed that the Internet's AS-graph degree distribution obeys a power-law form. Most of the evidence showing the power-law distribution is based on BGP data. However, it was recently argued that since BGP collects data in a…
In this paper, we give an analytic solution for graphs with n nodes and E edges for which the probability of obtaining a given graph G is specified in terms of the degree sequence of G. We describe how this model naturally appears in the…
We study the properties of random graphs where for each vertex a {\it neighbourhood} has been previously defined. The probability of an edge joining two vertices depends on whether the vertices are neighbours or not, as happens in Small…
Given a Poisson process on a bounded interval, its random geometric graph is the graph whose vertices are the points of the Poisson process and edges exist between two points if and only if their distance is less than a fixed given…
In coverage-oriented networks, base stations (BSs) are deployed in a way such that users at the cell boundaries achieve sufficient signal strength. The shape and size of cells vary from BS to BS, since the large-scale signal propagation…
We study connected graphs with a fixed degree sequence, in the sparse setting where the number of edges grows linearly in the number of vertices. Using the relation to the configuration model, we identify the number of such connected graphs…
Consider a network where all nodes are distributed on a unit square following a Poisson distribution with known density $\rho$ and a pair of nodes separated by an Euclidean distance $x$ are directly connected with probability…
This paper derives Gaussian approximation bounds for the standardized aggregate wireless interference (AWI) in the downlink of K-tier heterogeneous cellular networks when base stations in each tier are distributed over the plane according…
Let $\mathbb{G}^{D}$ be the set of graphs $G(V,\, E)$ with $\left|V\right|=n$, and the degree sequence equal to $D=(d_{1},\, d_{2},\,\dots,\, d_{n})$. In addition, for $\frac{1}{2}<a<1$, we define the set of graphs with an almost given…
Suppose in a graph $G$ vertices can be either red or blue. Let $k$ be odd. At each time step, each vertex $v$ in $G$ polls $k$ random neighbours and takes the majority colour. If it doesn't have $k$ neighbours, it simply polls all of them,…
In this paper we consider a well-known generalization of the Barab\'asi and Albert preferential attachment model - the Buckley-Osthus model. Buckley and Osthus proved that in this model the degree sequence has a power law distribution. As a…
Consider a graph on randomly scattered points in an arbitrary space, with two points $x,y$ connected with probability $\phi(x,y)$. Suppose the number of points is large but the mean number of isolated points is $O(1)$. We give general…
A new random geometric graph model, the so-called secrecy graph, is introduced and studied. The graph represents a wireless network and includes only edges over which secure communication in the presence of eavesdroppers is possible. The…
This paper studies the information-theoretic secrecy performance in large-scale cellular networks based on a stochastic geometry framework. The locations of both base stations and mobile users are modeled as independent two-dimensional…
Perturbations made to networked systems may result in partial structural loss, such as a blackout in a power-grid system. Investigating the resultant disturbance in network properties is quintessential to understand real networks in action.…
We study the number of isolated nodes in a soft random geometric graph whose vertices constitute a Poisson process on the torus of length L (the line segment [0,L] with periodic boundary conditions), and where an edge is present between two…
Degree-based graph construction is an ubiquitous problem in network modeling, ranging from social sciences to chemical compounds and biochemical reaction networks in the cell. This problem includes existence, enumeration, exhaustive…
Exponential random graphs are important to model the structure of real-world complex networks. Here we solve the two-star model with degree-degree correlations in the sparse regime. The model constraints the average correlation between the…
We study a family of directed random graphs whose arcs are sampled independently of each other, and are present in the graph with a probability that depends on the attributes of the vertices involved. In particular, this family of models…