Search results for "Data structure"
showing 10 items of 441 documents
Spanning Trees and bootstrap reliability estimation in correlation based networks
2007
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 …
ASOHF: a new adaptive spherical overdensity halo finder
2010
We present and test a new halo finder based on the spherical overdensity (SO) method. This new adaptive spherical overdensity halo finder (ASOHF) is able to identify dark matter haloes and their substructures (subhaloes) down to the scales allowed by the analysed simulations. The code has been especially designed for the adaptive mesh refinement cosmological codes, although it can be used as a stand-alone halo finder for N-body codes. It has been optimised for the purpose of building the merger tree of the haloes. In order to verify the viability of this new tool, we have developed a set of bed tests that allows us to estimate the performance of the finder. Finally, we apply the halo finder…
A programming guide for tensor networks with global SU(2) symmetry
2020
Abstract This paper is a manual with tips and tricks for programming tensor network algorithms with global S U ( 2 ) symmetry. We focus on practical details that are many times overlooked when it comes to implementing the basic building blocks of codes, such as useful data structures to store the tensors, practical ways of manipulating them, and adapting typical functions for symmetric tensors. Here we do not restrict ourselves to any specific tensor network method, but keep always in mind that the implementation should scale well for simulations of higher-dimensional systems using, e.g., Projected Entangled Pair States, where tensors with many indices may show up. To this end, the structur…
Oscillations, neutrino masses and scales of new physics
1999
We show that all the available experimental information involving neutrinos can be accounted for within the framework of already existing models where neutrinos have zero mass at tree level, but obtain a small Dirac mass by radiative corrections.
Coherent quantum evolution via reservoir driven holonomies.
2006
We show that in the limit of a strongly interacting environment a system initially prepared in a decoherence-free subspace (DFS) coherently evolves in time, adiabatically following the changes of the DFS. If the reservoir cyclicly evolves in time, the DFS states acquire a holonomy.
"Table 17" of "Search for a Heavy Neutral Particle Decaying to $e\mu$, $e\tau$, or $\mu\tau$ in $pp$ Collisions at $\sqrt{s}=8$ TeV with the ATLAS De…
2015
Cut flow for signal $\tilde{\nu}_{\tau}$ and Z' at 1TeV mass point.
A Constructive Arboricity Approximation Scheme
2020
The arboricity \(\varGamma \) of a graph is the minimum number of forests its edge set can be partitioned into. Previous approximation schemes were nonconstructive, i.e., they approximate the arboricity as a value without computing a corresponding forest partition. This is because they operate on pseudoforest partitions or the dual problem of finding dense subgraphs.
On the Influence of PRNGs on Data Distribution
2012
The amount of digital information produced grows rapidly and constantly. Storage systems use clustered architectures designed to store and process this information efficiently. Their use introduces new challenges in storage systems development, like load-balancing and data distribution. A variety of randomized solutions handling data placement issues have been proposed and utilized. However, to the best of our knowledge, there has not yet been a structured analysis of the influence of pseudo random number generators (PRNGs) on the data distribution. In the first part of this paper we consider Consistent Hashing [1] as a combination of two consecutive phases: distribution of bins and distrib…
Analyticity of a restricted formality
2020
International audience; The Kontsevich formality can be viewed as a non-linear map ℱ from the L∞ algebra of poly-vector fields on ℝd to the space of poly-differential operators. The space of the half-homogenous poly-vector fields is a sub-L∞ algebra. We prove here that the restriction of ℱto this subspace is weakly analytic.
The Tensor Networks Anthology: Simulation techniques for many-body quantum lattice systems
2019
We present a compendium of numerical simulation techniques, based on tensor network methods, aiming to address problems of many-body quantum mechanics on a classical computer. The core setting of this anthology are lattice problems in low spatial dimension at finite size, a physical scenario where tensor network methods, both Density Matrix Renormalization Group and beyond, have long proven to be winning strategies. Here we explore in detail the numerical frameworks and methods employed to deal with low-dimension physical setups, from a computational physics perspective. We focus on symmetries and closed-system simulations in arbitrary boundary conditions, while discussing the numerical dat…