21 research outputs found
Clustering and Cliques in P.A random graphs with edge insertion
In this paper, we investigate the global clustering coefficient (a.k.a
transitivity) and clique number of graphs generated by a preferential
attachment random graph model with an additional feature of allowing edge
connections between existing vertices. Specifically, at each time step ,
either a new vertex is added with probability , or an edge is added
between two existing vertices with probability . We establish
concentration inequalities for the global clustering and clique number of the
resulting graphs under the assumption that is a regularly varying
function at infinity with index of regular variation , where . We also demonstrate an inverse relation between these two
statistics: the clique number is essentially the reciprocal of the global
clustering coefficient.Comment: arXiv admin note: text overlap with arXiv:1902.1016
Critical Point and Percolation Probability in a Long Range Site Percolation Model on
Consider an independent site percolation model with parameter
on where there are only nearest neighbor bonds and long range
bonds of length parallel to each coordinate axis. We show that the
percolation threshold of such model converges to when goes
to infinity, the percolation threshold for ordinary (nearest neighbour)
percolation on . We also generalize this result for models whose long
range bonds have several lengths.Comment: 5 pages; Acepted in Stochastic Processes and their Applications 201
Decay Properties of the Connectivity for Mixed Long Range Percolation Models on
In this short note we consider mixed short-long range independent bond
percolation models on . Let be the probability that the edge
will be open. Allowing a -dependent length scale and using a
multi-scale analysis due to Aizenman and Newman, we show that the long distance
behavior of the connectivity is governed by the probability
. The result holds up to the critical point.Comment: 6 page