اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدPageRank on inhomogeneous random digraphs
284
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We study the typical behavior of a generalized version of Googles PageRank algorithm on a large family of inhomogeneous random digraphs. This family includes as special cases direct
قيم البحث
اقرأ أيضاً
We study a family of directed random graphs whose arcs are sampled independently of each other, and are present in the graph with a probability that depends on the attributes of the vertices involved. In particular, this family of models includes as special cases the direct
We study random digraphs on sequences of expanders with bounded average degree and weak local limit. The threshold for the existence of a giant strongly connected component, as well as the asymptotic fraction of nodes with giant fan-in or giant fan-o
ut are local, in the sense that they are the same for two sequences with the same weak local limit. The digraph has a bow-tie structure, with all but a vanishing fraction of nodes lying either in the unique strongly connected giant and its fan-in and fan-out, or in sets with small fan-in and small fan-out. All local quantities are expressed in terms of percolation on the limiting rooted graph, without any structural assumptions on the limit, allowing, in particular, for non tree-like limits. In the course of proving these results, we prove that for unoriented percolation, there is a unique giant above criticality, whose size and critical threshold are again local. An application of our methods shows that the critical threshold for bond percolation and random digraphs on preferential attachment graphs is $p_c=0$, with an infinite order phase transition at $p_c$.
The voter model is a classical interacting particle system modelling how consensus is formed across a network. We analyse the time to consensus for the voter model when the underlying graph is a subcritical scale-free random graph. Moreover, we gener
alise the model to include a `temperature parameter. The interplay between the temperature and the structure of the random graph leads to a very rich phase diagram, where in the different phases different parts of the underlying geometry dominate the time to consensus. Finally, we also consider a discursive voter model, where voters discuss their opinions with their neighbours. Our proofs rely on the well-known duality to coalescing random walks and a detailed understanding of the structure of the random graphs.
A bootstrap percolation process on a graph G is an infection process which evolves in rounds. Initially, there is a subset of infected nodes and in each subsequent round every uninfected node which has at least r infected neighbours becomes infected
and remains so forever. The parameter r > 1 is fixed. We consider this process in the case where the underlying graph is an inhomogeneous random graph whose kernel is of rank 1. Assuming that initially every vertex is infected independently with probability p > 0, we provide a law of large numbers for the number of vertices that will have been infected by the end of the process. We also focus on a special case of such random graphs which exhibit a power-law degree distribution with exponent in (2,3). The first two authors have shown the existence of a critical function a_c(n) such that a_c(n)=o(n) with the following property. Let n be the number of vertices of the underlying random graph and let a(n) be the number of the vertices that are initially infected. Assume that a set of a(n) vertices is chosen randomly and becomes externally infected. If a(n) << a_c(n), then the process does not evolve at all, with high probability as n grows, whereas if a(n)>> a_c(n), then with high probability the final set of infected vertices is linear. Using the techniques of the previous theorem, we give the precise asymptotic fraction of vertices which will be eventually infected when a(n) >> a_c (n) but a(n) = o(n). Note that this corresponds to the case where p approaches 0.
We characterize the tail behavior of the distribution of the PageRank of a uniformly chosen vertex in a directed preferential attachment graph and show that it decays as a power law with an explicit exponent that is described in terms of the model pa
rameters. Interestingly, this power law is heavier than the tail of the limiting in-degree distribution, which goes against the commonly accepted {em power law hypothesis}. This deviation from the power law hypothesis points at the structural differences between the inbound neighborhoods of typical vertices in a preferential attachment graph versus those in static random graph models where the power law hypothesis has been proven to hold (e.g., directed configuration models and inhomogeneous random digraphs). In addition to characterizing the PageRank distribution of a typical vertex, we also characterize the explicit growth rate of the PageRank of the oldest vertex as the network size grows.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
