Results 81 to 90 of about 16,346,212 (324)

Probability Models for Degree Distributions of Protein Interaction Networks

open access: yes, 2005
The degree distribution of many biological and technological networks has been described as a power-law distribution. While the degree distribution does not capture all aspects of a network, it has often been suggested that its functional form contains ...
Akaike H.   +9 more
core   +1 more source

Carcinomas and Carcinoid Tumors of the Lungs and Bronchi in Children and Adolescents: The EXPeRT Recommendations

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Primary lung carcinomas and bronchial carcinoid tumors (BC) are very rare malignancies in childhood. While typical BC and mucoepidermoid carcinomas are mostly low‐grade, localized tumors with a more favorable prognosis than in adults, necessitating avoidance of overtreatment, adenocarcinomas of the lung are often diagnosed at advanced disease ...
Michael Abele   +19 more
wiley   +1 more source

Feature Extraction from Degree Distribution for Comparison and Analysis of Complex Networks [PDF]

open access: yesComputer/law journal, 2014
and clustering of network instances, evaluation of network sampling methods, anomaly detection, and study of epidemic dynamics. The existing methods are unable to eectively capture the similarity of degree distributions, particularly when the ...
Sadegh Aliakbary, J. Habibi, A. Movaghar
semanticscholar   +1 more source

Transient Dynamics of Sparsely Connected Hopfield Neural Networks with Arbitrary Degree Distributions

open access: yes, 2007
Using probabilistic approach, the transient dynamics of sparsely connected Hopfield neural networks is studied for arbitrary degree distributions. A recursive scheme is developed to determine the time evolution of overlap parameters.
Amari   +29 more
core   +1 more source

Modeling interacting dynamic networks: I. Preferred degree networks and their characteristics [PDF]

open access: yes, 2013
We study a simple model of dynamic networks, characterized by a set preferred degree, $\kappa$. Each node with degree $k$ attempts to maintain its $\kappa$ and will add (cut) a link with probability $w(k;\kappa)$ ($1-w(k;\kappa)$).
Jolad, Shivakumar   +4 more
core   +4 more sources

Exploring Preferences for a Digital Single‐Session Intervention for Adolescent Siblings of Youth With Cancer

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Introduction Adolescent siblings of children with cancer are at elevated risk for psychosocial problems. Unfortunately, various barriers such as limited family time and resources, conflicting schedules, and psychosocial staffing constraints at cancer centers hinder sibling access to support.
Christina M. Amaro   +10 more
wiley   +1 more source

Arbitrary degree distribution networks with perturbations

open access: yesAIP Advances, 2021
Complex networks have played an important role in the field of natural science and social science, attracting considerable attention of more and more scholars.
Xiaomin Wang, Fei Ma, Bing Yao
doaj   +1 more source

European Standard Clinical Practice Guideline and EXPeRT Recommendations for the Diagnosis and Management of Gastroenteropancreatic Neuroendocrine Neoplasms in Children and Adolescents

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Pediatric gastroenteropancreatic neuroendocrine neoplasms (GEP‐NENs) are extremely rare and clinically heterogeneous. Management has largely been extrapolated from adult practice. This European Standard Clinical Practice Guideline (ESCP), developed by the EXPeRT network in collaboration with adult NEN experts, provides (adult) evidence ...
Michaela Kuhlen   +23 more
wiley   +1 more source

Synchronization from second order network connectivity statistics

open access: yesFrontiers in Computational Neuroscience, 2011
We investigate how network structure can influence the tendency for a neuronal network to synchronize, or its synchronizability, independent of the dynamical model for each neuron.
Liqiong eZhao   +3 more
doaj   +1 more source

Improved distributed degree splitting and edge coloring [PDF]

open access: yesDistributed Computing, 2019
The degree splitting problem requires coloring the edges of a graph red or blue such that each node has almost the same number of edges in each color, up to a small additive discrepancy. The directed variant of the problem requires orienting the edges such that each node has almost the same number of incoming and outgoing edges, again up to a small ...
Mohsen Ghaffari   +5 more
openaire   +7 more sources

Home - About - Disclaimer - Privacy