The random graph with arbitrary degree distribution
Wages and Employment in a Random Social Network with Arbitrary Degree Distribution
... Residual or within-group inequality, which has notably increased for the United States in the 1980s and 1990s, has been attributed to search frictions, inter alia. Such frictions may cause otherwise identical workers to ...
16
Wages and Employment in a Random Social Network with Arbitrary Degree Distribution
... specific degree distributions that are likely to emerge. An advantage of random graph models is that they may relate observed characteristics of a network to specific underlying degree ...
54
Random Graph-Homomorphisms and Logarithmic Degree
... A graph homomorphism from a graph G to a graph H is a map from the vertex set of G to the vertex set of H, that maps edges to ...a graph homomorphism from G to the infinite line ...of ...
25
Modularity and anti-modularity in networks with arbitrary degree distribution
... the graph growth model that we studied ...edge distribution, for example, given the input parameters, in the limit of infi- nite network ...asymptotic degree distribution for a pure ...
25
Degree distribution in random planar graphs
... average degree of the vertices is 2 κ ≈ 4 ...planar graph has a linear number of vertices of degree k, for each k ...of degree k is asymptotically d k n, for computable constants d k ...
29
Degree distribution in random planar graphs
... 5.1 Simple quadrangulations A rooted quadrangulation is a planar map where every face is a quadrangle, and with a distinguished directed edge of the external face, which is called the root edge of the quadrangulation. ...
33
Eigenvalue Distribution of a Large Weighted Bipartite Random Graph
... a graph with N vertices, one can associate with it many different matrices, but the most studied are the adjacency matrix and the Laplacian matrix of the ...
16
Cover time of a random graph with given degree sequence
... the random walk is more likely to get closer to v at the next ...with random walk on [− a , a ] where there is a unique value x < a such that only at ± x is the walk more likely to move towards the ...
18
The scaling window for a random graph with a given degree sequence
... inhomogeneous random graphs in which the expected degree sequence exhibits a power ...geneous random graph is one in which the edges be- tween pairs of vertices are chosen independently, but ...
9
The distribution of second degrees in the Buckley Osthus random graph model
... a random graph process analogous to one suggested by Barab´ asi and ...the degree of ...the degree sequence has a power law ...second degree of a vertex is the number of vertices at ...
30
Testable bounded degree graph properties are random order streamable
... solve graph problems with space o(n), possibly even log O (1) n or ...in random order, i.e. in the order of a uniformly random permutation of the edges ...Uniformly random or near-uniformly ...
15
Random Intersection Graphs with Tunable Degree Distribution and Clustering
... Erd˝os-R´enyi graph will not do a good job as a network model, since the degrees are asymptotically Poisson ...given degree distribution – see ...so-called random intersection graph, ...
14
Convergence to the Tracy-Widom distribution for longest paths in a directed random graph
... directed graph on the 2-dimensional integer lattice, plac- ing a directed edge from vertex (i 1 , i 2 ) to (j 1 , j 2 ), whenever i 1 ≤ j 1 , i 2 ≤ j 2 , with probability p, independently for each such pair of ...
20
The number and degree distribution of spanning trees in the Tower of Hanoi graph
... a graph is an important invariant re- lated to topological and dynamic properties of the graph, such as its reliability, communication aspects, synchronization, and so ...and degree ...
20
Copies of a rooted weighted graph attached to an arbitrary weighted graph and applications
... Denote by σ (C) the multiset of eigenvalues of a square matrix C. 2. A result on the spectrum of M (R {H}). Let E be the matrix of order n × n with 1 in the (n, n) −entry and zeros elsewhere. For i = 1, 2, . . . , r, let ...
12
Degree distribution of random Apollonian network structures and Boltzmann sampling
... traditional graph theory is not sufficient for the study of these real-life networks, in particular random graphs have very different properties than the networks under ...of random network models ...
12
X How to Schedule a Cascade in an Arbitrary Graph
... Now, suppose that consumers make purchasing decisions one at a time, starting from m Y = m N = 0, and each new consumer who arrives is a Y -type with probability p > 0 and an N -type with probability 1−p > 0. The ...
12
Asymptotics in directed exponential random graph models with an increasing bi degree sequence
... Establishing the uniform consistency and asymptotic normality of the MLE are the aims of this paper. To the best of our knowledge, it is the first time that such results are derived in directed exponential random ...
28
Random polymers on the complete graph
... co-variant distribution for the polymer ...complete graph and follow a totally asymmetric stable law of index α ∈ (0, ...a random walk and we show that the height function is distributed around this ...
23
On a sparse random graph with minimum degree three: Likely Posa s sets are large.
... Now if a graph G is not too sparse, one may expect that the not-too-large vertex sets A are sufficiently expanding, so that |N (A)| ≥ 2|A|. If that is the case, then it follows from P´ osa’s Lemma that |S| has to ...
35