random graphs
Exceptional Rotations of Random Graphs: A VC Theory
... complex random structures from their typical ...high-dimensional random graph process and ask analogous questions to those of Vapnik and Chervonenkis for deviations of averages: how “rich” does the process ...
30
Cliques in dense in homogeneous random graphs
... Inhomogeneous random graphs allow one to express different intensities of bonds between the corresponding parts of the base ...sparse random graphs G (n, p n ...
41
Group walk random graphs
... In recent years, many models of geometric random graphs have been emerg- ing [14, 18]. The idea now is to embed the set of vertices (possibly randomly) into a geometric space —usually the euclidean or ...
14
ON PERCOLATION IN RANDOM GRAPHS WITH GIVEN VERTEX DEGREES
... related random graph ...the random graphs that we consider, not seen a detailed proof of it in the literature, so for completeness we provide one in Appendix ...
35
Ensemble nonequivalence in random graphs with modular structure
... bi-partite random graphs [55], [30] has shown that ensemble nonequivalence can manifest itself via an additional, novel mechanism, unrelated to non-additivity or phase transitions: namely, the presence of ...
36
Hyperbolic Random Graphs: Separators and Treewidth
... hyperbolic random graphs have whp treewidth O(n 1−α ), O(log 2 n), and O(log n) if α < 1, α = 1, and α > 1, ...hyperbolic random graphs ...hyperbolic random graphs can whp ...
16
HyGen: generating random graphs with hyperbolic communities
... synthetic graphs. Typically random graph generators are generating graphs that satisfy certain global criteria, such as degree distribution or ...a random graph generator that leverages the ...
25
Taxonomy Induction Using Hierarchical Random Graphs
... In this paper we have presented a novel method for automatically inducing lexical taxonomies based on Hierarchical Random Graphs. The approach is con- ceptually simple, taking a graph representation as ...
11
Random walks, effective resistance and neighbourhood statistics in binomial random graphs
... on graphs have also received a lot of attention throughout the last century [2, 57, ...of random walks [23], there is also a close connection to spectral properties ...a random walk on the group [9]. ...
142
Metastability for Glauber dynamics on random graphs
... In this paper, we study metastable behaviour at low temperature of Glauber spin–flip dynamics on random graphs. We fix a large number of ver- tices and randomly allocate edges according to the configuration ...
29
From Random Graphs to Complex Networks:
... Then, in chapter 5, one of the first models to analyze real world networks was presented, the small-world model. It put its focus on high clustering coefficient and small diameter. A simplified version of this model, ...
87
Random Walk Kernels and Learning Curves for Gaussian Process Regression on Random Graphs
... As a final qualitative comparison between globally and locally normalised kernels, Figure 9 shows the variance of local posterior variances. This measures how much the local Bayes error typically varies from ...
35
The asymptotic variance of the giant component of configuration model random graphs
... Many graphs observed in the social sciences, epidemiology and computing do not have a Poisson (vertex) degree distribution, although the Erd¨os-R´enyi random graph provides a useful representation of the ...
39
The Maximum Label Propagation Algorithm on Sparse Random Graphs
... in random graphs with planted communities if the graphs are very dense, by converging to a different consensus for each ...sparse graphs if the degrees are at least C log ...
15
PERCOLATION AND RANDOM GRAPHS
... Inhomogeneous random graphs. The simplest imaginable random graph is the so-called Erd˝ os-R´ enyi random graph, which consists of n vertices and each of the n(n − 1)/2 edges is present or ...
74
Sampling random colorings of sparse random graphs
... The first results in this context were by Dyer et al. [7] who proved rapid mixing of an associated block dynamics when k = Ω(log log n/ log log log n). A significant improvement was made by Mossel and Sly [30] who ...
14
Critical random graphs : limiting constructions and distributional properties
... studying random graphs with fixed surplus or with a fixed ...breadth-first random walk “along the trees of a core edge” converges to reflected Brownian ...
35
Random sampling of colourings of sparse random graphs with a constant number of colours
... For a graph G = (V, E), a (proper) k-colouring is an assignment σ : V → [k] such that adjacent vertices receive different colours, where for some positive integer k, [k] indicates the set {1, . . . , k}. It is well known ...
30
ON THE EVOLUTION OF RANDOM GRAPHS by P. ERDŐS and A. RÉNYI. Introduction
... the presence in rn N of subgraphs of a given type (trees, cycles of given order, complete subgraphs etc .) further for certain global properties of the graph (connectedness, total number[r] ...
45
A mixture model for random graphs
... The instructor (group 2) finally leaved the club and started another one with about one half the members (corresponding to group 3?)... Selection of the number of groups.[r] ...
22