Results 111 to 120 of about 6,285,799 (375)
Fringe trees, Crump-Mode-Jagers branching processes and $m$-ary search trees
This survey studies asymptotics of random fringe trees and extended fringe trees in random trees that can be constructed as family trees of a Crump-Mode-Jagers branching process, stopped at a suitable time.
Holmgren, Cecilia, Janson, Svante
core +1 more source
Objective The objective was to identify factors determining acute arthritis resolution and safety with colchicine and prednisone in acute calcium pyrophosphate (CPP) crystal arthritis. Methods We conducted a post hoc analysis of the COLCHICORT trial, which compared colchicine and prednisone for the treatment of acute CPP crystal arthritis, using a ...
Tristan Pascart +14 more
wiley +1 more source
Deterministic Random Walks on Regular Trees
Jim Propp's rotor router model is a deterministic analogue of a random walk on a graph. Instead of distributing chips randomly, each vertex serves its neighbors in a fixed order. Cooper and Spencer (Comb. Probab. Comput.
Cooper, Joshua +3 more
core +3 more sources
Objectives Sjögren's disease is an autoimmune disorder that can impact multiple organ systems, including the peripheral nervous system (PNS). PNS manifestations, which can exist concurrently, include mononeuropathies, polyneuropathies, and autonomic nervous system neuropathies. To help patients and providers in the decision‐making process, we developed
Anahita Deboo +19 more
wiley +1 more source
Spanning tree size in random binary search trees
This paper deals with the size of the spanning tree of p randomly chosen nodes in a binary search tree. It is shown via generating functions methods, that for fixed p, the (normalized) spanning tree size converges in law to the Normal distribution.
Panholzer, Alois, Prodinger, Helmut
openaire +3 more sources
By integrating machine learning into flux‐regulated crystallization (FRC), accurate prediction of solvent evaporation rates in real time, improving crystallization control and reducing crystal growth variability by over threefold, is achieved. This enhances the reproducibility and quality of perovskite single crystals, leading to reproducible ...
Tatiane Pretto +8 more
wiley +1 more source
On the speed of once-reinforced biased random walk on trees
We study the asymptotic behaviour of once-reinforced biased random walk (ORbRW) on Galton-Watson trees. Here the underlying (unreinforced) random walk has a bias towards or away from the root.
Collevecchio, Andrea +2 more
core +1 more source
The dielectric properties of clays are studied on the level of individual monolayers and functional double stacks. The material breakdown characteristics and charge storage performance are analyzed. For illustration, a defined charge pattern representing a cuneiform character is produced, written into a microscopic clay tile, referencing the origins of
Sebastian Gödrich +6 more
wiley +1 more source
Large deviations of empirical neighborhood distribution in sparse random graphs
Consider the Erd\H{o}s-Renyi random graph on n vertices where each edge is present independently with probability c/n, with c>0 fixed. For large n, a typical random graph locally behaves like a Galton-Watson tree with Poisson offspring distribution with ...
Bordenave, Charles, Caputo, Pietro
core +1 more source
Unleashing the Power of Machine Learning in Nanomedicine Formulation Development
A random forest machine learning model is able to make predictions on nanoparticle attributes of different nanomedicines (i.e. lipid nanoparticles, liposomes, or PLGA nanoparticles) based on microfluidic formulation parameters. Machine learning models are based on a database of nanoparticle formulations, and models are able to generate unique solutions
Thomas L. Moore +7 more
wiley +1 more source

