Related papers: Average scattering entropy of quantum graphs
A general approach for the calculation of the incoherent intensity scattered by a random medium with rough boundaries has been developed using a Green function formalism. The random medium consists of spherical particles whose physical…
We generalize the scattering approach to quantum graphs to quantum graphs with with piecewise constant potentials and multiple excitation modes. The free single-mode case is well-known and leads to the trace formulas of Roth, Kottos and…
The closure of the set of entropy functions associated with n discrete variables, Gammar*n, is a convex cone in (2n-1)- dimensional space, but its full characterization remains an open problem. In this paper, we map Gammar*n to an…
The main contribution of this work is a new type of graph product, which we call the {\it zig-zag product}. Taking a product of a large graph with a small graph, the resulting graph inherits (roughly) its size from the large one, its degree…
We study the on-shell scattering amplitudes in quantum gravity for high-energy collisions in the eikonal approximation. We first evaluate the $n$-loop 2-particle scattering amplitude in the high energy and low momentum transfer limit. We do…
We study the Shannon entropy of the probability distribution resulting from the ground-state wave function of a one-dimensional quantum model. This entropy is related to the entanglement entropy of a Rokhsar-Kivelson-type wave function…
After Shannon, entropy becomes a fundamental quantity to describe not only uncertainity or chaos of a system but also information carried by the system. Shannon's important discovery is to give a mathematical expression of the mutual…
We revisit the problem of designing sublinear algorithms for estimating the average degree of an $n$-vertex graph. The standard access model for graphs allows for the following queries: sampling a uniform random vertex, the degree of a…
We deploy Shannon's information entropy to the distribution of branching fractions in a particle decay. This serves to quantify how important a given new reported decay channel is, from the point of view of the information that it adds to…
The problem of an electromagnetic wave scattered from a random medium layer with rough boundaries is formulated using integral equations which involve two kinds of Green functions. The first one describes the wave scattered by the random…
The problem of Shannon entropy estimation in countable infinite alphabets is addressed from the study and use of convergence results of the entropy functional, which is known to be discontinuous with respect to the total variation distance…
Every graphon defines a random graph on any given number $n$ of vertices. It was known that the graphon is random-free if and only if the entropy of this random graph is subquadratic. We prove that for random-free graphons, this entropy can…
We study how the Shannon entropy of sequences produced by an information source converges to the source's entropy rate. We synthesize several phenomenological approaches to applying information theoretic measures of randomness and memory to…
We study a class of Unitary Quantum Walks on arbitrary graphs, parameterized by a family of scattering matrices. These Scattering Quantum Walks model the discrete dynamics of a system on the edges of the graph, with a scattering process at…
We show how generalized Gibbs-Shannon entropies can provide new insights on the statistical properties of texts. The universal distribution of word frequencies (Zipf's law) implies that the generalized entropies, computed at the word level,…
Entropies based on walks on graphs and on their line-graphs are defined. They are based on the summation over diagonal and off-diagonal elements of the thermal Green's function of a graph also known as the communicability. The walk…
For any given vertices $u$ and $v$ in a graph, the hitting time of a random walk on a finite graph is the number of steps it takes for a random walk to reach vertex $v$ starting at vertex $u$. The expected value of the hitting time is the…
Shannon entropy is widely used to quantify the uncertainty of discrete random variables. But when normalized to the unit interval, as is often done in practice, it no longer conveys the alphabet sizes of the random variables being studied.…
The scattering of electromagnetic wave by a periodic array of nanowires is calculated by the boundary element method. The method is extended to the infinite grating near the interface between two dielectrics. A special Green function is…
We perform a detailed computational study of the recently introduced Sombor indices on random graphs. Specifically, we apply Sombor indices on three models of random graphs: Erd\"os-R\'enyi graphs, random geometric graphs, and bipartite…