Results 51 to 60 of about 2,487,806 (297)
hergm: Hierarchical Exponential-Family Random Graph Models
Journal of Statistical Software, 2018 We describe the R package hergm that implements hierarchical exponential-family random graph models with local dependence. Hierarchical exponential-family random graph models with local dependence tend to be superior to conventional exponential-family ...
Michael Schweinberger, Pamela Luna
doaj +1 more source
A Probabilistic Counting Lemma for Complete Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 We prove the existence of many complete graphs in almost all sufficiently dense partitions obtained by an application of Szemerédi's Regularity Lemma.
Stefanie Gerke +2 more
doaj +1 more source
On the Spread of Random Graphs
Combinatorics, Probability and Computing, 2014 The spread of a connected graph G was introduced by Alon, Boppana and Spencer [1], and measures how tightly connected the graph is. It is defined as the maximum over all Lipschitz functions f on V(G) of the variance of f(X) when X is uniformly distributed on V(G).
Addario-Berry, L +2 more
openaire +6 more sources
Scaling limit for the random walk on the largest connected component of the critical random graph [PDF]
, 2012 In this article, a scaling limit for the simple random walk on the largest connected component of the Erdos-Rényi random graph G(n,p) in the critical window, p = n−1+λn−4/3, is deduced.
Croydon, David A.
core +1 more source
International Journal of Distributed Sensor Networks, 2012 Suppose that n nodes with n 0 acquaintances per node are randomly deployed in a two-dimensional Euclidean space with the geographic restriction that each pair of nodes can exchange information between them directly only if the distance between them is at
Zhihong Liu +4 more
doaj +1 more source
Finding planted partitions in random graphs with general degree distributions [PDF]
, 2009 We consider the problem of recovering a planted partition such as a coloring, a small bisection, or a large cut in an (apart from that) random graph. In the last 30 years many algorithms for this problem have been developed that work provably well on ...
Coja-Oghlan, Amin, Lanka, André
core +1 more source
International Journal of Distributed Sensor Networks, 2012 We theoretically and experimentally analyze the process of adding sparse random links to random wireless networks modeled as a random geometric graph. While this process has been previously proposed, we are the first to prove theoretical bounds on the ...
Gunes Ercal
doaj +1 more source
Dynamic Random Graph Protection Scheme Based on Chaos and Cryptographic Random Mapping
Information, 2022 Advances in network technology have enhanced the concern for network security issues. In order to address the problem that hopping graph are vulnerable to external attacks (e.g., the changing rules of fixed graphs are more easily grasped by attackers ...
Zhu Fang, Zhengquan Xu
doaj +1 more source
A Random Graph Model for Massive Graphs [PDF]
Proceedings of the thirty-second annual ACM symposium on Theory of computing, 2000 We propose a random graph model which is a special case of sparse random graphs with given degree sequences. This model involves only a small number of parameters, called logsize and log-log growth rate. These parameters capture some universal characteristics of massive graphs.
William Aiello +2 more
openaire +2 more sources
CONTEST : a Controllable Test Matrix Toolbox for MATLAB [PDF]
, 2009 Large, sparse networks that describe complex interactions are a common feature across a number of disciplines, giving rise to many challenging matrix computational tasks.
Alan Taylor +6 more
core +4 more sources