Results 41 to 50 of about 1,182,412 (332)
Mixing times of random walks on dynamic configuration models [PDF]
, 2018 The mixing time of a random walk, with or without backtracking, on a random graph generated according to the configuration model on $n$ vertices, is known to be of order $\log n$.
Avena, Luca +3 more
core +2 more sources
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
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
Random intersection graph process
, 2013 We introduce a random intersection graph process aimed at modeling sparse evolving affiliation networks that admit tunable (power law) degree distribution and assortativity and clustering coefficients.
Bloznelis, Mindaugas, Karonski, Michal
core +1 more source
The Annals of Mathematical Statistics, 1959 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
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
HyGen: generating random graphs with hyperbolic communities
Applied Network Science, 2019 Random graph generators are necessary tools for many network science applications. For example, the evaluation of graph analysis algorithms requires methods for generating realistic synthetic graphs.
Saskia Metzler, Pauli Miettinen
doaj +1 more source
Random graph products of finite groups are rational duality groups
, 2013 Given an edge-independent random graph G(n,p), we determine various facts about the cohomology of graph products of groups for the graph G(n,p). In particular, the random graph product of a sequence of finite groups is a rational duality group with ...
Davis, Michael W., Kahle, Matthew
core +1 more source
Mathematics in Medical and Life SciencesThis paper is part of a special issue on Behavioural Epidemiology.In many epidemiological and ecological contexts, there is a trade-off between infections and interactions. This arises because the links between individuals capable of spreading infections
Bunlang Thatchai +2 more
doaj +1 more source
The number of planar graphs and properties of random planar graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 We show an asymptotic estimate for the number of labelled planar graphs on $n$ vertices. We also find limit laws for the number of edges, the number of connected components, and other parameters in random planar graphs.
Omer Gimenez, Marc Noy
doaj +1 more source