1,058 research outputs found
Information-Based Physics: An Observer-Centric Foundation
It is generally believed that physical laws, reflecting an inherent order in
the universe, are ordained by nature. However, in modern physics the observer
plays a central role raising questions about how an observer-centric physics
can result in laws apparently worthy of a universal nature-centric physics.
Over the last decade, we have found that the consistent apt quantification of
algebraic and order-theoretic structures results in calculi that possess
constraint equations taking the form of what are often considered to be
physical laws. I review recent derivations of the formal relations among
relevant variables central to special relativity, probability theory and
quantum mechanics in this context by considering a problem where two observers
form consistent descriptions of and make optimal inferences about a free
particle that simply influences them. I show that this approach to describing
such a particle based only on available information leads to the mathematics of
relativistic quantum mechanics as well as a description of a free particle that
reproduces many of the basic properties of a fermion. The result is an approach
to foundational physics where laws derive from both consistent descriptions and
optimal information-based inferences made by embedded observers.Comment: To be published in Contemporary Physics. The manuscript consists of
43 pages and 9 Figure
Gossip on Weighted Networks
We investigate how suitable a weighted network is for gossip spreading. The
proposed model is based on the gossip spreading model introduced by Lind et.al.
on unweighted networks. Weight represents "friendship." Potential spreader
prefers not to spread if the victim of gossip is a "close friend". Gossip
spreading is related to the triangles and cascades of triangles. It gives more
insight about the structure of a network.
We analyze gossip spreading on real weighted networks of human interactions.
6 co-occurrence and 7 social pattern networks are investigated. Gossip
propagation is found to be a good parameter to distinguish co-occurrence and
social pattern networks. As a comparison some miscellaneous networks and
computer generated networks based on ER, BA, WS models are also investigated.
They are found to be quite different than the human interaction networks.Comment: 8 pages, 4 figures, 1 tabl
Self-avoiding walks crossing a square
We study a restricted class of self-avoiding walks (SAW) which start at the
origin (0, 0), end at , and are entirely contained in the square on the square lattice . The number of distinct
walks is known to grow as . We estimate as well as obtaining strict upper and lower bounds,
We give exact results for the number of SAW of
length for and asymptotic results for .
We also consider the model in which a weight or {\em fugacity} is
associated with each step of the walk. This gives rise to a canonical model of
a phase transition. For the average length of a SAW grows as ,
while for it grows as
. Here is the growth constant of unconstrained SAW in . For we provide numerical evidence, but no proof, that the
average walk length grows as .
We also consider Hamiltonian walks under the same restriction. They are known
to grow as on the same lattice. We give
precise estimates for as well as upper and lower bounds, and prove that
Comment: 27 pages, 9 figures. Paper updated and reorganised following
refereein
Pseudorandom Number Generators and the Square Site Percolation Threshold
A select collection of pseudorandom number generators is applied to a Monte
Carlo study of the two dimensional square site percolation model. A generator
suitable for high precision calculations is identified from an application
specific test of randomness. After extended computation and analysis, an
ostensibly reliable value of pc = 0.59274598(4) is obtained for the percolation
threshold.Comment: 11 pages, 6 figure
A Potential Foundation for Emergent Space-Time
We present a novel derivation of both the Minkowski metric and Lorentz
transformations from the consistent quantification of a causally ordered set of
events with respect to an embedded observer. Unlike past derivations, which
have relied on assumptions such as the existence of a 4-dimensional manifold,
symmetries of space-time, or the constant speed of light, we demonstrate that
these now familiar mathematics can be derived as the unique means to
consistently quantify a network of events. This suggests that space-time need
not be physical, but instead the mathematics of space and time emerges as the
unique way in which an observer can consistently quantify events and their
relationships to one another. The result is a potential foundation for emergent
space-time.Comment: The paper was originally titled "The Physics of Events: A Potential
Foundation for Emergent Space-Time". We changed the title (and abstract) to
be more direct when the paper was accepted for publication at the Journal of
Mathematical Physics. 24 pages, 15 figure
On formal verification of arithmetic-based cryptographic primitives
Cryptographic primitives are fundamental for information security: they are
used as basic components for cryptographic protocols or public-key
cryptosystems. In many cases, their security proofs consist in showing that
they are reducible to computationally hard problems. Those reductions can be
subtle and tedious, and thus not easily checkable. On top of the proof
assistant Coq, we had implemented in previous work a toolbox for writing and
checking game-based security proofs of cryptographic primitives. In this paper
we describe its extension with number-theoretic capabilities so that it is now
possible to write and check arithmetic-based cryptographic primitives in our
toolbox. We illustrate our work by machine checking the game-based proofs of
unpredictability of the pseudo-random bit generator of Blum, Blum and Shub, and
semantic security of the public-key cryptographic scheme of Goldwasser and
Micali.Comment: 13 page
Dioscorea macrantha Uline ex R. Knuth
im Walde von Conconhasz bei TubarãopublishedVersio
Large Deviations Analysis for Distributed Algorithms in an Ergodic Markovian Environment
We provide a large deviations analysis of deadlock phenomena occurring in
distributed systems sharing common resources. In our model transition
probabilities of resource allocation and deallocation are time and space
dependent. The process is driven by an ergodic Markov chain and is reflected on
the boundary of the d-dimensional cube. In the large resource limit, we prove
Freidlin-Wentzell estimates, we study the asymptotic of the deadlock time and
we show that the quasi-potential is a viscosity solution of a Hamilton-Jacobi
equation with a Neumann boundary condition. We give a complete analysis of the
colliding 2-stacks problem and show an example where the system has a stable
attractor which is a limit cycle
Selection from read-only memory with limited workspace
Given an unordered array of elements drawn from a totally ordered set and
an integer in the range from to , in the classic selection problem
the task is to find the -th smallest element in the array. We study the
complexity of this problem in the space-restricted random-access model: The
input array is stored on read-only memory, and the algorithm has access to a
limited amount of workspace. We prove that the linear-time prune-and-search
algorithm---presented in most textbooks on algorithms---can be modified to use
bits instead of words of extra space. Prior to our
work, the best known algorithm by Frederickson could perform the task with
bits of extra space in time. Our result separates
the space-restricted random-access model and the multi-pass streaming model,
since we can surpass the lower bound known for the latter
model. We also generalize our algorithm for the case when the size of the
workspace is bits, where . The running time
of our generalized algorithm is ,
slightly improving over the
bound of Frederickson's algorithm. To obtain the improvements mentioned above,
we developed a new data structure, called the wavelet stack, that we use for
repeated pruning. We expect the wavelet stack to be a useful tool in other
applications as well.Comment: 16 pages, 1 figure, Preliminary version appeared in COCOON-201
Quantum Cryptography
Quantum cryptography is a new method for secret communications offering the
ultimate security assurance of the inviolability of a Law of Nature. In this
paper we shall describe the theory of quantum cryptography, its potential
relevance and the development of a prototype system at Los Alamos, which
utilises the phenomenon of single-photon interference to perform quantum
cryptography over an optical fiber communications link.Comment: 36 pages in compressed PostScript format, 10 PostScript figures
compressed tar fil
- …