Average scattering entropy of quantum graphs
- URL: http://arxiv.org/abs/2101.05250v3
- Date: Sun, 4 Jul 2021 16:14:58 GMT
- Title: Average scattering entropy of quantum graphs
- Authors: Alison A. Silva and Fabiano M. Andrade and Dionisio Bazeia
- Abstract summary: We propose a methodology that associates a graph a scattering entropy, which we call the average scattering entropy.
It is defined by taking into account the period of the scattering amplitude which we calculate using the Green's function procedure.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: The scattering amplitude in simple quantum graphs is a well-known process
which may be highly complex. In this work, motivated by the Shannon entropy, we
propose a methodology that associates to a graph a scattering entropy, which we
call the average scattering entropy. It is defined by taking into account the
period of the scattering amplitude which we calculate using the Green's
function procedure. We first describe the methodology on general grounds, and
then exemplify our findings considering several distinct groups of graphs. We
go on and investigate other possibilities, one that contains groups of graphs
with the same number of vertices, with the same degree, and the same number of
edges, with the same length, but with distinct topologies and with different
entropies. And the other, which contains graphs of the fishbone type, where the
scattering entropy depends on the boundary conditions on the vertices of degree
$1$, with the corresponding values decreasing and saturating very rapidly, as
we increase the number of elementary structures in the graphs.
Related papers
- Information-Theoretic Thresholds for Planted Dense Cycles [52.076657911275525]
We study a random graph model for small-world networks which are ubiquitous in social and biological sciences.
For both detection and recovery of the planted dense cycle, we characterize the information-theoretic thresholds in terms of $n$, $tau$, and an edge-wise signal-to-noise ratio $lambda$.
arXiv Detail & Related papers (2024-02-01T03:39:01Z) - Beyond the Holographic Entropy Cone via Cycle Flows [0.0]
We introduce a new prescription for computing entropy vectors outside the holographic entropy cone.
We prove that the maximum cycle flow obeys both subadditivity and strong subadditivity.
We conjecture that our model similarly generalizes the entropy vectors arising from hypergraphs.
arXiv Detail & Related papers (2023-12-15T19:00:00Z) - Path convergence of Markov chains on large graphs [3.693375843298262]
We show that as the size of a graph goes to infinity, the random trajectories of the processes converge to deterministic curves on the space of measure-valued graphons.
A novel feature of this approach is that it provides a precise exponential convergence rate for the Metropolis chain in a certain limiting regime.
arXiv Detail & Related papers (2023-08-18T00:13:59Z) - Scattering entropies of quantum graphs with several channels [0.0]
We deal with the scattering entropy of quantum graphs in many different circumstances.
We think the results may be used as quantifiers in models related to the transport in quantum graphs.
arXiv Detail & Related papers (2022-11-17T17:35:06Z) - Score-based Generative Modeling of Graphs via the System of Stochastic
Differential Equations [57.15855198512551]
We propose a novel score-based generative model for graphs with a continuous-time framework.
We show that our method is able to generate molecules that lie close to the training distribution yet do not violate the chemical valency rule.
arXiv Detail & Related papers (2022-02-05T08:21:04Z) - Entropic Optimal Transport in Random Graphs [8.7314407902481]
In graph analysis, a classic task consists in computing similarity measures between (groups of) nodes.
We show that it is possible to consistently estimate distances between groups of nodes in the latent space.
arXiv Detail & Related papers (2022-01-11T13:52:34Z) - Average scattering entropy for periodic, aperiodic and random
distribution of vertices in simple quantum graphs [0.0]
This work deals with the average scattering entropy of quantum graphs.
It can be seen as another tool to be used to explore geometric and topological effects of current interest for quantum systems.
arXiv Detail & Related papers (2021-10-06T15:13:45Z) - Exact thermal properties of free-fermionic spin chains [68.8204255655161]
We focus on spin chain models that admit a description in terms of free fermions.
Errors stemming from the ubiquitous approximation are identified in the neighborhood of the critical point at low temperatures.
arXiv Detail & Related papers (2021-03-30T13:15:44Z) - Continuous-time quantum walks in the presence of a quadratic
perturbation [55.41644538483948]
We address the properties of continuous-time quantum walks with Hamiltonians of the form $mathcalH= L + lambda L2$.
We consider cycle, complete, and star graphs because paradigmatic models with low/high connectivity and/or symmetry.
arXiv Detail & Related papers (2020-05-13T14:53:36Z) - Asymptotic entropy of the Gibbs state of complex networks [68.8204255655161]
The Gibbs state is obtained from the Laplacian, normalized Laplacian or adjacency matrices associated with a graph.
We calculated the entropy of the Gibbs state for a few classes of graphs and studied their behavior with changing graph order and temperature.
Our results show that the behavior of Gibbs entropy as a function of the temperature differs for a choice of real networks when compared to the random ErdHos-R'enyi graphs.
arXiv Detail & Related papers (2020-03-18T18:01:28Z) - Block-Approximated Exponential Random Graphs [77.4792558024487]
An important challenge in the field of exponential random graphs (ERGs) is the fitting of non-trivial ERGs on large graphs.
We propose an approximative framework to such non-trivial ERGs that result in dyadic independence (i.e., edge independent) distributions.
Our methods are scalable to sparse graphs consisting of millions of nodes.
arXiv Detail & Related papers (2020-02-14T11:42:16Z)
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.