Centered -discrepancy of random sampling and Latin hypercube design, and construction of uniform designs

In this paper properties and construction of designs under a centered version of the -discrepancy are analyzed. The theoretic expectation and variance of this discrepancy are derived for random designs and Latin hypercube designs. The expectation and variance of Latin hypercube designs are significantly lower than that of random designs. While in dimension one the unique uniform design is also a set of equidistant points, low-discrepancy designs in higher dimension have to be generated by explicit optimization. Optimization is performed using the threshold accepting heuristic which produces low discrepancy designs compared to theoretic expectation and variance.

     

Analytical Expressions for Ising Models on High Dimensional Lattices

We use an m-vicinity method to examine Ising models on hypercube lattices of high dimensions d≥3. This method is applicable for both short-range and long-range interactions. We introduce a small parameter, which determines whether the method can be used when calculating the free energy. When we account for interaction with the nearest neighbors only, the value of this parameter depends on the dimension of the lattice d. We obtain an expression for the critical temperature in terms of the interaction constants that is in a good agreement with the results of computer simulations. For d=5,6,7, our theoretical estimates match the numerical results both qualitatively and quantitatively. For d=3,4, our method is sufficiently accurate for the calculation of the critical temperatures; however, it predicts a finite jump of the heat capacity at the critical point. In the case of the three-dimensional lattice (d=3), this contradicts the commonly accepted ideas of the type of the singularity at the critical point. For the four-dimensional lattice (d=4), the character of the singularity is under current discussion. For the dimensions d=1, 2 the m-vicinity method is not applicable.     

Divagations about the periodic table: Boolean hypercube and quantum similarity connections

In this study, several simple aspects associated with the periodic table (PT) of the elements are commented. First, the connection of the PT with the structure of a seven-dimensional Boolean hypercube leads afterward to discuss the nature of those PT elements bearing prime atomic numbers. Second, the use of quantum similarity (QS) to obtain an alternative insight on the PT element relations will be also developed. The foundation of the second part starts admitting that any element of the PT can be attached to a schematic electronic density function, constructed with a single Gaussian function: a Gaussian atomic density function, allowing to consider the PT elements as a set of quantum objects, and permits a straightforward construction of a QS matrix. Such QS scheme can be applied to the whole PT or to any subset of it. Manipulation of the QS matrices attached to any quantum object set allows the evaluation of statistical-like values, acting as coordinates to numerically or graphically represent the chosen PT atomic element sets. © 2019 Wiley Periodicals, Inc.     

A simple mathematical model for seasonal planktonic blooms

We show how the inclusion of the defense strategy by different species can alter the prediction of simple models. One of the defense strategy by the phytoplankton population against their grazer is the release of toxic chemicals. In turn the zooplankton population reduces there predation rate over toxin producing phytoplankton (TPP) to protect themselves from those toxic chemicals. Thus, when the level of toxicity is high, the grazing pressure is low and when the level of toxicity is low or when the toxin is absent, the grazing pressure is high. Here we have considered a TPP–zooplankton system where the rate of toxin liberation and the predation rate vary with zooplankton abundance. We observe that our proposed model has the potential to show different dynamical behaviour that are similar to that seen in real‐world situations. Further, we consider three different functional forms for the distribution of the toxins and compare them using latin hypercube sampling technique and found that the functional forms seem to have no effect in determining the final outcome of the system. Copyright © 2009 John Wiley & Sons, Ltd.     

Routing of 2-D switching networks by their embedding into cubes

The proposed all-optical 2-D switching networks are (i) M×N-gon prism switches (M2, N3) and (ii) 3-D grids of any geometry N3. For the routing we assume (1) the projection of the spatial architectures onto plane graphs (2) the embedding of the latter guest graphs into (in)complete host hypercubes (N=4) and generally, into N-cube networks (N3) and (3) routing by means of the cube algorithms of the host. By the embedding mainly faulty cubes (synonyms: injured cubes, incomplete cubes) arise which complicate the routing and analysis. The application of N-cube networks (i) extend the hypercube principles to any N3 (ii) increase the number of plane host graphs and (iii) reduce the incompleteness of the host cubes. Several different embeddings of the intersection graphs (IGs) of 2-D switching networks and several different routings are explained for N=4 and 6 by various examples. By the expansion of the grids (enlargement) internal waveguides (WGs) and internal switches are introduced which interact with the switches of the original 3-D grid without increasing the number of stages (NS). The embeddings by expansion apply to interconnection networks whereas dilation-2 embeddings (dilation ≡ distance of the nearest-neighbour nodes of the guest graph at the host) are rather suitable for the emulation of algorithms. Concepts for fault-tolerant routing and algorithm mapping are briefly explained.     

