Results 31 to 40 of about 267,735 (315)
The contact process on scale-free networks evolving by vertex updating [PDF]
Royal Society Open Science, 2017 We study the contact process on a class of evolving scale-free networks, where each node updates its connections at independent random times. We give a rigorous mathematical proof that there is a transition between a phase where for all infection rates ...
Emmanuel Jacob, Peter Mörters
doaj +1 more source
Stochastic Processes and their Applications, 2005 Inspired by a concept in comparative genomics, we investigate properties of randomly chosen members of G_1(m,n,t), the set of bipartite graphs with $m$ left vertices, n right vertices, t edges, and each vertex of degree at least one. We give asymptotic results for the number of such graphs and the number of $(i,j)$ trees they contain.
Blasiak, Jonah, Durrett, Rick
openaire +2 more sources
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 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
Estrada Index and Laplacian Estrada Index of Random Interdependent Graphs
Mathematics, 2020 Let G be a simple graph of order n. The Estrada index and Laplacian Estrada index of G are defined by E E ( G ) = ∑ i = 1 n e λ i ( A ( G ) ) and L E E ( G ) = ∑ i = 1 n e λ i ( L ( G ) ) , where { λ i
Yilun Shang
doaj +1 more source
International Journal of Distributed Sensor Networks, 2012 Suppose that n nodes with n 0 acquaintances per node are randomly deployed in a two-dimensional Euclidean space with the geographic restriction that each pair of nodes can exchange information between them directly only if the distance between them is at
Zhihong Liu +4 more
doaj +1 more source
hergm: Hierarchical Exponential-Family Random Graph Models
Journal of Statistical Software, 2018 We describe the R package hergm that implements hierarchical exponential-family random graph models with local dependence. Hierarchical exponential-family random graph models with local dependence tend to be superior to conventional exponential-family ...
Michael Schweinberger, Pamela Luna
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 Annals of Mathematical Statistics, 1959 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
International Journal of Distributed Sensor Networks, 2012 We theoretically and experimentally analyze the process of adding sparse random links to random wireless networks modeled as a random geometric graph. While this process has been previously proposed, we are the first to prove theoretical bounds on the ...
Gunes Ercal
doaj +1 more source