No abstract

We present a method for minimizing additive potential-energy functions. Our hidden-force algorithm can be described as an intricate multiplayer tug-of-war game in which teams try to break an impasse by randomly assigning some players to drop their ropes while the others are still tugging until a partial impasse is reached, then, instructing the dropouts to resume tugging, for all teams to come to a new overall impasse. Utilizing our algorithm in a non-Markovian parallel Monte Carlo search, we found 17 new putative global minima for binary Lennard-Jones clusters in the size range of 90-100 particles. The method is efficient enough that an unbiased search was possible; no potential-energy surface symmetries were exploited. All new minima are comprised of three nested polyicosahedral or polytetrahedral shells when viewed as a nested set of Connolly surfaces (though the shell structure has previously gone unscrutinized, known minima are often qualitatively similar). Unlike known minima, in which the outer and inner shells are comprised of the larger and smaller atoms, respectively, in 13 of the new minima, the atoms are not as clearly separated by size. Furthermore, while some known minima have inner shells stabilized by larger atoms, four of the new minima have outer shells stabilized by smaller atoms.

The theory of limits of dense graph sequences was initiated by Lovász and Szegedy in [8]. We give a possible generalization of this theory to multigraphs. Our proofs are based on the correspondence between dense graph limits and countable, exchangeable arrays of random variables observed by Diaconis and Janson in [5]. The main ingredient in the construction of the limit object is Aldous' representation theorem for exchangeable arrays, see [1].

Abstract. This paper studies Random and Evolving Apollonian networks (RANs and EANs), in d dimension for any d ≥ 2, i.e. dynamically evolving random d dimensional simplices looked as graphs inside an initial d-dimensional simplex. We determine the limiting degree distribution in RANs and show that it follows a power law tail with exponent τ = (2d − 1)/(d − 1). We further show that the degree distribution in EANs converges to the same degree distribution if the simplex-occupation parameter in the nth step of the dynamics is qn → 0 and ∞ n=0 qn = ∞. This result gives a rigorous proof for the conjecture of Zhang et al [31] that EANs tend to show similar behavior as RANs once the occupation parameter q → 0. We also determine the asymptotic behavior of shortest paths in RANs and EANs for arbitrary d dimensions. For RANs we show that the shortest path between two uniformly chosen vertices (typical distance), the flooding time of a uniformly picked vertex and the diameter of the graph after n steps all scale as constant times log n. We determine the constants for all three cases and prove a central limit theorem for the typical distances. We prove a similar CLT for typical distances in EANs.

We study the pointwise regularity of zipper fractal curves generated by affine mappings. Under the assumption of dominated splitting of index-1, we calculate the Hausdorff dimension of the level sets of the pointwise Hölder exponent for a subinterval of the spectrum. We give an equivalent characterization for the existence of regular pointwise Hölder exponent for Lebesgue almost every point. In this case, we extend the multifractal analysis to the full spectrum. In particular, we apply our results for de Rham's curve.