Related papers: Saving fractional bits: A practical entropy effici…
A game-theoretic model of scrip (artificial currency) systems is analyzed. It is shown that relative entropy can be used to characterize the distribution of agent wealth when all agents use threshold strategies---that is, they volunteer to…
We compute the entropy of systems of quantum particles satisfying the fractional exclusion statistics in the space-time of 2+1 dimensional black hole by using the brick-wall method. We show that the entropy of each effective quantum field…
We investigate the efficiency of several types of continued fraction expansions of a number in the unit interval using a generalization of Lochs theorem from 1964. Thus, we aimed to compare the efficiency by describing the rate at which the…
This paper presents a novel structure-preserving scheme for Euler equations, focusing on the numerical conservation of entropy and kinetic energy. Explicit flux functions engineered to conserve entropy are introduced within the…
A cluster algorithm is presented for the simulation of the q-state Potts models in which the number of spins is conserved in each state. The algorithm constructs Fortuin-Kasteleyn cluster configurations from spin configurations, in a way…
In high energy physics experiment trigger systems, block memories are utilized for various purposes, especially in binned searching algorithms. In these algorithms, the storages are demanded to perform like a large set of registers. The…
Discretizing an analytic function on a uniform real-space grid is often done via a straightforward collocation method. This is ubiquitous in all areas of computational physics and quantum chemistry. An example in Density Functional Theory…
Finite volume methods are proposed for computing approximate pathwise entropy/kinetic solutions to conservation laws with a rough path dependent flux function. For a convex flux, it is demonstrated that rough path oscillations may lead to…
For the implementation of a quantum computer it is necessary to exercise complete control over the Hamiltonian of the used physical system. For NMR quantum computing the effectively acting Hamiltonian can be manipulated via pulse sequences.…
The folding entropy is a quantity originally proposed by Ruelle in 1996 during the study of entropy production in the non-equilibrium statistical mechanics. As derived through a limiting process to the non-equilibrium steady state, the…
Coin-flipping is a fundamental task in two-party cryptography where two remote mistrustful parties wish to generate a shared uniformly random bit. While quantum protocols promising near-perfect security exist for weak coin-flipping -- when…
In this article, we define an information-theoretic entropy based on the Ihara zeta function of a graph which is called the Ihara entropy. A dynamical system consists of a billiard ball and a set of reflectors correspond to a combinatorial…
We study how black hole entropy is generated and the role it plays in several highly dynamical processes: the decay of unstable black strings and ultraspinning black holes; the fusion of two rotating black holes; and the subsequent fission…
We introduce a methodology for seeking conservation laws within a Hamiltonian dynamical system, which we term ``neural deflation''. Inspired by deflation methods for steady states of dynamical systems, we propose to {iteratively} train a…
The performance of active learning algorithms can be improved in two ways. The often used and intuitive way is by reducing the overall error rate within the test set. The second way is to ensure that correct predictions are not forgotten…
We investigate the utility of employing multiple buffers in solving a class of rearrangement problems with pick-n-swap manipulation primitives. In this problem, objects stored randomly in a lattice are to be sorted using a robot arm with…
We introduce an algorithm which estimates the number of circuits in a graph as a function of their length. This approach provides analytical results for the typical entropy of circuits in sparse random graphs. When applied to real-world…
We compare real and complex dynamics for automorphisms of rational surfaces that are obtained by lifting \chg{some} quadratic birational maps of the plane. In particular, we show how to exploit the existence of an invariant cubic curve to…
We present a new Monte Carlo algorithm that produces results of high accuracy with reduced simulational effort. Independent random walks are performed (concurrently or serially) in different, restricted ranges of energy, and the resultant…
Non-equilibrium stochastic dynamics of several active Brownian systems are modeled in terms of non-linear velocity dependent force. In general, this force may consist of both even and odd functions of velocity. We derive the expression for…