Results 51 to 60 of about 5,903,622 (201)
An $L^p$ theory of sparse graph convergence I: Limits, sparse random graph models, and power law distributions [PDF]
Transactions of the American Mathematical Society, 2014 We introduce and develop a theory of limits for sequences of sparse graphs based on $L^p$ graphons, which generalizes both the existing $L^\infty$ theory of dense graph limits and its extension by Bollob\'as and Riordan to sparse graphs without dense ...
C. Borgs +3 more
semanticscholar +1 more source
Graph Convolutional Networks with Markov Random Field Reasoning for Social Spammer Detection
AAAI Conference on Artificial Intelligence, 2020 The recent growth of social networking platforms also led to the emergence of social spammers, who overwhelm legitimate users with unwanted content. The existing social spammer detection methods can be characterized into two categories: features based ...
Yongji Wu +4 more
semanticscholar +1 more source
Random walks on the random graph [PDF]
, 2015 We study random walks on the giant component of the Erd\H{o}s-R\'enyi random graph ${\cal G}(n,p)$ where $p=\lambda/n$ for $\lambda>1$ fixed. The mixing time from a worst starting point was shown by Fountoulakis and Reed, and independently by Benjamini ...
N. Berestycki +3 more
semanticscholar +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
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
Asymptotics in directed exponential random graph models with an increasing bi-degree sequence [PDF]
, 2014 Although asymptotic analyses of undirected network models based on degree sequences have started to appear in recent literature, it remains an open problem to study statistical properties of directed network models.
T. Yan, Chenlei Leng, Ji Zhu
semanticscholar +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