High-Precision Entropy Values for Spanning Trees in Lattices

Shrock and Wu have given numerical values for the exponential growth rate of the number of spanning trees in Euclidean lattices. We give a new technique for numerical evaluation that gives much more precise values, together with rigorous bounds on the accuracy. In particular, the new values resolve one of their questions.Comment: 7 pages. Revision mentions alternative approach. Title changed slightly. 2nd revision corrects first displayed equatio

Spanning Trees and bootstrap reliability estimation in correlation based networks

We introduce a new technique to associate a spanning tree to the average linkage cluster analysis. We term this tree as the Average Linkage Minimum Spanning Tree. We also introduce a technique to associate a value of reliability to links of correlation based graphs by using bootstrap replicas of data. Both techniques are applied to the portfolio of the 300 most capitalized stocks traded at New York Stock Exchange during the time period 2001-2003. We show that the Average Linkage Minimum Spanning Tree recognizes economic sectors and sub-sectors as communities in the network slightly better than the Minimum Spanning Tree does. We also show that the average reliability of links in the Minimum Spanning Tree is slightly greater than the average reliability of links in the Average Linkage Minimum Spanning Tree.Comment: 17 pages, 3 figure

Fractal Characterizations of MAX Statistical Distribution in Genetic Association Studies

Two non-integer parameters are defined for MAX statistics, which are maxima of $d$ simpler test statistics. The first parameter, $d_{MAX}$, is the fractional number of tests, representing the equivalent numbers of independent tests in MAX. If the $d$ tests are dependent, $d_{MAX} < d$. The second parameter is the fractional degrees of freedom $k$ of the chi-square distribution $\chi^2_k$ that fits the MAX null distribution. These two parameters, $d_{MAX}$ and $k$, can be independently defined, and $k$ can be non-integer even if $d_{MAX}$ is an integer. We illustrate these two parameters using the example of MAX2 and MAX3 statistics in genetic case-control studies. We speculate that $k$ is related to the amount of ambiguity of the model inferred by the test. In the case-control genetic association, tests with low $k$ (e.g. $k=1$) are able to provide definitive information about the disease model, as versus tests with high $k$ (e.g. $k=2$) that are completely uncertain about the disease model. Similar to Heisenberg's uncertain principle, the ability to infer disease model and the ability to detect significant association may not be simultaneously optimized, and $k$ seems to measure the level of their balance

Grassmann Integral Representation for Spanning Hyperforests

Given a hypergraph G, we introduce a Grassmann algebra over the vertex set, and show that a class of Grassmann integrals permits an expansion in terms of spanning hyperforests. Special cases provide the generating functions for rooted and unrooted spanning (hyper)forests and spanning (hyper)trees. All these results are generalizations of Kirchhoff's matrix-tree theorem. Furthermore, we show that the class of integrals describing unrooted spanning (hyper)forests is induced by a theory with an underlying OSP(1|2) supersymmetry.Comment: 50 pages, it uses some latex macros. Accepted for publication on J. Phys.

Finite size scaling in the 2D XY-model and generalized universality

In recent works (BHP), a generalized universality has been proposed, linking phenomena as dissimilar as 2D magnetism and turbulence. To test these ideas, we performed a MC study of the 2D XY-model. We found that the shape of the probability distribution function for the magnetization M is non Gaussian and independent of the system size --in the range of the lattice sizes studied-- below the Kosterlitz-Thoules temperature. However, the shape of these distributions does depend on the temperature, contrarily to the BHP's claim. This behavior is successfully explained by using an extended finite-size scaling analysis and the existence of bounds for M.Comment: 7 pages, 5 figures. Submitted to Phys. Rev. Lett. Details of changes: 1. We emphasized in the abstract the range of validity of our results. 2. In the last paragraph the temperature dependence of the PDF was slightly re-formulate

Chemical Abundances Of Open Clusters From High-Resolution Infrared Spectra. I. NGC 6940

