Limit Theorem for Spectra of Laplace Matrix of Random Graphs
نویسندگان
چکیده
We consider the limit of empirical spectral distribution Laplace matrices generalized random graphs. Applying Stieltjes transform method, we prove under general conditions that converges to free convolution semicircular law and normal law.
منابع مشابه
Central Limit Theorem in Multitype Branching Random Walk
A discrete time multitype (p-type) branching random walk on the real line R is considered. The positions of the j-type individuals in the n-th generation form a point process. The asymptotic behavior of these point processes, when the generation size tends to infinity, is studied. The central limit theorem is proved.
متن کاملLimit Theorem for Sums of Random Products
We study asymptotic behavior of the sums ZN,m(β) determined by the formula ZN,m(β) = N
متن کاملon the spectra of reduced distance matrix of thorn graphs
let g be a simple connected graph and {v1, v2, …, vk} be the set of pendent (vertices ofdegree one) vertices of g. the reduced distance matrix of g is a square matrix whose (i,j)–entry is the topological distance between vi and vj of g. in this paper, we obtain the spectrumof the reduced distance matrix of thorn graph of g, a graph which obtained by attaching somenew vertices to pendent vertice...
متن کاملDirac's theorem for random graphs
A classical theorem of Dirac from 1952 asserts that every graph on n vertices with minimum degree at least dn/2e is Hamiltonian. In this paper we extend this result to random graphs. Motivated by the study of resilience of random graph properties we prove that if p log n/n, then a.a.s. every subgraph ofG(n, p) with minimum degree at least (1/2+o(1))np is Hamiltonian. Our result improves on prev...
متن کاملMantel's Theorem for random graphs
For a graph G, denote by t(G) (resp. b(G)) the maximum size of a triangle-free (resp. bipartite) subgraph of G. Of course t(G) ≥ b(G) for any G, and a classic result of Mantel from 1907 (the first case of Turán’s Theorem) says that equality holds for complete graphs. A natural question, first considered by Babai, Simonovits and Spencer about 20 years ago is, when (i.e. for what p = p(n)) is the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2023
ISSN: ['2227-7390']
DOI: https://doi.org/10.3390/math11030764