Results 61 to 70 of about 5,903,622 (201)
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
Asymptotic Behavior of the Edge Metric Dimension of the Random Graph
Discussiones Mathematicae Graph Theory, 2021 Given a simple connected graph G(V,E), the edge metric dimension, denoted edim(G), is the least size of a set S ⊆ V that distinguishes every pair of edges of G, in the sense that the edges have pairwise different tuples of distances to the vertices of S.
Zubrilina Nina
doaj +1 more source
Random Graphs with Clustering [PDF]
Physical Review Letters, 2009 We offer a solution to a long-standing problem in the physics of networks, the creation of a plausible, solvable model of a network that displays clustering or transitivity -- the propensity for two neighbors of a network node also to be neighbors of one another.
openaire +3 more sources
FEBS Letters, EarlyView.In this study, we found that human cervical‐derived adipocytes maintain intracellular iron level by regulating the expression of iron transport‐related proteins during adrenergic stimulation. Melanotransferrin is predicted to interact with transferrin receptor 1 based on in silico analysis.
Rahaf Alrifai +9 more
wiley +1 more source
Random subgraphs of certain graph powers
International Journal of Mathematics and Mathematical Sciences, 2002 We determine the limiting probability that a random subgraph of the Cartesian power Kan or of Ka,an is connected.
Lane Clark
doaj +1 more source
A Comprehensive Approach to Synthetic Distribution Grid Generation: Erdős–Rényi to Barabási-Albert [PDF]
AUT Journal of Electrical EngineeringIn this extended study, the focus is on advancing the generation of synthetic distribution grids (SDGs) through the introduction of a new algorithm based on the Barabási-Albert random graph model.
Mohammad Shahraeini
doaj +1 more source
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
Zero-One Law for Connectivity in Superposition of Random Key Graphs on Random Geometric Graphs
Discrete Dynamics in Nature and Society, 2015 We study connectivity property in the superposition of random key graph on random geometric graph. For this class of random graphs, we establish a new version of a conjectured zero-one law for graph connectivity as the number of nodes becomes unboundedly
Y. Tang, Q. L. Li
doaj +1 more source
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