We present near-infrared spectroscopic analysis of 12 red giant members of the Galactic open cluster NGC 6940. High-resolution (R$\simeq$45000) and high signal-to-noise ratio (S/N > 100) near-infrared H and K band spectra were gathered with the Immersion Grating Infrared Spectrograph (IGRINS) on the 2.7m Smith Telescope at McDonald Observatory. We obtained abundances of H-burning (C, N, O), ${\alpha}$ (Mg, Si, S, Ca), light odd-Z (Na, Al, P, K), Fe-group (Sc, Ti, Cr, Fe, Co, Ni) and neutron-capture (Ce, Nd, Yb) elements. We report the abundances of S, P, K, Ce, and Yb in NGC 6940 for the first time. Many OH and CN features in the H band were used to obtain O and N abundances. C abundances were measured from four different features: CO molecular lines in the K band, high excitation C I lines present in both near-infrared and optical, CH and $C_2$ bands in the optical region. We have also determined $^{12}C/^{13}C$ ratios from the R-branch band heads of first overtone (2-0) and (3-1) $^{12}CO$ (2-0) $^{13}CO$ lines near 23440 \overset{\lower.5em\circ}{\mathrm{A}} and (3-1) $^{13}CO$ lines at about 23730 \overset{\lower.5em\circ}{\mathrm{A}}. We have also investigated the HF feature at 23358.3 \overset{\lower.5em\circ}{\mathrm{A}}, finding solar fluorine abundances without ruling out a slight enhancement. For some elements (such as the ${\alpha}$ group), IGRINS data yield more internally self-consistent abundances. We also revisited the CMD of NGC 6940 by determining the most probable cluster members using Gaia DR2. Finally, we applied Victoria isochrones and MESA models in order to refine our estimates of the evolutionary stages of our targets.Comment: 16 pages, 10 figure

Visually targeted reaching in horse-head grasshoppers

Visually targeted reaching to a specific object is a demanding neuronal task requiring the translation of the location of the object from a two-dimensionsal set of retinotopic coordinates to a motor pattern that guides a limb to that point in three-dimensional space. This sensorimotor transformation has been intensively studied in mammals, but was not previously thought to occur in animals with smaller nervous systems such as insects. We studied horse-head grasshoppers (Orthoptera: Proscopididae) crossing gaps and found that visual inputs are sufficient for them to target their forelimbs to a foothold on the opposite side of the gap. High-speed video analysis showed that these reaches were targeted accurately and directly to footholds at different locations within the visual field through changes in forelimb trajectory and body position, and did not involve stereotyped searching movements. The proscopids estimated distant locations using peering to generate motion parallax, a monocular distance cue, but appeared to use binocular visual cues to estimate the distance of nearby footholds. Following occlusion of regions of binocular overlap, the proscopids resorted to peering to target reaches even to nearby locations. Monocular cues were sufficient for accurate targeting of the ipsilateral but not the contralateral forelimb. Thus, proscopids are capable not only of the sensorimotor transformations necessary for visually targeted reaching with their forelimbs but also of flexibly using different visual cues to target reaches. © 2012 The Royal Society

Dynamical Scaling from Multi-Scale Measurements

We present a new measure of the Dynamical Critical behavior: the "Multi-scale Dynamical Exponent (MDE)"Comment: 9 pages,Latex, Request figures from [email protected]

Cluster Dynamics for Randomly Frustrated Systems with Finite Connectivity

In simulations of some infinite range spin glass systems with finite connectivity, it is found that for any resonable computational time, the saturatedenergy per spin that is achieved by a cluster algorithm is lowered in comparison to that achieved by Metropolis dynamics.The gap between the average energies obtained from these two dynamics is robust with respect to variations of the annealing schedule. For some probability distribution of the interactions the ground state energy is calculated analytically within the replica symmetry assumptionand is found to be saturated by a cluster algorithm.Comment: Revtex, 4 pages with 3 figure