Results 21 to 30 of about 274,053 (268)
Taylor’s power law for the
Modern Stochastics: Theory and Applications, 2019 Taylor’s power law states that the variance function decays as a power law. It is observed for population densities of species in ecology. For random networks another power law, that is, the power law degree distribution is widely studied.
István Fazekas +2 more
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
Random rectangular graphs [PDF]
Physical Review E, 2015 A generalization of the random geometric graph (RGG) model is proposed by considering a set of points uniformly and independently distributed on a rectangle of unit area instead of on a unit square [0,1]^2. The topological properties of the random rectangular graphs (RRGs) generated by this model are then studied as a function of the rectangle sides ...
Estrada, Ernesto, Sheerin, Matthew
openaire +5 more sources
Tail Index Estimation of PageRanks in Evolving Random Graphs
Mathematics, 2022 Random graphs are subject to the heterogeneities of the distributions of node indices and their dependence structures. Superstar nodes to which a large proportion of nodes attach in the evolving graphs are considered.
Natalia Markovich +2 more
doaj +1 more source
Universality of Random Graphs [PDF]
SIAM Journal on Discrete Mathematics, 2012 We prove that asymptotically (as $n\to\infty$) almost all graphs with $n$ vertices and $C_dn^{2-\frac{1}{2d}} \log^{\frac{1}{d}} n$ edges are universal with respect to the family of all graphs with maximum degree bounded by $d$. Moreover, we provide an efficient deterministic embedding algorithm for finding copies of bounded degree graphs in graphs ...
Domingos Dellamonica Jr. +3 more
openaire +2 more sources
On hamiltonicity of uniform random intersection graphs
Lietuvos Matematikos Rinkinys, 2010 We give a sufficient condition for the hamiltonicity of the uniform random intersection graph G{n,m,d}. It is a graph on n vertices, where each vertex is assigned d keys drawn independently at random from a given set of m keys, and where any two vertices
Mindaugas Bloznelis +1 more
doaj +1 more source
Connectivity of Random Geometric Hypergraphs
Entropy, 2023 We consider a random geometric hypergraph model based on an underlying bipartite graph. Nodes and hyperedges are sampled uniformly in a domain, and a node is assigned to those hyperedges that lie within a certain radius.
Henry-Louis de Kergorlay +1 more
doaj +1 more source
Random matrices and random graphs
ESAIM: Proceedings and Surveys, 2023 We collect recent results on random matrices and random graphs. The topics covered are: fluctuations of the empirical measure of random matrices, finite-size effects of algorithms involving random matrices, characteristic polynomial of sparse matrices and Voronoi tesselations of split trees.
Capitaine, Mireille +4 more
openaire +3 more sources
Random Graphs with Clustering [PDF]
Physical Review Letters, 2009 We offer a solution to a long-standing problem in the physics of networks, the creation of a plausible, solvable model of a network that displays clustering or transitivity -- the propensity for two neighbors of a network node also to be neighbors of one another.
openaire +3 more sources
Random Trees in Random Graphs [PDF]
Proceedings of the American Mathematical Society, 1988 We show that a random labeled n n -vertex graph almost surely contains isomorphic copies of almost all labeled
Bender, E. A., Wormald, N. C.
openaire +2 more sources