Resolvent of large random graphs
نویسندگان
چکیده
منابع مشابه
Resolvent of large random graphs
We analyze the convergence of the spectrum of large random graphs to the spectrum of a limit infinite graph. We apply these results to graphs converging locally to trees and derive a new formula for the Stieljes transform of the spectral measure of such graphs. We illustrate our results on the uniform regular graphs, Erdös-Renyi graphs and preferential attachment graphs. We sketch examples of a...
متن کاملLaws of Large Numbers for Random Linear
The computational solution of large scale linear programming problems contains various difficulties. One of the difficulties is to ensure numerical stability. There is another difficulty of a different nature, namely the original data, contains errors as well. In this paper, we show that the effect of the random errors in the original data has a diminishing tendency for the optimal value as the...
متن کاملLarge Forbidden Trade Volumes of Random Graphs
Let G be a graph. A G-trade of volume m is a pair (T , T ′), where each of T and T ′ consists of m graphs, pairwise edge-disjoint, isomorphic to G, such that T ∩T ′ = ∅ and the union of the edge sets of the graphs in T is identical to the union of the edge sets of the graphs in T ′. Let X(G) be the set of non-negative integers m such that no G-trade of volume m exists. In this paper we prove th...
متن کاملEmbedding large graphs into a random graph
In this paper we consider the problem of embedding bounded degree graphs which are almost spanning in a random graph. In particular, let ∆ ≥ 5 and let H be a graph on (1−o(1))n vertices and with maximum degree ∆. We show that a random graph Gn,p with high probability contains a copy of H, provided that p (n−1 log n). Our assumption on p is optimal (including the powers in the log term) with res...
متن کاملLarge Cliques in Sparse Random Intersection Graphs
Given positive integers n and m, and a probability measure P on {0, 1, . . . ,m}, the random intersection graph G(n,m,P ) on vertex set V = {1, 2, . . . , n} and with attribute set W = {w1, w2, . . . , wm} is defined as follows. Let S1, S2, . . . , Sn be independent random subsets of W such that for any v ∈ V and any S ⊆ W we have P(Sv = S) = P (|S|)/ ( m |S| ) . The edge set of G(n,m,P ) consi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Random Structures & Algorithms
سال: 2010
ISSN: 1042-9832
DOI: 10.1002/rsa.20313