Results 61 to 70 of about 3,967,804 (356)
PREFERENTIAL ATTACHMENT WITH FITNESS DEPENDENT CHOICE
Физико-химические аспекты изучения кластеров, наноструктур и наноматериалов, 2021 We study the asymptotic behavior of the maximum degree in the preferential attachment tree model with a choice based on both the degree and fitness of a vertex.
Y.A. Malyshkin
doaj +1 more source
The largest component in a subcritical random graph with a power law degree distribution
, 2008 It is shown that in a subcritical random graph with given vertex degrees satisfying a power law degree distribution with exponent $\gamma>3$, the largest component is of order $n^{1/(\gamma-1)}$.
Janson, Svante
core +4 more sources
The complexity of degree anonymization by vertex addition [PDF]
Theoretical Computer Science, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bredereck, Robert +5 more
openaire +2 more sources
Functional Connectivity Linked to Cognitive Recovery After Minor Stroke
Annals 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
Frontiers in PhysicsA topological index is a real number calculated from the structure of a chemical compound to describe its topology. The use of molecular descriptors has been increasing in recent years, helping to determine the physicochemical and biological properties ...
Muhammad Waheed Rasheed +2 more
doaj +1 more source
New Results on the Forgotten Topological Index and Coindex
Journal of Mathematics, 2021 The ℱ-coindex (forgotten topological coindex) for a simple connected graph G is defined as the sum of the terms ζG2y+ζG2x over all nonadjacent vertex pairs x,y of G, where ζGy and ζGx are the degrees of the vertices y and x in G, respectively.
Akbar Jahanbani +2 more
doaj +1 more source
, 2011 The Kondo breakdown scenario has been claimed to allow the $T$-linear resistivity in the vicinity of the Kondo breakdown quantum critical point, two cornerstones of which are the dynamical exponent $z = 3$ quantum criticality for hybridization ...
Kim, Ki-Seok
core +1 more source
Vertex Degrees of Steiner Minimal Trees in ℓpd and Other Smooth Minkowski Spaces [PDF]
Discrete & Computational Geometry, 1999 . We find upper bounds for the degrees of vertices and Steiner points in Steiner Minimal Trees (SMTs) in the d -dimensional Banach spaces $ \ell$ pd independent of d .
K. Swanepoel
semanticscholar +1 more source
, 2016 We prove a general multi-dimensional central limit theorem for the expected number of vertices of a given degree in the family of planar maps whose vertex degrees are restricted to an arbitrary (finite or infinite) set of positive integers D. Our results rely on a classical bijection with mobiles (objects exhibiting a tree structure), combined with ...
Collet, Gwendal +2 more
openaire +2 more sources
Clustering Algorithm Reveals Dopamine‐Motor Mismatch in Cognitively Preserved Parkinson's Disease
Annals 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