Biomedical subjects

Bo Söderberg

Publications and source records attributed to Bo Söderberg.

5 recordsLinked to original sources

PubMed2005

Improved algorithm for simulations of divergent-light halos.

Divergent-light halos are produced when light from nearby light sources is scattered by ice crystals in the atmosphere. We present a theory of divergent-light halos leading to an improved algorithm for the simulation of such halos. Contrary to the algorithm that we presented earlier for simulating such halos, the new algorithm includes a mathematically rigorous weighting of the events. The computer implementation is very compact, and the whole procedure is elegant and conceptually easy to understand. We also present a new simulation atlas showing halos produced by crystals of different shapes and orientations for a set of elevations of the light source.

Journal Article↗

PubMed2003

Properties of random graphs with hidden color.

We investigate in some detail a recently suggested general class of ensembles of sparse undirected random graphs based on a hidden stub coloring, with or without the restriction to nondegenerate graphs. The calculability of local and global structural properties of graphs from the resulting ensembles is demonstrated. Cluster size statistics are derived with generating function techniques, yielding a well-defined percolation threshold. Explicit rules are derived for the enumeration of small subgraphs. Duality and redundancy is discussed, and subclasses corresponding to commonly studied models are identified.

Journal Article↗

PubMed2003

Random graphs with hidden color.

We propose and investigate a unifying class of sparse random graph models, based on a hidden coloring of edge-vertex incidences, extending an existing approach, random graphs with a given degree distribution, in a way that admits a nontrivial correlation structure in the resulting graphs. The approach unifies a number of existing random graph ensembles within a common general formalism, and allows for the analytic calculation of observable graph characteristics. In particular, generating function techniques are used to derive the size distribution of connected components (clusters) as well as the location of the percolation threshold where a giant component appears.

Journal Article↗

PubMed2003

An approximate maximum likelihood approach, applied to phylogenetic trees.

A novel type of approximation scheme to the maximum likelihood (ML) approach is presented and discussed in the context of phylogenetic tree reconstruction from aligned DNA sequences. It is based on a parameterized approximation to the conditional distribution of hidden variables (related, e.g., to the sequences of unobserved branch point ancestors) given the observed data. A modified likelihood, based on the extended data, is then maximized with respect to the parameters of the model as well as to those involved in the approximation. With a suitable form of the approximation, the proposed method allows for simpler updating of the parameters, at the cost of an increased parameter count and a slight decrease in performance. The method is tested on phylogenetic tree reconstruction from artificially generated sequences, and its performance is compared to that of ML, showing that the approach is competitive for reasonably similar sequences. The method is also applied to real DNA sequences from primates, yielding a result consistent with those obtained by other standard algorithms.

Animals↗

PubMed2002

General formalism for inhomogeneous random graphs.

We present and investigate an extension of the classical random graph to a general class of inhomogeneous random graph models, where vertices come in different types, and the probability of realizing an edge depends on the types of its terminal vertices. This approach provides a general framework for the analysis of a large class of models. The generic phase structure is derived using generating function techniques, and relations to other classes of models are pointed out.

Journal Article↗