Results 21 to 30 of about 172,035 (261)
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
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 n n -vertex trees, in two senses. In the first sense, the probability of each edge occurring in the graph diminishes as n n increases, and the set of trees referred to as "almost all" depends
Bender, E. A., Wormald, N. C.
openaire +2 more sources
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
Entropy, 2021 Graphs/networks have become a powerful analytical approach for data modeling. Besides, with the advances in sensor technology, dynamic time-evolving data have become more common.
Adèle Helena Ribeiro +3 more
doaj +1 more source
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
Entropy, 2021 The present paper reports simulation results for a simple model of reference group influence on market choices, e.g., brand selection. The model was simulated on three types of random graphs, Erdos–Renyi, Barabasi–Albert, and Watts–Strogatz.
Michał Ramsza
doaj +1 more source
Journal of Combinatorial Theory, Series B, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
McDiarmid, C, Steger, A, Welsh, D
openaire +4 more sources
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
A phase transition in the random transposition random walk [PDF]
Discrete Mathematics & Theoretical Computer Science, 2003 Our work is motivated by Bourque-Pevzner's simulation study of the effectiveness of the parsimony method in studying genome rearrangement, and leads to a surprising result about the random transposition walk in continuous time on the group of ...
Nathanael Berestycki, Rick Durrett
doaj +1 more source
A further analysis of Cuckoo Hashing with a Stash and Random Graphs of Excess r [PDF]
Discrete Mathematics & Theoretical Computer Science, 2010 Analysis of ...
Reinhard Kutzelnigg
doaj +1 more source