Results 41 to 50 of about 1,095,825 (329)
Graph enumeration and random graphs
, 2023 In this thesis we use analytic combinatorics to deal with two related problems: graph enumeration and random graphs from constrained classes of graphs. We are interested in drawing a general picture of some graph families by determining, first, how many elements are there of a given possible size (graph enumeration), and secondly, what is the typical ...
openaire +4 more sources
On the strengths of connectivity and robustness in general random intersection graphs [PDF]
, 2014 Random intersection graphs have received much attention for nearly two decades, and currently have a wide range of applications ranging from key predistribution in wireless sensor networks to modeling social networks.
Gligor, Virgil, Yağan, Osman, Zhao, Jun
core +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
A Continuous-Time Network Evolution Model Describing 2- and 3-Interactions
Mathematics, 2021 A continuous-time network evolution model is considered. The evolution of the network is based on 2- and 3-interactions. 2-interactions are described by edges, and 3-interactions are described by triangles.
István Fazekas, Attila Barta
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
Nicholas C. Wormald, Edward A. Bender
openaire +2 more sources
The Electronic Journal of Combinatorics, 2023 Let $N=\binom{n}{2}$ and $s\geq 2$. Let $e_{i,j},\,i=1,2,\ldots,N,\,j=1,2,\ldots,s$ be $s$ independent permutations of the edges $E(K_n)$ of the complete graph $K_n$. A MultiTree is a set $I\subseteq [N]$ such that the edge sets $E_{I,j}$ induce spanning trees for $j=1,2,\ldots,s$.
Frieze, Alan, Pegden, Wesley
openaire +2 more sources
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 Edge-Connectivity of an Uncertain Random Graph
IEEE Access, 2020 Connectivity is one of the most important concepts in graph theory. When graph theory is applied to complex systems with indeterminate factors, uncertainty and randomness are two basic types of indeterminacy.
Hao Li, Hui Zhang
doaj +1 more source
Tilings in randomly perturbed dense graphs [PDF]
, 2018 A perfect $H$-tiling in a graph $G$ is a collection of vertex-disjoint copies of a graph $H$ in $G$ that together cover all the vertices in $G$. In this paper we investigate perfect $H$-tilings in a random graph model introduced by Bohman, Frieze and ...
Balogh, József +2 more
core +2 more sources
Synchronization in random networks with given expected degree sequences [PDF]
, 2008 Synchronization in random networks with given expected degree sequences is studied. We also investigate in details the synchronization in networks whose topology is described by classical random graphs, power-law random graphs and hybrid graphs when N ...
Biey, Mario, Checco, P., Kocarev, L.
core +1 more source