Results 51 to 60 of about 1,182,412 (332)
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
k-connectivity of Random Graphs and Random Geometric Graphs in Node Fault Model
, 2018 k-connectivity of random graphs is a fundamental property indicating reliability of multi-hop wireless sensor networks (WSN). WSNs comprising of sensor nodes with limited power resources are modeled by random graphs with unreliable nodes, which is known ...
bollobás +7 more
core +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
Local resilience and Hamiltonicity Maker-Breaker games in random-regular graphs
, 2010 For an increasing monotone graph property $\mP$ the \emph{local resilience} of a graph $G$ with respect to $\mP$ is the minimal $r$ for which there exists of a subgraph $H\subseteq G$ with all degrees at most $r$ such that the removal of the edges of $H$
BENNY SUDAKOV +10 more
core +1 more source
Molecular Oncology, EarlyView.Pharmacologic ascorbate (vitamin C) increases ROS, disrupts cellular metabolism, and induces DNA damage in CRPC cells. These effects sensitize tumors to PARP inhibition, producing synergistic growth suppression with olaparib in vitro and significantly delayed tumor progression in vivo. Pyruvate rescue confirms ROS‐dependent activity.
Nicolas Gordon +13 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