Results 41 to 50 of about 42,000 (265)

Limit distributions of vertex degrees in a conditional configuration graph

open access: yesProceedings of the Karelian Research Centre of the Russian Academy of Sciences, 2018
The configuration graph where vertex degrees are independent identically distributed random variables is often used for  modeling of complex networks such as the Internet. We consider a random graph consisting of   N vertices. The random variables η1,….,ηN are  equal to the degrees of vertices with the numbers 1,… ,N The probability  P{ηi=k},  i=1,…, N,
Irina Chepliukova, Yuri Pavlov
openaire   +3 more sources

Multi‐omics and low‐input proteomics profiling reveals dynamic regulation driving pluripotency initiation in early mouse embryos

open access: yesFEBS Open Bio, EarlyView.
Mouse pre‐implantation development involves a transition from totipotency to pluripotency. Integrating transcriptomics, epigenetic profiling, low‐input proteomics and functional assays, we show that eight‐cell embryos retain residual totipotency features, whereas cytoskeletal remodeling regulated by the ubiquitin‐proteasome system drives progression ...
Wanqiong Li   +8 more
wiley   +1 more source

ORDERING CATACONDENSED HEXAGONAL SYSTEMS WITH RESPECT TO VDB TOPOLOGICAL INDICES

open access: yesRevista de Matemática: Teoría y Aplicaciones, 2017
In this paper we give a complete description of the ordering relations in the set of catacondensed hexagonal systems, with respect to a vertex-degree-based topological index. As a consequence, extremal values of vertex-degree-based topological indices in
Juan Rada
doaj   +1 more source

On the degree evolution of a fixed vertex in some growing networks [PDF]

open access: yesStatistics & Probability Letters, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lindholm, Mathias, Vallier, Thomas
openaire   +2 more sources

Spanning trees in graphs of high minimum degree with a universal vertex II: A tight result

open access: yesJournal of Graph Theory, 2022
AbstractWe prove that, if is sufficiently large, every graph on vertices that has a universal vertex and minimum degree at least contains each tree with edges as a subgraph. Our result confirms, for large , an important special case of a conjecture by Havet, Reed, Stein, and Wood.
Bruce Reed, Maya Stein
openaire   +3 more sources

Functional Connectivity Linked to Cognitive Recovery After Minor Stroke

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective Patients with minor stroke exhibit slowed processing speed and generalized alterations in functional connectivity involving frontoparietal cortex (FPC). The pattern of connectivity evolves over time. In this study, we examine the relationship of functional connectivity patterns to cognitive performance, to determine ...
Vrishab Commuri   +7 more
wiley   +1 more source

Prognostic Implications of Sleep Architecture for Patients Admitted to the Intensive Care Unit With Status Epilepticus

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective Status epilepticus (SE) is associated with significant mortality. Sleep architecture may reflect normal brain function. Impaired sleep architecture is associated with poorer outcomes in numerous conditions. Here we investigate the association of sleep architecture in continuous EEG (cEEG) with survival in SE.
Ran R. Liu   +5 more
wiley   +1 more source

ALS With and Without Upper Motor Neuron Signs: A Comparative Study Supporting the Gold Coast Criteria

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective The Gold Coast criteria permit diagnosis of amyotrophic lateral sclerosis (ALS) even without upper motor neuron (UMN) signs. However, whether ALS patients with UMN signs (ALSwUMN) and those without (ALSwoUMN) share similar characteristics and prognoses remains unclear.
Hee‐Jae Jung   +7 more
wiley   +1 more source

Some Bond Incident Degree Indices of (Molecular) Graphs with Fixed Order and Number of Cut Vertices

open access: yesDiscrete Dynamics in Nature and Society, 2021
A bond incident degree (BID) index of a graph G is defined as ∑uv∈EGfdGu,dGv, where dGw denotes the degree of a vertex w of G, EG is the edge set of G, and f is a real-valued symmetric function. The choice fdGu,dGv=adGu+adGv in the aforementioned formula
Abeer M. Albalahi   +3 more
doaj   +1 more source

Clustering Algorithm Reveals Dopamine‐Motor Mismatch in Cognitively Preserved Parkinson's Disease

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective To explore the relationship between dopaminergic denervation and motor impairment in two de novo Parkinson's disease (PD) cohorts. Methods n = 249 PD patients from Parkinson's Progression Markers Initiative (PPMI) and n = 84 from an external clinical cohort.
Rachele Malito   +14 more
wiley   +1 more source

Home - About - Disclaimer - Privacy