Results 31 to 40 of about 180,895 (263)
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
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
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
Random walks on the random graph [PDF]
The Annals of Probability, 2018 We study random walks on the giant component of the Erdős–Rényi random graph G(n,p) where p=λ/n for λ>1 fixed. The mixing time from a worst starting point was shown by Fountoulakis and Reed, and independently by Benjamini, Kozma and Wormald, to have order log2n.
Berestycki, Nathanaël +3 more
openaire +5 more sources
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
PREFERENTIAL ATTACHMENT WITH FITNESS DEPENDENT CHOICE
Физико-химические аспекты изучения кластеров, наноструктур и наноматериалов, 2021 We study the asymptotic behavior of the maximum degree in the preferential attachment tree model with a choice based on both the degree and fitness of a vertex.
Y.A. Malyshkin
doaj +1 more source
Random Structures & Algorithms, 2018 We investigate the asymptotic structure of a random perfect graph Pn sampled uniformly from the set of perfect graphs on vertex set . Our approach is based on the result of Prömel and Steger that almost all perfect graphs are generalised split graphs, together with a method to generate such graphs almost uniformly.
McDiarmid, C, Yolov, N
openaire +2 more sources
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
The effects of random geometric graph structure and clustering on localizability of sensor networks
International Journal of Distributed Sensor Networks, 2017 Graph rigidity provides the conditions of unique localizability for cooperative localization of wireless ad hoc and sensor networks. Specifically, redundant rigidity and 3-connectivity are necessary and sufficient conditions for unique localizability of ...
Tolga Eren
doaj +1 more source
Navigability of Random Geometric Graphs in the Universe and Other Spacetimes
Scientific Reports, 2017 Random geometric graphs in hyperbolic spaces explain many common structural and dynamical properties of real networks, yet they fail to predict the correct values of the exponents of power-law degree distributions observed in real networks.
William Cunningham +2 more
doaj +1 more source