相关论文: On the Average Number of Edges in Theta Graphs
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…
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…
Theta-graphs are a type of spatial graph with two vertices connected by three edges. We investigate embeddings of theta-graphs in the square and simple cubic lattices, using a combination of the Wang-Landau Monte Carlo method with a variant…
We characterise the form of all simple, finite graphs for which the girth of the graph is equal to the circumference of the graph. We apply this to prove a bound on the number of edges in such a graph.
Models for generating simple graphs are important in the study of real-world complex networks. A well established example of such a model is the erased configuration model, where each node receives a number of half-edges that are connected…
This paper investigates the number of random edges required to add to an arbitrary dense graph in order to make the resulting graph hamiltonian with high probability. Adding $\Theta(n)$ random edges is both necessary and sufficient to…
Recently, Bollob\'as, Janson and Riordan introduced a family of random graph models producing inhomogeneous graphs with $n$ vertices and $\Theta(n)$ edges whose distribution is characterized by a kernel, i.e., a symmetric measurable…
In this thesis we consider ordered graphs (that is, graphs with a fixed linear ordering on their vertices). We summarize and further investigations on the number of edges an ordered graph may have while avoiding a fixed forbidden ordered…
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…
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…
Complex systems, ranging from soft materials to wireless communication, are often organised as random geometric networks in which nodes and edges evenly fill up the volume of some space. Studying such networks is difficult because they…
The exponential family of random graphs represents an important and challenging class of network models. Despite their flexibility, conventionally used exponential random graphs have one shortcoming. They cannot directly model weighted…
We organize a table of regular graphs with minimal diameters and minimal mean path lengths, large bisection widths and high degrees of symmetries, obtained by enumerations on supercomputers. These optimal graphs, many of which are newly…
We show that if a graph contains few induced copies of a given graph then its edges are distribited unevenly.
Let $[\mathcal{P}]$ be the points of a Poisson process on $\mathbb{R}^d$ and $F$ a probability distribution with support on the non-negative integers. Models are formulated for generating translation invariant random graphs with vertex set…
We consider the number of common edges in two independent random spanning trees of a graph $G$. For complete graphs $K_n$, we give a new proof of the fact, originally obtained by Moon, that the distribution converges to a Poisson…
The object of study is a soft random geometric graph with vertices given by a Poisson point process on a line and edges between vertices present with probability that has a polynomial decay in the distance between them. Various aspects of…
Consider a stationary Poisson point process in $\mathbb{R}^d$ and connect any two points whenever their distance is less than or equal to a prescribed distance parameter. This construction gives rise to the well known random geometric…
Graphs are used in many disciplines to model the relationships that exist between objects in a complex discrete system. Researchers may wish to compare a network of interest to a "typical" graph from a family (or ensemble) of graphs which…
For an angle $\alpha\in (0,\pi)$, we consider plane graphs and multigraphs in which the edges are either (i) one-bend polylines with an angle $\alpha$ between the two edge segments, or (ii) circular arcs of central angle $2(\pi-\alpha)$. We…