Book Review:Brownian Agents and Active Particles. F. Schweitzer,Springer, Berlin, 2003

Journal of Statistical Physics -     

Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width

The Multicut problem can be defined as: given a graph G and a collection of pairs of distinct vertices {s_i,t_i} of G, find a minimum set of edges of G whose removal disconnects each s_i from the corresponding t_i. Multicut is known to be NP-hard and Max SNP-hard even when the input graph is restricted to being a tree. The main result of the paper is a polynomial-time approximation scheme (PTAS) for Multicut in unweighted graphs with bounded degree and bounded tree-width. That is, for any ε>0, we present a polynomial-time (1+ε)-approximation algorithm. In the particular case when the input is a bounded-degree tree, we have a linear-time implementation of the algorithm. We also provide some hardness results: we prove that Multicut is still NP-hard for binary trees and that it is Max SNP-hard if we drop any of the three conditions (unweighted, bounded-degree, bounded tree-width). Finally we show that some of these results extend to the vertex version of Multicut and to a directed version of Multicut.     

Promiscuity in Antibody Catalysis: Esterolytic Activity of the Decarboxylase 21D8

The high structural similarity of decarboxylase antibody 21D8 and esterase antibody 48G7 suggests that 21D8 might also possess hydrolytic activity. Kinetic investigations show that 21D8 does promote the selective hydrolysis of methyl 4‐nitrophenyl carbonate and sodium 4‐(acetoxy)benzenesulfonate with catalytic proficiencies (k_cat/K_m)/k_un of ca. 10⁵ M ^?1. The ability of 21D8 to accelerate a reaction for which it was not developed suggests that certain antibody scaffolds are intrinsically predisposed toward catalysis, a property that can be enhanced and refined during affinity maturation in response to a transition‐state analog. At the same time, however, the restricted structural diversity of the immune system may ultimately limit the catalytic efficiency that can be achieved.     

Total Positivity Properties of Generalized Hypergeometric Functions of Matrix Argument

In multivariate statistical analysis, several authors have studied the total positivity properties of the generalized (₀ F ₁) hypergeometric function of two real symmetric matrix arguments. In this paper, we make use of zonal polynomial expansions to obtain a new proof of a result that these ₀ F ₁functions fail to satisfy certain pairwise total positivity properties; this proof extends both to arbitrary generalized ( _r F _s ) functions of two matrix arguments and to the generalized hypergeometric functions of Hermitian matrix arguments. In the case of the generalized hypergeometric functions of two Hermitian matrix arguments, we prove that these functions satisfy certain modified pairwise TP₂properties; the proofs of these results are based on Sylvester's formula for compound determinants and the condensation formula of C. L. Dodgson [Lewis Carroll] (1866).     

Nonlinear dynamics of charged particles interacting with combined ac-dc electromagnetic fields

A nonlinear Lorenz model describing interactions between charged particles and combined ac-dc electromagnetic fields is studied for various combinations of frequencies, field strengths and relative angle (θ) between the ac and dc magnetic fields. Strong directional effects on the magnitude and location of resonant particle motion are observed when θ is varied and the regular resonance windows in the aligned field (θ = 0) and linear version of the model studied previously by Durney etaal., break up to form irregular and less well pronounced regions of large and small particle displacements when nonlinearities are taken into account. The length of time takne to achieve resonant behaviour also becomes larger and more variable when nonlinearities are present. The possible relevance of these effects to interactions between electromagnetic fields and biological media is briefly discussed.     

Partition Lattice q-Analogs Related to q-Stirling Numbers

We construct a family of partially ordered sets (posets) that are q-analogs of the set partition lattice. They are different from the q-analogs proposed by Dowling [5]. One of the important features of these posets is that their Whitney numbers of the first and second kind are just the q-Stirling numbers of the first and second kind, respectively. One member of this family [4] can be constructed using an interpretation of Milne [9] for S[n, k] as sequences of lines in a vector space over the Galois field F _q. Another member is constructed so as to mirror the partial order in the subspace lattice.     

The dominating number of a random cubic graph

We show that if G is a random 3-regular graph on n vertices, then its dominating number, D(G), almost surely satisfies .2636n ≤ D(G) ≤ .3126n. © 1995 John Wiley & Sons, Inc.     

Generalized solutions of a class of nuclear-space-valued stochastic evolution equations

Generalized solutions are defined for stochastic evolution equations of the formdY _t =A ^* Y _t dt + dZ _t on the nuclear triplel(R ^d ) L²(R ^d ) l(R ^d ), whereA does not mapl(R ^d ) into itself. One case which is treated in detail involvesA = –(–) ^/2 ,0 < < 2. This example arises as the Langevin equation for the fluctuation limit of a system of particles migrating according to a symmetric stable process and undergoing critical branching in a random medium.The research of D. A. Dawson was supported by the Natural Sciences and Engineering Research Council of Canada. L. G. Gorostiza's research was supported in part by CONACyT Grants PCEXCNA-040319 and 140102 G203-006, Mexico.     

Consistency of decision processes

If a statistical or a voting decision procedure is used by several subpopulations and if each reaches an identical conclusion, then one might expect this conclusion to be the outcome for the full group. It is shown that this property fails to hold for large classes of decision procedures. The geometric reasons why the consistency does not hold are described. A general theorem is given to characterize the procedures that satisfy this property of weak consistency.This research was supported in part by NSF Grant IRI-8803505 and a Guggenheim Fellowship. Also, the author thanks a referee for some comments that stimulated certain revisions.