Results 81 to 90 of about 1,095,825 (329)
Freezing in random graph ferromagnets
, 2001 Using T=0 Monte Carlo and simulated annealing simulation, we study the energy relaxation of ferromagnetic Ising and Potts models on random graphs. In addition to the expected exponential decay to a zero energy ground state, a range of connectivities for ...
A.J. Bray +10 more
core +1 more source
Molecular Oncology, EarlyView.Dual targeting of AKT and mTOR using MK2206 and RAD001 reduces tumor burden in an intracardiac colon cancer circulating tumor cell xenotransplantation model. Analysis of AKT isoform‐specific knockdowns in CTC‐MCC‐41 reveals differentially regulated proteins and phospho‐proteins by liquid chromatography coupled mass spectrometry. Circulating tumor cells
Daniel J. Smit +19 more
wiley +1 more source
Network Motifs: Mean and Variance for the Count
Revstat Statistical Journal, 2006 Network motifs are at the core of modern studies on biological networks, trying to encompass global features such as small-world or scale-free properties. Detection of significant motifs may be based on two different approaches: either a comparison with
C. Matias +4 more
doaj +1 more source
Dynamic Random Graph Protection Scheme Based on Chaos and Cryptographic Random Mapping
Information, 2022 Advances in network technology have enhanced the concern for network security issues. In order to address the problem that hopping graph are vulnerable to external attacks (e.g., the changing rules of fixed graphs are more easily grasped by attackers ...
Zhu Fang, Zhengquan Xu
doaj +1 more source
The diamond-free process [PDF]
, 2010 Let K_4^- denote the diamond graph, formed by removing an edge from the complete graph K_4. We consider the following random graph process: starting with n isolated vertices, add edges uniformly at random provided no such edge creates a copy of K_4^-. We
Picollelli, Michael E.
core
Large deviations of empirical neighborhood distribution in sparse random graphs
, 2014 Consider the Erd\H{o}s-Renyi random graph on n vertices where each edge is present independently with probability c/n, with c>0 fixed. For large n, a typical random graph locally behaves like a Galton-Watson tree with Poisson offspring distribution with ...
Bordenave, Charles, Caputo, Pietro
core +1 more source
Inhibitor of DNA binding‐1 is a key regulator of cancer cell vasculogenic mimicry
Molecular Oncology, EarlyView.Elevated expression of transcriptional regulator inhibitor of DNA binding 1 (ID1) promoted cancer cell‐mediated vasculogenic mimicry (VM) through regulation of pro‐angiogenic and pro‐cancerous genes (e.g. VE‐cadherin (CDH5), TIE2, MMP9, DKK1). Higher ID1 expression also increased metastases to the lung and the liver.
Emma J. Thompson +11 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
Tail Index Estimation of PageRanks in Evolving Random Graphs
Mathematics, 2022 Random graphs are subject to the heterogeneities of the distributions of node indices and their dependence structures. Superstar nodes to which a large proportion of nodes attach in the evolving graphs are considered.
Natalia Markovich +2 more
doaj +1 more source
Molecular Oncology, EarlyView.This study used longitudinal transcriptomics and gene‐pattern classification to uncover patient‐specific mechanisms of chemotherapy resistance in breast cancer. Findings reveal preexisting drug‐tolerant states in primary tumors and diverse gene rewiring patterns across patients, converging on a few dysregulated functional modules. Despite receiving the
Maya Dadiani +14 more
wiley +1 more source