Results 21 to 30 of about 180,895 (263)
Optimal shattering of complex networks
Applied Network Science, 2019 We consider optimal attacks or immunization schemes on different models of random graphs. We derive bounds for the minimum number of nodes needed to be removed from a network such that all remaining components are fragments of negligible size.We obtain ...
Nicole Balashov +4 more
doaj +1 more source
Balanced Avoidance Games on Random Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 We introduce and study balanced online graph avoidance games on the random graph process. The game is played by a player we call Painter. Edges of the complete graph with $n$ vertices are revealed two at a time in a random order.
Martin Marciniszyn +2 more
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
Local Interaction on Random Graphs
Games, 2010 We analyze dynamic local interaction in population games where the local interaction structure (modeled as a graph) can change over time: A stochastic process generates a random sequence of graphs. This contrasts with models where the initial interaction
Hans Haller, Siegfried Berninghaus
doaj +1 more source
Local Connectivity of Uncertain Random Graphs
IEEE Access, 2020 As the system becomes more and more complex, we are usually in the state of indeterminacy. In the real world, the states of uncertainty and randomness are the two most common types of indeterminacy.
Hui Li, Bo Zhang, Jin Peng, Xiangyu Ge
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
Combinatorica, 1988 We introduce a large equivalence class of graph properties, all of which are shared by so-called random graphs. Unlike random graphs, however, it is often relatively easy to verify that a particular family of graphs possesses some property in this class.
Chung, F. R. K. +2 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
Zero-One Law for Connectivity in Superposition of Random Key Graphs on Random Geometric Graphs
Discrete Dynamics in Nature and Society, 2015 We study connectivity property in the superposition of random key graph on random geometric graph. For this class of random graphs, we establish a new version of a conjectured zero-one law for graph connectivity as the number of nodes becomes unboundedly
Y. Tang, Q. L. Li
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