Results 41 to 50 of about 172,035 (261)
Here we present the entropic dynamics formalism for networks. That is, a framework for the dynamics of graphs meant to represent a network derived from the principle of maximum entropy and the rate of transition is obtained taking into account the ...
Felipe Xavier Costa, Pedro Pessoa
doaj +1 more source
Generating Realistic Labelled, Weighted Random Graphs
Generative algorithms for random graphs have yielded insights into the structure and evolution of real-world networks. Most networks exhibit a well-known set of properties, such as heavy-tailed degree distributions, clustering and community formation ...
Michael Charles Davis +5 more
doaj +1 more source
Social media significantly influences business, politics, and society. Easy access and interaction among users allow information to spread rapidly across social networks.
Sergei Sidorov +2 more
doaj +1 more source
Random Graphs with Clustering [PDF]
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
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
A comprehensive genomic and proteomic analysis of cervical cancer revealed STK11 and STX3 as a potential biomarkers of chemoradiation resistance. Our study demonstrated EGFR as a therapeutic target, paving the way for precision strategies to overcome treatment failure and the DNA repair pathway as a critical mechanism of resistance.
Janani Sambath +13 more
wiley +1 more source
On Statistical Properties of a New Family of Geometric Random Graphs
We define a new family of random geometric graphs which we call random covering graphs and study its statistical properties. To the best of our knowledge, this family of graphs has not been explored in the past.
Kedar Joglekar +2 more
doaj +1 more source
Filtering Random Graph Processes Over Random Time-Varying Graphs
Graph filters play a key role in processing the graph spectra of signals supported on the vertices of a graph. However, despite their widespread use, graph filters have been analyzed only in the deterministic setting, ignoring the impact of stochastic- ity in both the graph topology as well as the signal itself.
Isufi, E. (author) +3 more
openaire +5 more sources
Urinary LGALS3BP is elevated in bladder cancer patients compared to healthy controls as detected by the 1959 antibody–based ELISA. The antibody shows enhanced reactivity to the high‐mannose glycosylated variant secreted by cancer cells treated with kifunensine (KIF).
Asia Pece +18 more
wiley +1 more source
Liquid biopsy epigenetics: establishing a molecular profile based on cell‐free DNA
Cell‐free DNA (cfDNA) fragments in plasma from cancer patients carry epigenetic signatures reflecting their cells of origin. These epigenetic features include DNA methylation, nucleosome modifications, and variations in fragmentation. This review describes the biological properties of each feature and explores optimal strategies for harnessing cfDNA ...
Christoffer Trier Maansson +2 more
wiley +1 more source

