Results 31 to 40 of about 5,903,622 (201)
Resilience of perfect matchings and Hamiltonicity in random graph processes [PDF]
Random Struct. Algorithms, 2017 Let {Gi} be the random graph process: starting with an empty graph G0 with n vertices, in every step i ≥ 1 the graph Gi is formed by taking an edge chosen uniformly at random among the nonexisting ones and adding it to the graph Gi − 1.
R. Nenadov, A. Steger, Milos Trujic
semanticscholar +1 more source
Data Collection Based on Opportunistic Node Connections in Wireless Sensor Networks
Sensors, 2018 The working⁻sleeping cycle strategy used for sensor nodes with limited power supply in wireless sensor networks can effectively save their energy, but also causes opportunistic node connections due to the intermittent communication mode, which can ...
Guisong Yang, Zhiwei Peng, Xingyu He
doaj +1 more source
On the Validity of Neural Mass Models
Frontiers in Computational Neuroscience, 2021 Modeling the dynamics of neural masses is a common approach in the study of neural populations. Various models have been proven useful to describe a plenitude of empirical observations including self-sustained local oscillations and patterns of distant ...
Nicolás Deschle +6 more
doaj +1 more source
The Electronic Journal of Combinatorics, 2009 We introduce a pair of natural, equivalent models for random threshold graphs and use these models to deduce a variety of properties of random threshold graphs. Specifically, a random threshold graph $G$ is generated by choosing $n$ IID values $x_1,\ldots,x_n$ uniformly in $[0,1]$; distinct vertices $i,j$ of $G$ are adjacent exactly when $x_i + x_j \ge
Reilly, Elizabeth Perez +1 more
openaire +2 more sources
Random graph models for dynamic networks [PDF]
European Physical Journal B : Condensed Matter Physics, 2016 Recent theoretical work on the modeling of network structure has focused primarily on networks that are static and unchanging, but many real-world networks change their structure over time.
Xiao Zhang, Cristopher Moore, M. Newman
semanticscholar +1 more source
On the Vertex-Connectivity of an Uncertain Random Graph
IEEE Access, 2020 In many practical problems, randomness and uncertainty simultaneously appear in one complex system or network. When graph theory is applied to these problems, these complex systems or networks are usually represented by uncertain random graphs, in which ...
Hao Li, Xin Gao
doaj +1 more source
Journal of Physics A: Mathematical and General, 1994 9 pages, report CPTH-A264 ...
Bachas, C. +2 more
openaire +2 more sources
Directed random geometric graphs: structural and spectral properties
Journal of Physics: Complexity, 2022 In this work we analyze structural and spectral properties of a model of directed random geometric graphs: given n vertices uniformly and independently distributed on the unit square, a directed edge is set between two vertices if their distance is ...
Kevin Peralta-Martinez +1 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
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