2,169 research outputs found
Note on Negative Probabilities and Observable Processes
Get PDFA mathematical framework for observable processes is introduced via the model of systems whose states may be time dependent and described by possibly ”negative probabilities”. The model generalizes and includes the linearly dependent models or observable operator models for classical discrete stochastic processes. Within this model a general convergence result for finite-dimensional processes, which generalize finite state (hidden) Markov models, is derived. On the philosophical side, the model furthermore offers an explanation for Bell’s inequality in quantum mechanics
Note on the convergence of simulated annealing algorithms
No full textGeneralizing the results of Faigle and Schrader [Inform. Process. Lett., 27 (1988), pp. 189–194] a short inductive proof is given that shows that the stationary distributions of a simulated annealing algorithm converge to a distribution, where nonoptimal elements are generated with probability zero, provided that the “weak reversibility condition” of Hajek [Math. Oper. Res., 13 (1988), pp. 311–329] holds
Tractatio Iuris Publici De Serenissimis Potentissimisque Ducibus Brunsvicensibus Et Luneburgensibus / D.O.M.A. Praeside ... Dn. Joh. Ulrico Pregizero ... In Illustri Collegio Ad Diem 10. Decembr. Placido Eruditorum Examini sistit Author Christian Ulrich Blum
Get PDFTRACTATIO IURIS PUBLICI DE SERENISSIMIS POTENTISSIMISQUE DUCIBUS BRUNSVICENSIBUS ET LUNEBURGENSIBUS / D.O.M.A. PRAESIDE ... DN. JOH. ULRICO PREGIZERO ... IN ILLUSTRI COLLEGIO AD DIEM 10. DECEMBR. PLACIDO ERUDITORUM EXAMINI SISTIT AUTHOR CHRISTIAN ULRICH BLUM
Tractatio Iuris Publici De Serenissimis Potentissimisque Ducibus Brunsvicensibus Et Luneburgensibus / D.O.M.A. Praeside ... Dn. Joh. Ulrico Pregizero ... In Illustri Collegio Ad Diem 10. Decembr. Placido Eruditorum Examini sistit Author Christian Ulrich Blum (1)
Titelblatt (1)
Prooemium. (3)
Caput I. (5)
Caput II. (9)
Caput III. (12)
Caput IV. (22)
Caput V. (29)
Caput VI. (47)
I. - V. (54
Computing an element in the lexicographic kernel of a game
Get PDFThe lexicographic kernel of a game lexicographically maximizes the surplusses (rather than the excesses as would the nucleolus). We show that an element in the lexicographic kernel can be computed efficiently, provided we can efficiently compute the surplusses corresponding to a given allocation . This approach improves the results in Faigle et al. (in Int J Game Theory 30:79–98, 2001) and allows us to determine a kernel element without appealing to Maschler transfers in the execution of the algorithm
Note on scheduling intervals on-line
Get PDFAbstractAn optimal on-line algorithm is presented for the following optimization problem, which constitutes the special case of the k-track assignment problem with identical time windows. Intervals arrive at times ti and demand service time equal to their length. An interval is considered lost if it is not assigned to one of k identical service stations immediately or if its service is interrupted. Minimizing the losses amounts to coloring a maximal set of intervals in the associated interval graph properly with at most k colors. Optimality of the on-line algorithm is proved by showing that it performs as well as the optimal greedy k-coloring algorithm due to Faigle and Nawijn and, independently, to Carlisle and Lloyd for the same problem under full a priori information
Monge extensions of cooperation and communication structures
Get PDFCooperation structures without any {\it a priori} assumptions on the combinatorial structure of feasible coalitions are studied and a general theory for mar\-ginal values, cores and convexity is established. The theory is based on the notion of a Monge extension of a general characteristic function, which is equivalent to the Lovász extension in the special situation of a classical cooperative game. It is shown that convexity of a cooperation structure is tantamount to the equality of the associated core and Weber set. Extending Myerson's graph model for game theoretic communication, general communication structures are introduced and it is shown that a notion of supermodularity exists for this class that characterizes convexity and properly extends Shapley's convexity model for classical cooperative games.
A Markovian Model for Joint Observations, Bell's Inequality and Hidden States
No full textFaigle U, Schönhuth A. A Markovian Model for Joint Observations, Bell's Inequality and Hidden States. arXiv:1011.1295. 2010.While the standard approach to quantum systems studies length preserving
linear transformations of wave functions, the Markov picture focuses on trace
preserving operators on the space of Hermitian (self-adjoint) matrices. The
Markov approach extends the standard one and provides a refined analysis of
measurements and quantum Markov chains. In particular, Bell's inequality
becomes structurally clear. It turns out that hidden state models are natural
in the Markov context. In particular, a violation of Bell's inequality is seen
to be compatible with the existence of hidden states. The Markov model moreover
clarifies the role of the "negative probabilities" in Feynman's analysis of the
EPR paradox
Supplementary movies of the dynamic rupture and tsunami models published in Ulrich et al. (2019)
No full text<p>Supplementary movies of the dynamic rupture and tsunami models published in Ulrich et al. (2019)</p>
<p>movie_Sulawesi_SR-cp.mov: Absolute slip rate (m/s) across the fault network during the earthquake. Author: Thomas Ulrich</p>
<p>movie_Sulawesi_wavefield-cp.mov: Absolute slip rate (m/s) and wavefield (absolute particle velocity in m/s) across the fault network during the earthquake. Author: Thomas Ulrich</p>
<p>SulawesiTanioka.mp4: Sea surface height (m) predicted by the tsunami scenario. Author: Stefan Vater</p>
<p>reference: Ulrich, T., Vater, S., Madden, E. H., Behrens, J., van Dinther, Y., van Zelst, I., Fielding, E. J., Liang, C. & Gabriel, A. A. (2019). Coupled, Physics-based Modeling Reveals Earthquake Displacements are Critical to the 2018 Palu, Sulawesi Tsunami. doi: 10.31223/osf.io/3bwqa.</p>
On Hidden States in Quantum Random Walks
No full textFaigle U, Schönhuth A. On Hidden States in Quantum Random Walks. arXiv:1601.02882. 2015.It was recently pointed out that identifiability of quantum random walks and
hidden Markov processes underlie the same principles. This analogy immediately
raises questions on the existence of hidden states also in quantum random walks
and their relationship with earlier debates on hidden states in quantum
mechanics. The overarching insight was that not only hidden Markov processes,
but also quantum random walks are finitary processes. Since finitary processes
enjoy nice asymptotic properties, this also encourages to further investigate
the asymptotic properties of quantum random walks. Here, answers to all these
questions are given. Quantum random walks, hidden Markov processes and finitary
processes are put into a unifying model context. In this context, quantum
random walks are seen to not only enjoy nice ergodic properties in general, but
also intuitive quantum-style asymptotic properties. It is also pointed out how
hidden states arising from our framework relate to hidden states in earlier,
prominent treatments on topics such as the EPR paradoxon or Bell's
inequalities
- …
