Finite size effects in epidemic spreading: the problem of overpopulated systems

In this paper we analyze the impact of network size on the dynamics of epidemic spreading. In particular, we investigate the pace of infection in overpopulated systems. In order to do that, we design a model for epidemic spreading on a finite complex network with a restriction to at most one contamination per time step, which can serve as a model for sexually transmitted diseases spreading in some student communes. Because of the highly discrete character of the process, the analysis cannot use the continuous approximation widely exploited for most models. Using a discrete approach, we investigate the epidemic threshold and the quasi-stationary distribution. The main results are two theorems about the mixing time for the process: it scales like the logarithm of the network size and it is proportional to the inverse of the distance from the epidemic threshold.     

Fixed-point index for compositions of set-valued maps with proximally ∞-connected values on arbitrary ANR's

In the paper the integer-valued fixed-point index theory for compositions of set-valued maps having proximally ∞-connected values satisfying all the axioms of a fixed point index is presented. The considered approach is based on the technique of single-valued approximation on the graph.     

GC-MS Study of the Products Cleaved from RP-18 Chemically Bonded Phases for TLC During Thermal Modification

JPC – Journal of Planar Chromatography – Modern TLC -     

Approximative compactness and continuity of metric projector in Banach spaces and applications

First we prove that the approximative compactness of a nonempty set C in a normed linear space can be reformulated equivalently in another way.It is known that if C is a semi-Chebyshev closed and approximately compact set in a Banach space X,then the metric projectorπC from X onto C is continuous.Under the assumption that X is midpoint locally uniformly rotund,we prove that the approximative compactness of C is also necessary for the continuity of the projectorπC by the method of geometry of Banach spaces.Using this general result we find some necessary and sufficient conditions for T to have a continuous Moore-Penrose metric generalized inverse T~ ,where T is a bounded linear operator from an approximative compact and a rotund Banach space X into a midpoint locally uniformly rotund Banach space Y.     

Additivity for the parametrized topological Euler characteristic and Reidemeister torsion

Dwyer, Weiss, and Williams have recently defined the notions of the parametrized topological Euler characteristic and the parametrized topological Reidemeister torsion which are invariants of bundles of compact topological manifolds. We show that these invariants satisfy additivity formulas paralleling the additive properties of the classical Euler characteristic and the Reidemeister torsion of CW-complexes.     

On the Joint Path Length Distribution in Random Binary Trees

During the 10th Seminar on Analysis of Algorithms , MSRI, Berkeley, June 2004, Knuth posed the problem of analyzing the left and the right path length in a random binary tree. In particular, Knuth asked about properties of the generating function of the joint distribution of the left and the right path lengths. In this paper, we mostly focus on the asymptotic properties of the distribution of the difference between the left and the right path lengths. Among other things, we show that the Laplace transform of the appropriately normalized moment generating function of the path difference satisfies the first Painlevé transcendent . This is a nonlinear differential equation that has appeared in many modern applications, from nonlinear waves to random matrices. Surprisingly, we find out that the difference between path lengths is of the order n ^5/4 where n is the number of nodes in the binary tree. This was also recently observed by Marckert and Janson. We present precise asymptotics of the distribution's tails and moments. We will also discuss the joint distribution of the left and right path lengths. Throughout, we use methods of analytic algorithmics such as generating functions and complex asymptotics, as well as methods of applied mathematics such as the Wentzel, Kramers, Brillouin (WKB) method.