Universality in numerical computations with random data.
Ontology highlight
ABSTRACT:
SUBMITTER: Deift PA
PROVIDER: S-EPMC4210305 | biostudies-other | 2014 Oct
REPOSITORIES: biostudies-other
Similar Datasets
Project description:The diffusion of solutes in two-dimensional random media is important in diverse physical situations including the dynamics of proteins in crowded cell membranes and the adsorption on nano-structured substrates. It has generally been thought that the diffusion constant, D, should display universal behavior near the percolation threshold, i.e., D ~ (ϕ - ϕc)μ, where ϕ is the area fraction of the matrix, ϕc is the value of ϕ at the percolation threshold, and μ is the dynamic exponent. The universality of μ is important because it implies that very different processes, such as protein diffusion in membranes and the electrical conductivity in two-dimensional networks, obey similar underlying physical principles. In this work we demonstrate, using computer simulations on a model system, that the exponent μ is not universal, but depends on the microscopic nature of the dynamics. We consider a hard disc that moves via random walk in a matrix of fixed hard discs and show that μ depends on the maximum possible displacement Δ of the mobile hard disc, ranging from 1.31 at Δ ≤ 0.1 to 2.06 for relatively large values of Δ. We also show that this behavior arises from a power-law singularity in the distribution of transition rates due to a failure of the local equilibrium approximation. The non-universal value of μ obeys the prediction of the renormalization group theory. Our simulations do not, however, exclude the possibility that the non-universal values of μ might be a crossover between two different limiting values at very large and small values of Δ. The results allow one to rationalize experiments on diffusion in two-dimensional systems.
| S-EPMC6342955 | biostudies-literature
Project description:BACKGROUND:Numerical anchoring occurs when exposure to a numeric quantity influences a person's subsequent judgment involving other quantities. This could be applicable to the evaluation of pain, where exposure to an unrelated number before the evaluation of pain could influence pain ratings. OBJECTIVE:This study aimed to determine whether exposure to a random numeric anchor influences subsequent pain intensity ratings of a hypothetical patient. METHODS:In this study, 385 participants read a vignette describing a patient with chronic pain before being randomly assigned to one of four groups. Groups 1 and 2 spun an 11-wedge number wheel (0-10), which was, unbeknown to the participants, programmed to stop on a high number (8) or a low number (2), respectively. Group 3 spun a similar letter wheel (A-K), which was programmed to stop on either the letter C or I (control 1). Group 4 did not spin a wheel (control 2). Participants were then asked to rate the patient's pain intensity using a 0 to 10 numeric rating scale. RESULTS:The high-number group rated the patient's pain (median 8, IQR 2) significantly higher than the letter wheel control (median 7, IQR 2; P=.02) and the low-number group (median 6, IQR 2; P<.001). The low-number group rated the pain significantly lower than controls 1 and 2 (median 7, IQR 2; both P=.045). CONCLUSIONS:Pain ratings were influenced by prior exposure to a random number with no relevant information about the patient's pain, indicating anchoring had occurred. However, contrary to the traditional definition of anchoring where anchoring occurs even when participants are unaware of the anchor's influence, in this study, the anchoring effect was seen only in participants who believed that the anchor had influenced them. This suggests that anchoring effects could potentially occur among health care providers tasked with evaluating a patient's pain and should be evaluated further.
| S-EPMC7091028 | biostudies-literature
Project description:Pedigree inference, for example determining whether two persons are second cousins or unrelated, can be done by comparing their genotypes at a selection of genetic markers. When the data for one or more of the persons is from low-coverage next generation sequencing (lcNGS), currently available computational methods either ignore genetic linkage or do not take advantage of the probabilistic nature of lcNGS data, relying instead on first estimating the genotype. We provide a method and software (see familias.name/lcNGS) bridging the above gap. Simulations indicate how our results are considerably more accurate compared to some previously available alternatives. Our method, utilizing a version of the Lander-Green algorithm, uses a group of symmetries to speed up calculations. This group may be of further interest in other calculations involving linked loci.
| S-EPMC9999603 | biostudies-literature
Project description:The open XML format mzML, used for representation of MS data, is pivotal for the development of platform-independent MS analysis software. Although conversion from vendor formats to mzML must take place on a platform on which the vendor libraries are available (i.e. Windows), once mzML files have been generated, they can be used on any platform. However, the mzML format has turned out to be less efficient than vendor formats. In many cases, the naïve mzML representation is fourfold or even up to 18-fold larger compared with the original vendor file. In disk I/O limited setups, a larger data file also leads to longer processing times, which is a problem given the data production rates of modern mass spectrometers. In an attempt to reduce this problem, we here present a family of numerical compression algorithms called MS-Numpress, intended for efficient compression of MS data. To facilitate ease of adoption, the algorithms target the binary data in the mzML standard, and support in main proteomics tools is already available. Using a test set of 10 representative MS data files we demonstrate typical file size decreases of 90% when combined with traditional compression, as well as read time decreases of up to 50%. It is envisaged that these improvements will be beneficial for data handling within the MS community.
| S-EPMC4047472 | biostudies-literature
Project description:We present psi-square, a program for searching the space of gene vectors. The program starts with a gene vector, i.e., the set of measurements associated with a gene, and finds similar vectors, derives a probabilistic model of these vectors, then repeats search using this model as a query, and continues to update the model and search again, until convergence. When applied to three different pathway-discovery problems, psi-square was generally more sensitive and sometimes more specific than the ad hoc methods developed for solving each of these problems before.
| S-EPMC1489924 | biostudies-literature
Project description:The increasing use of diary methods calls for the development of appropriate statistical methods. For the resulting panel data, latent Markov models can be used to model both individual differences and temporal dynamics. The computational burden associated with these models can be overcome by exploiting the conditional independence relations implied by the model. This is done by associating a probabilistic model with a directed acyclic graph, and applying transformations to the graph. The structure of the transformed graph provides a factorization of the joint probability function of the manifest and latent variables, which is the basis of a modified and more efficient E-step of the EM algorithm. The usefulness of the approach is illustrated by estimating a latent Markov model involving a large number of measurement occasions and, subsequently, a hierarchical extension of the latent Markov model that allows for transitions at different levels. Furthermore, logistic regression techniques are used to incorporate restrictions on the conditional probabilities and to account for the effect of covariates. Throughout, models are illustrated with an experience sampling methodology study on the course of emotions among anorectic patients.
| S-EPMC2799005 | biostudies-other
Project description:Despite significant advances in characterizing the structural properties of complex networks, a mathematical framework that uncovers the universal properties of the interplay between the topology and the dynamics of complex systems continues to elude us. Here we develop a self-consistent theory of dynamical perturbations in complex systems, allowing us to systematically separate the contribution of the network topology and dynamics. The formalism covers a broad range of steady-state dynamical processes and offers testable predictions regarding the system's response to perturbations and the development of correlations. It predicts several distinct universality classes whose characteristics can be derived directly from the continuum equation governing the system's dynamics and which are validated on several canonical network-based dynamical systems, from biochemical dynamics to epidemic spreading. Finally, we collect experimental data pertaining to social and biological systems, demonstrating that we can accurately uncover their universality class even in the absence of an appropriate continuum theory that governs the system's dynamics.
| S-EPMC3852675 | biostudies-literature
Project description:Prediction for social systems is a major challenge. Universality at the social level has inspired a unified theory for urban living but individual variation makes predicting relationships within societies difficult. Here, we show that in ant societies individual average speed is higher when event duration is longer. Expressed as a single scaling function, this relationship is universal because for any event duration an ant, on average, moves at the corresponding average speed except for a short acceleration and deceleration at the beginning and end. This establishes cause and effect within a social system and may inform engineering and control of artificial ones.
| S-EPMC4277088 | biostudies-literature
Project description:The shape of fragments generated by the breakup of solids is central to a wide variety of problems ranging from the geomorphic evolution of boulders to the accumulation of space debris orbiting Earth. Although the statistics of the mass of fragments has been found to show a universal scaling behavior, the comprehensive characterization of fragment shapes still remained a fundamental challenge. We performed a thorough experimental study of the problem fragmenting various types of materials by slowly proceeding weathering and by rapid breakup due to explosion and hammering. We demonstrate that the shape of fragments obeys an astonishing universality having the same generic evolution with the fragment size irrespective of materials details and loading conditions. There exists a cutoff size below which fragments have an isotropic shape, however, as the size increases an exponential convergence is obtained to a unique elongated form. We show that a discrete stochastic model of fragmentation reproduces both the size and shape of fragments tuning only a single parameter which strengthens the general validity of the scaling laws. The dependence of the probability of the crack plan orientation on the linear extension of fragments proved to be essential for the shape selection mechanism.
| S-EPMC4360630 | biostudies-literature
Project description:We develop a model to predict the fragmentation limit of drops colliding off-centre. The prediction is excellent over a wide range of liquid properties and it can be used without adjusting any parameter. The so-called stretching separation is attributed to the extension of the merged drop above a critical aspect ratio of 3.25. The evolution of this aspect ratio is influenced by the liquid viscosity and can be interpreted via an energy balance. This approach is then adapted to drop-jet collisions, which we model as consecutive drop-drop collisions. The fragmentation criterion is similar to the one observed for drop-drop collisions, while the evolution of the stretched jet aspect ratio is modified to account for the different flow fields and geometry.
| S-EPMC7612479 | biostudies-literature