Results 61 to 70 of about 274,053 (268)
A Probabilistic Counting Lemma for Complete Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 We prove the existence of many complete graphs in almost all sufficiently dense partitions obtained by an application of Szemerédi's Regularity Lemma.
Stefanie Gerke +2 more
doaj +1 more source
Targeted modulation of IGFL2‐AS1 reveals its translational potential in cervical adenocarcinoma
Molecular Oncology, Volume 20, Issue 6, Page 1643-1660, June 2026.Cervical adenocarcinoma patients face worse outcomes than squamous cell carcinoma counterparts despite similar treatment. The identification of IGFL2‐AS1's differential expression provides a molecular basis for distinguishing these histotypes, paving the way for personalized therapies and improved survival in vulnerable populations globally.
Ricardo Cesar Cintra +6 more
wiley +1 more source
Asymptotics of m-Cliques in a Sparse Inhomogeneous Random Graph
Journal of Mathematics, 2022 One of the classical questions in random graph theory is to understand the asymptotics of subgraph counts. In inhomogeneous random graph, this question has not been well studied. In this study, we investigate the asymptotic distribution of m-cliques in a
Xiaofeng Zhao
doaj +1 more source
, 1997 Revised chapter for new edition of book "The Mathematics of Paul Erd\H{o}s"
openaire +2 more sources
Molecular Oncology, EarlyView.Glioma cells mainly express the endothelin receptor EDNRB, while EDNRA is restricted to a perivascular tumor subpopulation. Endothelin signaling reduces glioma cell proliferation while promoting migration and a proneural‐to‐mesenchymal transition associated with poor prognosis. This pathway activates Ca2+, K+, ERK, and STAT3 signalings and is regulated
Donovan Pineau +36 more
wiley +1 more source
Central limit theorem for the principal eigenvalue and eigenvector of Chung–Lu random graphs
Journal of Physics: Complexity, 2023 A Chung–Lu random graph is an inhomogeneous Erdős–Rényi random graph in which vertices are assigned average degrees, and pairs of vertices are connected by an edge with a probability that is proportional to the product of their average degrees ...
Pierfrancesco Dionigi +4 more
doaj +1 more source
Interrogating the immune landscape of microsatellite stable RAS‐mutated colon cancer
Molecular Oncology, EarlyView.COLOSSUS project RAS‐mutated MSS colon cancer study explored transcriptomics and immune cell density by immunohistochemistry (IHC), Immunoscore (IS), ISIC/TuLIS scores, mutation counts, and detected different prevalences but similar microenvironment composition across immune markers with clinical relevance for future immunotherapy combination ...
Rodrigo Dienstmann +61 more
wiley +1 more source
Limit theorems for the weights and the degrees in anN-interactions random graph model
Open Mathematics, 2016 A random graph evolution based on interactions of N vertices is studied. During the evolution both the preferential attachment rule and the uniform choice of vertices are allowed. The weight of an M-clique means the number of its interactions.
Fazekas István, Porvázsnyik Bettina
doaj +1 more source
Molecular Oncology, EarlyView.Pancreatic sensory neurons innervating healthy and PDAC tissue were retrogradely labeled and profiled by single‐cell RNA sequencing. Tumor‐associated innervation showed a dominant neurofilament‐positive subtype, altered mitochondrial gene signatures, and reduced non‐peptidergic neurons.
Elena Genova +14 more
wiley +1 more source
Cauchy: Jurnal Matematika Murni dan Aplikasi, 2010 Edges generation by random graph erdos-royi methods was needed high computation, it’s caused low performance. In fact, edge generation was used frequently with many nodes.
Zainal Abidin, Agus Zainal Arifin
doaj +1 more source