Spectral density of the non-backtracking operator on random graphs
نویسندگان
چکیده
منابع مشابه
Spectral density of the non-backtracking operator
The non-backtracking operator was recently shown to provide a significant improvement when used for spectral clustering of sparse networks. In this paper we analyze its spectral density on large random sparse graphs using a mapping to the correlation functions of a certain interacting quantum disordered system on the graph. On sparse, tree-like graphs, this can be solved efficiently by the cavi...
متن کاملCutoff for non-backtracking random walks on sparse random graphs
Reduced `-cohomology in degree 1 (for short "LpR1") is a useful quasiisometry invariant of graphs [of bounded valency] whose definition is relatively simple. On a graph, there is a natural gradient operator from functions to vertices to functions on edges defined by looking at the difference of the value on the extremities of the edge. Simply put, this cohomology is the quotient of functions wi...
متن کاملthe effect of traffic density on the accident externality from driving the case study of tehran
در این پژوهش به بررسی اثر افزایش ترافیک بر روی تعداد تصادفات پرداخته شده است. به این منظور 30 تقاطع در شهر تهران بطور تصادفی انتخاب گردید و تعداد تصادفات ماهیانه در این تقاطعات در طول سالهای 89-90 از سازمان کنترل ترافیک شهر تهران استخراج گردید و با استفاده از مدل داده های تابلویی و نرم افزار eviews مدل خطی و درجه دوم تخمین زده شد و در نهایت این نتیجه حاصل شد که تقاطعات پر ترافیک تر تعداد تصادفا...
15 صفحه اولNon-backtracking Random Walks and Cogrowth of Graphs
Let X be a locally finite, connected graph without vertices of degree 1. Non-backtracking random walk moves at each step with equal probability to one of the “forward” neighbours of the actual state, i.e., it does not go back along the preceding edge to the preceding state. This is not a Markov chain, but can be turned into a Markov chain whose state space is the set of oriented edges of X . Th...
متن کاملCommunity Detection with the Non-Backtracking Operator
Community detection consists in identification of groups of similar items within a population. In the context of online social networks, it is a useful primitive for recommending either contacts or news items to users. We will consider a particular generative probabilistic model for the observations, namely the so-called stochastic block model and prove that the non-backtracking operator provid...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: EPL (Europhysics Letters)
سال: 2014
ISSN: 0295-5075,1286-4854
DOI: 10.1209/0295-5075/107/50005