Results 31 to 40 of about 276,499 (268)
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
Two modified Zagreb indices for random structures
Main Group Metal Chemistry, 2021 Random structure plays an important role in the composition of compounds, and topological index is an important index to measure indirectly the properties of compounds.
Li Siman, Shi Li, Gao Wei
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
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
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
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
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
On the number of series parallel and outerplanar graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 We show that the number $g_n$ of labelled series-parallel graphs on $n$ vertices is asymptotically $g_n \sim g \cdot n^{-5/2} \gamma^n n!$, where $\gamma$ and $g$ are explicit computable constants.
Manuel Bodirsky +3 more
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