Results 61 to 70 of about 2,487,806 (297)

Membatasi k-Ketenggaan Simpul dalam Pembangkitan Random Graph Metode Erdos Royi untuk Meningkatkan Kinerja Komputasi

open access: yesCauchy: 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

open access: yesMathematics, 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

Random Graphs

open access: yesThe Annals of Mathematical Statistics, 1959
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Investigating the trade-off between infections and social interactions using a compact model of endemic infections on networks

open access: yesMathematics in Medical and Life Sciences
This paper is part of a special issue on Behavioural Epidemiology.In many epidemiological and ecological contexts, there is a trade-off between infections and interactions. This arises because the links between individuals capable of spreading infections
Bunlang Thatchai   +2 more
doaj   +1 more source

Super Connectivity of Erdős-Rényi Graphs

open access: yesMathematics, 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

Random subgraphs of certain graph powers

open access: yesInternational 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

Salmonella lipopolysaccharide‐containing supported lipid bilayers as platforms to study bacteriophage interactions

open access: yesFEBS 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 Graphs with Clustering [PDF]

open access: yesPhysical Review Letters, 2009
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

Fitting a geometric graph to a protein-protein interaction network [PDF]

open access: yes, 2008
Finding a good network null model for protein-protein interaction (PPI) networks is a fundamental issue. Such a model would provide insights into the interplay between network structure and biological function as well as into evolution.
Higham, Desmond J.   +2 more
core   +4 more sources

From mice to humans—divergent strategies for intestinal homeostasis and regeneration

open access: yesFEBS 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

Home - About - Disclaimer - Privacy