Results 1 to 10 of about 3,164,312 (366)
Geometry from Information Geometry [PDF]
AIP Conference Proceedings, 2015 We use the method of maximum entropy to model physical space as a curved statistical manifold. It is then natural to use information geometry to explain the geometry of space.
Caticha, Ariel
core +3 more sources
Nature Reviews Physics, 2021 Real networks are finite metric spaces. Yet the geometry induced by shortest path distances in a network is definitely not its only geometry. Other forms of network geometry are the geometry of latent spaces underlying many networks, and the effective geometry induced by dynamical processes in networks.
Dmitri Krioukov +2 more
exaly +4 more sources
Geometries, non-geometries, and fluxes [PDF]
Advances in Theoretical and Mathematical Physics, 2010 Using F-theory/heterotic duality, we describe a framework for analyzing non-geometric T2-fibered heterotic compactifications to six- and four-dimensions. Our results suggest that among T2-fibered heterotic string vacua, the non-geometric compactifications are just as typical as the geometric ones. We also construct four-dimensional solutions which have
McOrist, Jock +2 more
openaire +3 more sources
Entropy, 2020 Information geometry has offered a way to formally study the efficacy of scientific models by quantifying the impact of model parameters on the predicted effects. However, there has been little formal investigation of causation in this framework, despite causal models being a fundamental part of science and explanation.
Pavel Chvykov, Erik Hoel
openaire +5 more sources
The geometry of filtrations [PDF]
Bulletin of the London Mathematical Society, 2021 Publication ...
openaire +5 more sources
International Journal of Modern Physics D, 2004 Extra-dimensional theories contain additional degrees of freedom related to the geometry of the extra space which can be interpreted as new particles. Such theories allow to reformulate most of the fundamental problems of physics from a completely different point of view.
Ruiz Cembranos, José Alberto +2 more
openaire +3 more sources
Single-Player and Two-Player Buttons & Scissors Games [PDF]
, 2016 We study the computational complexity of the Buttons \& Scissors game and obtain sharp thresholds with respect to several parameters. Specifically we show that the game is NP-complete for $C = 2$ colors but polytime solvable for $C = 1$.
Burke, Kyle +15 more
core +3 more sources
Geometry over composition algebras : projective geometry [PDF]
, 2005 The purpose of this article is to introduce projective geometry over composition algebras : the equivalent of projective spaces and Grassmannians over them are defined.
Chaput, Pierre-Emmanuel
core +3 more sources
Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, 2013 We show that time complexity analysis of higher-order functional programs can be effectively reduced to an arguably simpler (although computationally equivalent) verification problem, namely checking first-order inequalities for validity. This is done by giving an efficient inference algorithm for linear dependent types which, given a PCF term ...
DAL LAGO, UGO, Barbara Petit
openaire +4 more sources
, 2013 We study the critical points of monomial functions over an algebraic subset of the probability simplex. The number of critical points on the Zariski closure is a topological invariant of that embedded projective variety, known as its maximum likelihood ...
A. Hovanskiĭ +25 more
core +2 more sources