Observables are glocal

• URL: http://arxiv.org/abs/2508.02346v1
• Date: Mon, 04 Aug 2025 12:28:42 GMT
• Title: Observables are glocal
• Authors: Emil Broukal, Andrea Di Biagio, Eugenio Bianchi, Marios Christodoulou,
• Abstract summary: We show how the problem of observables is fully resolved for background independent theories defined on finite graphs.<n>We show that sets of complete observables can be constructed so that each seeks a connected subgraph structure -- local correlations.<n>This provides physically meaningful complete sets of observables for discrete general relativity.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We study how the problem of observables is fully resolved for background independent theories defined on finite graphs. We argue the correct analogue of coordinate independence is the invariance under changes of graph labels, a kind of permutation invariance. Invariants are formed by a group average that probes the entire graph -- they are global. Strikingly, sets of complete observables can be constructed so that each seeks a connected subgraph structure -- local correlations. Geometrical information is fully encoded in background independent observables through this subtle interplay of global and local graph notions, a behavior we term glocal. This provides physically meaningful complete sets of observables for discrete general relativity, suggests a reformulation of the spin networks state space of loop quantum gravity, and reveals deep connections between the problem of observables and the graph isomorphism problem.

Related papers

• Generalization of Graph Neural Networks through the Lens of Homomorphism [7.223313563198697]
  We propose to study the generalization of Graph Neural Networks (GNNs) through a novel perspective - analyzing the entropy of graph homomorphism. By linking graph homomorphism with information-theoretic measures, we derive generalization bounds for both graph and node classifications. These bounds are capable of capturing subtleties inherent in various graph structures, including but not limited to paths, cycles and cliques.
  arXiv  Detail & Related papers  (2024-03-10T03:51:59Z)
• Improving embedding of graphs with missing data by soft manifolds [51.425411400683565]
  The reliability of graph embeddings depends on how much the geometry of the continuous space matches the graph structure. We introduce a new class of manifold, named soft manifold, that can solve this situation. Using soft manifold for graph embedding, we can provide continuous spaces to pursue any task in data analysis over complex datasets.
  arXiv  Detail & Related papers  (2023-11-29T12:48:33Z)
• Towards Understanding and Mitigating Dimensional Collapse in Heterogeneous Federated Learning [112.69497636932955]
  Federated learning aims to train models across different clients without the sharing of data for privacy considerations. We study how data heterogeneity affects the representations of the globally aggregated models. We propose sc FedDecorr, a novel method that can effectively mitigate dimensional collapse in federated learning.
  arXiv  Detail & Related papers  (2022-10-01T09:04:17Z)
• Diffeomorphism-invariant observables and dynamical frames in gravity: reconciling bulk locality with general covariance [0.0]
  We describe a completely general and non-perturbative framework for constructing dynamical reference frames. Our formalism refutes the commonly claimed non-existence of local gravitational bulk physics.
  arXiv  Detail & Related papers  (2022-06-02T17:52:40Z)
• Clustering and Structural Robustness in Causal Diagrams [1.9766522384767222]
  Clustering of variables is a natural way to reduce the size of the causal diagram. We define a specific type of cluster, called transit cluster, that is guaranteed to preserve the identifiability properties of causal effects. We show that this kind of structural robustness is closely related to transit clusters.
  arXiv  Detail & Related papers  (2021-11-08T13:56:22Z)
• Explicit Pairwise Factorized Graph Neural Network for Semi-Supervised Node Classification [59.06717774425588]
  We propose the Explicit Pairwise Factorized Graph Neural Network (EPFGNN), which models the whole graph as a partially observed Markov Random Field. It contains explicit pairwise factors to model output-output relations and uses a GNN backbone to model input-output relations. We conduct experiments on various datasets, which shows that our model can effectively improve the performance for semi-supervised node classification on graphs.
  arXiv  Detail & Related papers  (2021-07-27T19:47:53Z)
• Spectral-Spatial Global Graph Reasoning for Hyperspectral Image Classification [50.899576891296235]
  Convolutional neural networks have been widely applied to hyperspectral image classification. Recent methods attempt to address this issue by performing graph convolutions on spatial topologies.
  arXiv  Detail & Related papers  (2021-06-26T06:24:51Z)
• OR-Net: Pointwise Relational Inference for Data Completion under Partial Observation [51.083573770706636]
  This work uses relational inference to fill in the incomplete data. We propose Omni-Relational Network (OR-Net) to model the pointwise relativity in two aspects.
  arXiv  Detail & Related papers  (2021-05-02T06:05:54Z)
• Manifold Topology, Observables and Gauge Group [0.0]
  The relation between manifold topology, observables and gauge group is clarified. The implications on the observability of the Permutation Group in Particle Statistics are discussed.
  arXiv  Detail & Related papers  (2021-02-17T18:05:13Z)
• On quantum superpositions of graphs, no-signalling and covariance [0.0]
  We provide a mathematically and conceptually robust notion of quantum superpositions of graphs. We argue that, crucially, quantum superpositions of graphs require node names for their correct alignment. We explain how to impose renaming invariance at the level of quantum superpositions of graphs.
  arXiv  Detail & Related papers  (2020-10-26T13:32:16Z)
• Factorizable Graph Convolutional Networks [90.59836684458905]
  We introduce a novel graph convolutional network (GCN) that explicitly disentangles intertwined relations encoded in a graph. FactorGCN takes a simple graph as input, and disentangles it into several factorized graphs. We evaluate the proposed FactorGCN both qualitatively and quantitatively on the synthetic and real-world datasets.
  arXiv  Detail & Related papers  (2020-10-12T03:01:40Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.