Results 61 to 70 of about 180,895 (263)

The Random Graph

open access: yes, 1997
Revised chapter for new edition of book "The Mathematics of Paul Erd\H{o}s"
openaire   +2 more sources

Metastasis on pause: How dormant tumor cells stay hidden within the tumor microenvironment and evade immune surveillance

open access: yesMolecular Oncology, EarlyView.
Dormant cancer cells can hide in distant organs for years, evading treatment and the immune system. This review highlights how signals from the surrounding tissue and immune environment keep these cells inactive or trigger their reawakening. Understanding these mechanisms may help develop therapies to eliminate or control dormant cells and prevent ...
Kanishka Tiwary   +1 more
wiley   +1 more source

Random graphs, models and generators of scale-free graphs

open access: yesТруды Института системного программирования РАН, 2018
In this paper  various models of random graphs describing real networks arising in different research fields: biology, computer science, engineering, sociology are considered. Particular attention is paid to  models describing social networks.
M. M. Bernovskiy, N. N. Kuzyurin
doaj  

Fast Generation of Sparse Random Kernel Graphs. [PDF]

open access: yesPLoS ONE, 2015
The development of kernel-based inhomogeneous random graphs has provided models that are flexible enough to capture many observed characteristics of real networks, and that are also mathematically tractable.
Aric Hagberg, Nathan Lemons
doaj   +1 more source

Developmental programmes drive cellular plasticity, disease progression and therapy resistance in lung adenocarcinoma

open access: yesMolecular Oncology, EarlyView.
This study shows that lung adenocarcinomas exploit developmental branching morphogenesis to acquire a therapy resistant basal‐like tumour cell state. This process was found to be regulated by combined TP53 loss‐of‐function and type‐I interferon signalling, identifying a novel axis for biomarker and therapeutic target discovery.
Kamila J Bienkowska   +13 more
wiley   +1 more source

Stimulator of interferon genes agonist augmented antitumor immunity of osimertinib in Egfr‐mutated lung cancer

open access: yesMolecular Oncology, EarlyView.
Combining osimertinib with the STING agonist ADU‐S100 activates innate and adaptive immunity to overcome the non‐inflamed microenvironment of Egfr‐mutant lung cancer. This combination increases NK and CD8+ T‐cell infiltration, associated with activation of the STING‐IRF3 pathway and local immunogenic cell death.
Jun Nishimura   +19 more
wiley   +1 more source

The Largest Component in Critical Random Intersection Graphs

open access: yesDiscussiones Mathematicae Graph Theory, 2018
In this paper, through the coupling and martingale method, we prove the order of the largest component in some critical random intersection graphs is n23$n^{{2 \over 3}}$ with high probability and the width of scaling window around the critical ...
Wang Bin, Wang Longmin, Xiang Kainan
doaj   +1 more source

A novel quinazolinone insulin receptor inhibitor and its synergy with an EGFR inhibitor in glucose‐driven glioblastoma

open access: yesMolecular Oncology, EarlyView.
The novel styrylquinazolinone‐based molecule W1B effectively suppresses glioblastoma by inhibiting IGF1R and EGFR. In high‐glucose microenvironments driving tumor resistance, W1B acts synergistically with the EGFR inhibitor dacomitinib. This combination safely blocks compensatory survival signaling in zebrafish xenograft models. Showcasing promising in
Patryk Rurka   +9 more
wiley   +1 more source

Tumor B‐cell infiltration in platinum‐treated advanced muscle‐invasive urothelial carcinoma

open access: yesMolecular Oncology, EarlyView.
Bladder tumors with higher pretreatment memory B‐cell infiltration were linked to longer survival after cisplatin chemotherapy, but not carboplatin. These tumors also showed more organized immune structures (tertiary lymphoid structures) and a shared pro‐inflammatory B‐cell‐rich community, suggesting that memory B cells may help identify patients most ...
Konrad Stawiski   +10 more
wiley   +1 more source

Universal distance domination in random graphs

open access: yesMiskolc Mathematical Notes
Given a graph G=(V,E)D⊆VV∖DDGγ(G)GkDDdDk uk(G):= min ⁡ {d:∀ ⁡D⊆V with |D|≥d,D is a kdd set in G}.kuk(G)γ(G)=u1(G)ukkkkH ...
Gábor Bacsó   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy