Add to ORKGConsider random regular graphs of order n and degree d = d(n) ≥ 3. Let g = g(n) ≥ 3 satisfy (d-1)2g-1 = o(n). Then the number of cycles of lengths up to g have a distribution similar to that of independent Poisson variables. In particular, we find th
... There is a variation in which an additional cyclic ordering on the root edges is imposed which m...
Random regular graphs play a central role in combinatorics and theoretical computer science. In this...
Abstract. Let H be a given finite (possibly empty) family of connected graphs, each containing a cyc...
The probability that a random labelled r-regular graph contains a given number of cycles of given le...
ABSTRACT: Random d-regular graphs have been well studied when d is fixed and the number of vertices ...
AbstractLet G(n, p) be a graph on n vertices in which each possible edge is presented independently ...
Let Δ and n be natural numbers such that Δn = 2m is even and Δ ⩽ (2 log n )1/2 - 1. Then as n →, the...
For a graph $G=(V,E)$ with $v(G)$ vertices the partition function of the random cluster model is def...
The distribution of shortest path lengths (DSPL) of random networks provides useful information on t...
Let Δ and n be natural numbers such that Δn = 2m is even and Δ ⩽ (2 log n )1/2 - 1. Then as n →, the...
AbstractThe main aim of this short paper is to answer the following question. Given a fixed graph H,...
We consider the distribution of cycle counts in a random regular graph, which is closely linked to t...
In this paper, we study the cycle distribution of random low-density parity-check (LDPC) codes, rand...
I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, includ...
We present a practical algorithm for generating random regular graphs. For all d growing as a small ...
... There is a variation in which an additional cyclic ordering on the root edges is imposed which m...
Random regular graphs play a central role in combinatorics and theoretical computer science. In this...
Abstract. Let H be a given finite (possibly empty) family of connected graphs, each containing a cyc...
The probability that a random labelled r-regular graph contains a given number of cycles of given le...
ABSTRACT: Random d-regular graphs have been well studied when d is fixed and the number of vertices ...
AbstractLet G(n, p) be a graph on n vertices in which each possible edge is presented independently ...
Let Δ and n be natural numbers such that Δn = 2m is even and Δ ⩽ (2 log n )1/2 - 1. Then as n →, the...
For a graph $G=(V,E)$ with $v(G)$ vertices the partition function of the random cluster model is def...
The distribution of shortest path lengths (DSPL) of random networks provides useful information on t...
Let Δ and n be natural numbers such that Δn = 2m is even and Δ ⩽ (2 log n )1/2 - 1. Then as n →, the...
AbstractThe main aim of this short paper is to answer the following question. Given a fixed graph H,...
We consider the distribution of cycle counts in a random regular graph, which is closely linked to t...
In this paper, we study the cycle distribution of random low-density parity-check (LDPC) codes, rand...
I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, includ...
We present a practical algorithm for generating random regular graphs. For all d growing as a small ...
... There is a variation in which an additional cyclic ordering on the root edges is imposed which m...
Random regular graphs play a central role in combinatorics and theoretical computer science. In this...
Abstract. Let H be a given finite (possibly empty) family of connected graphs, each containing a cyc...