Large Distinct Part Sizes in a Random Integer Partition

A partition of a positive integer n is a way of writing it as the sum of positive integers without regard to order; the summands are called parts. The number of partitions of n, usually denoted by p(n), is determined asymptotically by the famous partition formula of Hardy and Ramanujan [5]. We shall introduce the uniform probability measure P on the set of all partitions of n assuming that the probability 1/p(n) is assigned to each n-partition. The symbols E and V ar will be further used to denote the expectation and variance with respect to the measure P . Thus, each conceivable numerical characteristic of the parts in a partition can be regarded as a random variable.

The Number of Parts of Given Multiplicity in a Random Integer Partition

2000 Mathematics Subject Classification: 05A16, 05A17.

Search on a fractal lattice using a quantum random walk

The spatial search problem on regular lattice structures in integer number of dimensions d >= 2 has been studied extensively, using both coined and coinless quantum walks. The relativistic Dirac operator has been a crucial ingredient in these studies. Here, we investigate the spatial search problem on fractals of noninteger dimensions. Although the Dirac operator cannot be defined on a fractal, we construct the quantum walk on a fractal using the flip-flop operator that incorporates a Klein-Gordon mode. We find that the scaling behavior of the spatial search is determined by the spectral (and not the fractal) dimension. Our numerical results have been obtained on the well-known Sierpinski gaskets in two and three dimensions.

Lipschitz Correspondence between Metric Measure Spaces and Random Distance Matrices

Given a metric space with a Borel probability measure, for each integer N, we obtain a probability distribution on N x N distance matrices by considering the distances between pairs of points in a sample consisting of N points chosen independently from the metric space with respect to the given measure. We show that this gives an asymptotically bi-Lipschitz relation between metric measure spaces and the corresponding distance matrices. This is an effective version of a result of Vershik that metric measure spaces are determined by associated distributions on infinite random matrices.

The Random Forest Kernel and other kernels for big data from random partitions

We present Random Partition Kernels, a new class of kernels derived by demonstrating a natural connection between random partitions of objects and kernels between those objects. We show how the construction can be used to create kernels from methods that would not normally be viewed as random partitions, such as Random Forest. To demonstrate the potential of this method, we propose two new kernels, the Random Forest Kernel and the Fast Cluster Kernel, and show that these kernels consistently outperform standard kernels on problems involving real-world datasets. Finally, we show how the form of these kernels lend themselves to a natural approximation that is appropriate for certain big data problems, allowing $O(N)$ inference in methods such as Gaussian Processes, Support Vector Machines and Kernel PCA.

Sperm utilization patterns in Gryllus integer (orthoptera: gryllidae

Sperm competition is the competition for fertilizations between ejaculates, within a female, following multiple mating. There are four sperm utilization or precedence patterns: first male precedence, where the first male to mate fertilizes most of the eggs laid by a female; last male precedence, where the last male to mate fertilizes most of the eggs laid by a female; "all-or-none" pattern, where sperm from either male fertilizes all the eggs laid by a female but which male's sperm that is used is random; or sperm mixing, where sperm from each male is used equally in fertilizing eggs laid by a female. Intermediate utilization patterns are also possible. Sperm competition occurs in a wide variety of insect species as well as other animals. This study was undertaken to study sperm competition in the field cricket, Gryllus integer. Four experiments were conducted: a radiation and sterilization experiment, a diapause experiment, and 2 competition experiments. It was found that 7,000 rad of gamma radiation sterilized adult ~ integer males. There was no diapause in the laboratory in ~ integer eggs. In the first competition experiment, three groups of females were used: females mated with a normal male, then with a second normal male (NN group); females mated with a normal male, and then with a sterile male (NR group); and females mated with a sterile male, and then with a normal male (RN group). The results obtained from this experiment showed that the mean proportion of eggs hatched was significantly different between 3 groups of females, with the proportion hatched much greater in the NN group than in either the NR or RN groups. The pattern for the proportion of eggs hatched following a double mating most closely resembled a pattern expected if sperm mixing is occurring. Results obtained in the replicate competition experiment showed that the mean proportion of eggs hatched for the females in the NR group was significantly lower than the proportion hatched in the other two groups. This also supports a model of sperm mixing as a precedence pattern. Values calculated following Boorman and Parker (1976), for the proportion of eggs fertilized by the second male to mate following a double mating, were 0.57 in competition experiment 1 and 0.62 in the replicate. These values indicate that sperm mixing occurs in~ integer.

Sparse partition universal graphs for graphs of bounded degree

In 1983, Chvatal, Trotter and the two senior authors proved that for any Delta there exists a constant B such that, for any n, any 2-colouring of the edges of the complete graph K(N) with N >= Bn vertices yields a monochromatic copy of any graph H that has n vertices and maximum degree Delta. We prove that the complete graph may be replaced by a sparser graph G that has N vertices and O(N(2-1/Delta)log(1/Delta)N) edges, with N = [B`n] for some constant B` that depends only on Delta. Consequently, the so-called size-Ramsey number of any H with n vertices and maximum degree Delta is O(n(2-1/Delta)log(1/Delta)n) Our approach is based on random graphs; in fact, we show that the classical Erdos-Renyi random graph with the numerical parameters above satisfies a stronger partition property with high probability, namely, that any 2-colouring of its edges contains a monochromatic universal graph for the class of graphs on n vertices and maximum degree Delta. The main tool in our proof is the regularity method, adapted to a suitable sparse setting. The novel ingredient developed here is an embedding strategy that allows one to embed bounded degree graphs of linear order in certain pseudorandom graphs. Crucial to our proof is the fact that regularity is typically inherited at a scale that is much finer than the scale at which it is assumed. (C) 2011 Elsevier Inc. All rights reserved.

Magneto-optical probe of quantum Hall states in a wide parabolic well modulated by random potential

Polarized photoluminescence from weakly coupled random multiple well quasi-three-dimensional electron system is studied in the regime of the integer quantum Hall effect. Two quantum Hall ferromagnetic ground states assigned to the uncorrelated miniband quantum Hall state and to the spontaneous interwell phase coherent dimer quantum Hall state are observed. Photoluminescence associated with these states exhibits features caused by finite-size skyrmions: dramatic reduction of the electron spin polarization when the magnetic field is increased past the filling factor nu = 1. The effective skyrmion size is larger than in two-dimensional electron systems.

An integer linear programming approach for bilinear integer programming

We introduce a new Integer Linear Programming (ILP) approach for solving Integer Programming (IP) problems with bilinear objectives and linear constraints. The approach relies on a series of ILP approximations of the bilinear P. We compare this approach with standard linearization techniques on random instances and a set of real-world product bundling problems. (C) 2011 Elsevier B.V. All rights reserved.

A scalarization technique for computing the power and exponential moments of gaussian random matrices

We consider the problems of computing the power and exponential moments EXs and EetX of square Gaussian random matrices X=A+BWC for positive integer s and real t, where W is a standard normal random vector and A, B, C are appropriately dimensioned constant matrices. We solve the problems by a matrix product scalarization technique and interpret the solutions in system-theoretic terms. The results of the paper are applicable to Bayesian prediction in multivariate autoregressive time series and mean-reverting diffusion processes.