Results 81 to 90 of about 258,206 (308)
Unions of random trees and applications
In 1986, Janson showed that the number of edges in the union of $k$ random spanning trees in the complete graph $K_n$ is a shifted Poisson distribution. Using results from the theory of electrical networks, we provide a new proof of this result, and we obtain an explicit rate of convergence.
Austen James +3 more
openaire +2 more sources
The dFoCC pipeline starts with observed DED and resting‐state coordinates, which are then used to generate a library of triggered states. Correlation analysis of the calculated DED features of each candidate vs observed DED permits quantitative evaluation of candidate structural quality.
Meng Iao Fong +3 more
wiley +1 more source
Selecting the most effective welding settings impacts mechanical strength and weld quality, with parameters like current, voltage, and speed playing pivotal roles.
Parrthipan Balasubramaniyan Karthekeyan +5 more
doaj +1 more source
The Block Connectivity of Random Trees [PDF]
Let $r$, $m$, and $n$ be positive integers such that $rm=n$. For each $i \in \{1, \ldots, m\}$ let $B_i = \{r(i-1)+1, \ldots, ri\}$. The $r$-block connectivity of a tree on $n$ labelled vertices is the vertex connectivity of the graph obtained by collapsing the vertices in $B_i$, for each $i,$ to a single (pseudo-)vertex $v_i$. In this paper we prove
Andrew R. A. McGrae, Michele Zito 0001
openaire +2 more sources
Molecular characterization of covRS mutations in M1UK Streptococcus pyogenes
Group A Streptococcus (GAS) acquires covRS mutations driving a hypervirulent bacterial state, frequently associated with invasive disease‐like necrotizing fasciitis. We demonstrate that the newly emerged M1UK GAS lineage can also acquire these mutations.
Jarrad Pritchard +12 more
wiley +1 more source
The distribution of degrees in a large random tree
For labeled trees, Renyi showed that the probability that an arbitrary point of a random tree has degree k approaches l/e(k-l)!. For unlabeled trees, the answer is different because the number of ways to label a given tree depends on the order of its ...
Robert W. Robinson +3 more
core +1 more source
A Two‐Stage Questionnaire and Actigraphy Screening for iRBD in a Multicenter Retrospective Cohort
ABSTRACT Objective Isolated rapid‐eye‐movement sleep behavior disorder is a prodromal marker of synucleinopathies. However, most cases remain undiagnosed due to the insufficient predictive value of questionnaires and limited access to confirmatory video‐polysomnography. We assessed a two‐stage screening strategy combining a brief questionnaire on rapid‐
Caleb A. Massimi +17 more
wiley +1 more source
Algorithms, random tree models and combinatorial objects [PDF]
The author thanks the editors of IMN for their invitation to give an overview about his recent research topics. The following paper exemplifies by concrete examples my main research directions, which concern the analysis of algorithms and data structures,
Alois Panholzer
core
Simulator Edukatif untuk Pembelajaran Algoritma Rapidly-exploring Random Tree (RRT)
- This paper presents the design and use of educational simulators to assist in teaching motion planning material using the Rapidly-exploring Random Tree (RRT) algorithm.
Nugraha, Eka Setia
core +2 more sources
Trajectories of Physical Function in Canadian Children With Juvenile Idiopathic Arthritis
Objective We describe trajectories of physical function in children newly diagnosed with juvenile idiopathic arthritis (JIA) and identify trajectories with persisting functional impairments and associated baseline characteristics. Methods We included patients enrolled in the Canadian Alliance of Pediatric Rheumatology Investigators (CAPRI) Registry ...
Clare Cunningham +81 more
wiley +1 more source