Hitting time of large subsets of the hypercube

We study the simple random walk on the n‐dimensional hypercube, in particular its hitting times of large (possibly random) sets. We give simple conditions on these sets ensuring that the properly rescaled hitting time is asymptotically exponentially distributed, uniformly in the starting position of the walk. These conditions are then verified for percolation clouds with densities that are much smaller than (n log n)^‐1. A main motivation behind this article is the study of the so‐called aging phenomenon in the Random Energy Model, the simplest model of a mean‐field spin glass. Our results allow us to prove aging in the REM for all temperatures, thereby extending earlier results to their optimal temperature domain. © 2008 Wiley Periodicals, Inc. Random Struct. Alg., 2008     

Transversals in completely reducible multiary quasigroups and in multiary quasigroups of order 4

An $n$-ary quasigroup $f$ of order $q$ is an $n$-ary operation over a set of cardinality $q$ such that the Cayley table of the operation is an $n$-dimensional latin hypercube of order $q$. A transversal in a quasigroup $f$ (or in the corresponding latin hypercube) is a collection of $q$$(n+1)$-tuples from the Cayley table of $f$, each pair of tuples differing at each position. The problem of transversals in latin hypercubes was posed by Wanless in 2011.An $n$-ary quasigroup $f$ is called reducible if it can be obtained as a composition of two quasigroups whose arity is at least 2, and it is completely reducible if it can be decomposed into binary quasigroups.In this paper we investigate transversals in reducible quasigroups and in quasigroups of order 4. We find a lower bound on the number of transversals for a vast class of completely reducible quasigroups. Next we prove that, except for the iterated group ${\mathbb{Z}}_4$ of even arity, every $n$-ary quasigroup of order 4 has a transversal. Also we obtain a lower bound on the number of transversals in quasigroups of order 4 and odd arity and count transversals in the iterated group ${\mathbb{Z}}_4$ of odd arity and in the iterated group ${\mathbb{Z}}_2^2.$All results of this paper can be regarded as those concerning latin hypercubes.     

LJUNGSKILE: a program for assessing uncertainties in speciation calculations

Speciation calculations are often the base upon which further and more important conclusions are drawn, e.g., solubilities and sorption estimates used for retention of hazardous materials. Since speciation calculations are based on experimentally determined stability constants of the relevant chemical reactions, the measurement and experimental uncertainty in these constants will affect the reliability of the simulation output. The present knowledge of the thermodynamic data relevant for predicting the behaviour of a complex chemical system is quite heterogeneous. In order to predict the impact of these uncertainties on the reliability of a simulation output requires sophisticated modelling codes. In this paper, we will present a computer program, LJUNGSKILE, which utilises the thermodynamic equilibrium code PHREEQC to statistically calculate uncertainties in speciation based on uncertainties in stability constants. A short example is included.     

Decomposing a graph into expanding subgraphs

A paradigm that was successfully applied in the study of both pure and algorithmic problems in graph theory can be colloquially summarized as stating that any graph is close to being the disjoint union of expanders. Our goal in this paper is to show that in several of the instantiations of the above approach, the quantitative bounds that were obtained are essentially best possible. Three examples of our results are the following:

• A classical result of Lipton, Rose and Tarjan from 1979 states that if is a hereditary family of graphs and every graph in has a vertex separator of size , then every graph in has O(n) edges. We construct a hereditary family of graphs with vertex separators of size such that not all graphs in the family have O(n) edges.
• Trevisan and Arora‐Barak‐Steurer have recently shown that given a graph G, one can remove only 1% of its edges to obtain a graph in which each connected component has good expansion properties. We show that in both of these decomposition results, the expansion properties they guarantee are essentially best possible, even when one is allowed to remove 99% of G's edges.
• Sudakov and the second author have recently shown that every graph with average degree d contains an n‐vertex subgraph with average degree at least and vertex expansion . We show that one cannot guarantee a better vertex expansion even if allowing the average degree to be O(1).

The above results are obtained as corollaries of a new family of graphs which we construct in this paper. These graphs have a super‐linear number of edges and nearly logarithmic girth, yet each of their subgraphs has (optimally) poor expansion properties.     

n维超立方体的层次结构模型

本文首次提出了 n维超立方体的层次结构模型 HHC,详细讨论了该结构中结点的分布及各结点的连接关系 .并利用 HHC,讨论了超立方体非对称比较模型的最优诊断算法 ,极大独立点集等问题