اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدA note on the component structure in random intersection graphs with tunable clustering
95
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We study the component structure in random intersection graphs with tunable clustering, and show that the average degree works as a threshold for a phase transition for the size of the largest component. That is, if the expected degree is less than one, the size of the largest component is a.a.s. of logarithmic order, but if the average degree is greater than one, a.a.s. a single large component of linear order emerges, and the size of the second largest component is at most of logarithmic order.
قيم البحث
اقرأ أيضاً
In this paper, a branching process approximation for the spread of a Reed-Frost epidemic on a network with tunable clustering is derived. The approximation gives rise to expressions for the epidemic threshold and the probability of a large outbreak i
n the epidemic. It is investigated how these quantities varies with the clustering in the graph and it turns out for instance that, as the clustering increases, the epidemic threshold decreases. The network is modelled by a random intersection graph, in which individuals are independently members of a number of groups and two individuals are linked to each other if and only if they share at least one group.
We consider a large class of random geometric graphs constructed from samples $mathcal{X}_n = {X_1,X_2,ldots,X_n}$ of independent, identically distributed observations of an underlying probability measure $ u$ on a bounded domain $Dsubset mathbb{R}^d
$. The popular `modularity clustering method specifies a partition $mathcal{U}_n$ of the set $mathcal{X}_n$ as the solution of an optimization problem. In this paper, under conditions on $ u$ and $D$, we derive scaling limits of the modularity clustering on random geometric graphs. Among other results, we show a geometric form of consistency: When the number of clusters is a priori bounded above, the discrete optimal partitions $mathcal{U}_n$ converge in a certain sense to a continuum partition $mathcal{U}$ of the underlying domain $D$, characterized as the solution of a type of Kelvins shape optimization problem.
Let $mathbb{G}=left(mathbb{V},mathbb{E}right)$ be the graph obtained by taking the cartesian product of an infinite and connected graph $G=(V,E)$ and the set of integers $mathbb{Z}$. We choose a collection $mathcal{C}$ of finite connected subgraphs o
f $G$ and consider a model of Bernoulli bond percolation on $mathbb{G}$ which assigns probability $q$ of being open to each edge whose projection onto $G$ lies in some subgraph of $mathcal{C}$ and probability $p$ to every other edge. We show that the critical percolation threshold $p_{c}left(qright)$ is a continuous function in $left(0,1right)$, provided that the graphs in $mathcal{C}$ are well-spaced in $G$ and their vertex sets have uniformly bounded cardinality. This generalizes a recent result due to Szabo and Valesin.
We consider oriented long-range percolation on a graph with vertex set $mathbb{Z}^d times mathbb{Z}_+$ and directed edges of the form $langle (x,t), (x+y,t+1)rangle$, for $x,y$ in $mathbb{Z}^d$ and $t in mathbb{Z}_+$. Any edge of this form is open wi
th probability $p_y$, independently for all edges. Under the assumption that the values $p_y$ do not vanish at infinity, we show that there is percolation even if all edges of length more than $k$ are deleted, for $k$ large enough. We also state the analogous result for a long-range contact process on $mathbb{Z}^d$.
We study a generalisation of the random recursive tree (RRT) model and its multigraph counterpart, the uniform directed acyclic graph (DAG). Here, vertices are equipped with a random vertex-weight representing initial inhomogeneities in the network,
so that a new vertex connects to one of the old vertices with a probability that is proportional to their vertex-weight. We first identify the asymptotic degree distribution of a uniformly chosen vertex for a general vertex-weight distribution. For the maximal degree, we distinguish several classes that lead to different behaviour: For bounded vertex-weights we obtain results for the maximal degree that are similar to those observed for RRTs and DAGs. If the vertex-weights have unbounded support, then the maximal degree has to satisfy the right balance between having a high vertex-weight and being born early. For vertex-weights in the Frechet maximum domain of attraction the first order behaviour of the maximal degree is random, while for those in the Gumbel maximum domain of attraction the leading order is deterministic. Surprisingly, in the latter case, the second order is random when considering vertices in a compact window in the optimal region, while it becomes deterministic when considering all vertices.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
