21 research outputs found

    Clustering and Cliques in P.A random graphs with edge insertion

    Full text link
    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 tt, either a new vertex is added with probability f(t)f(t), or an edge is added between two existing vertices with probability 1−f(t)1-f(t). We establish concentration inequalities for the global clustering and clique number of the resulting graphs under the assumption that f(t)f(t) is a regularly varying function at infinity with index of regular variation −γ-\gamma, where γ∈[0,1)\gamma \in [0,1). 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 Zd\Z^d

    Get PDF
    Consider an independent site percolation model with parameter p∈(0,1)p \in (0,1) on Zd, d≥2\Z^d,\ d\geq 2 where there are only nearest neighbor bonds and long range bonds of length kk parallel to each coordinate axis. We show that the percolation threshold of such model converges to pc(Z2d)p_c(\Z^{2d}) when kk goes to infinity, the percolation threshold for ordinary (nearest neighbour) percolation on Z2d\Z^{2d}. 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 Zd\Z^d

    Full text link
    In this short note we consider mixed short-long range independent bond percolation models on Zk+d\Z^{k+d}. Let puvp_{uv} be the probability that the edge (u,v)(u,v) will be open. Allowing a x,yx,y-dependent length scale and using a multi-scale analysis due to Aizenman and Newman, we show that the long distance behavior of the connectivity Ï„xy\tau_{xy} is governed by the probability pxyp_{xy}. The result holds up to the critical point.Comment: 6 page
    corecore