Results 51 to 60 of about 276,499 (268)
On the Spread of Random Graphs
Combinatorics, Probability and Computing, 2014 The spread of a connected graph G was introduced by Alon, Boppana and Spencer [1], and measures how tightly connected the graph is. It is defined as the maximum over all Lipschitz functions f on V(G) of the variance of f(X) when X is uniformly distributed on V(G).
Addario-Berry, L +2 more
openaire +5 more sources
Super Connectivity of Erdős-Rényi Graphs
Mathematics, 2019 The super connectivity κ ′ ( G ) of a graph G is the minimum cardinality of vertices, if any, whose deletion results in a disconnected graph that contains no isolated vertex.
Yilun Shang
doaj +1 more source
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
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
FEBS Letters, EarlyView.The physical dimensions and shape of bacterial cells define the surface area available to acquire nutrients and the volume available for synthesizing proteins and DNA. Here, we use computational systems biology to decode the importance of cell geometry as a major determinant of prokaryotic phenotype, including growth rate and metabolic efficiency. This
Ross P. Carlson +6 more
wiley +1 more source
FEBS Letters, EarlyView.We present robust protocols for the preparation of supported lipid bilayers (SLBs) incorporating either Salmonella smooth LPS or outer membrane vesicles (OMVs). We use a combination of quartz crystal microbalance with dissipation (QCM‐D) and fluorescence microscopy to both characterize the SLBs of various compositions and to probe their interactions ...
Hudson P. Pace +6 more
wiley +1 more source
Random triangles in random graphs
Random Structures & Algorithms, 2021 AbstractIn a recent paper, Oliver Riordan shows that for and p up to and slightly larger than the threshold for a Kr‐factor, the hypergraph formed by the copies of Kr in G(n, p) contains a copy of the binomial random hypergraph with . For r = 3, he gives a slightly weaker result where the density in the random hypergraph is reduced by a constant ...
openaire +3 more sources
From mice to humans—divergent strategies for intestinal homeostasis and regeneration
FEBS Letters, EarlyView.Recent advances such as organoid genome editing, xenotransplantation, imaging, and whole‐genome sequencing have enabled direct studies of human intestinal stem cells (ISCs). These studies reveal species‐specific features, including slower ISC proliferation, distinct injury responses, slower somatic mutation accumulation in humans, and an inverse ...
Keiko Ishikawa +2 more
wiley +1 more source
Design and analysis strategies for robust microbiome ageing research
FEBS Letters, EarlyView.The gut microbiome changes with age and associates with age‐related morbidity and mortality, establishing it as a potential biomarker and intervention target for ageing. Realising this potential requires methodological rigour, yet distinguishing biological signals from methodological artefacts remains challenging across cohorts. This review provides an
Mark Olenik +5 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