Related papers: Sampling Theory with Average Values on the Sierpin…
The measurement of gamma-rays from decaying nuclei allow for the investigation into nuclear structure. True coincidence summing occurs when two gamma-rays from a single decay get detected in a single detector and their energies sum together…
Consider a host hypergraph $G$ which contains a spanning structure due to minimum degree considerations. We collect three results proving that if the edges of $G$ are sampled at the appropriate rate then the spanning structure still appears…
Graphs are used to represent and analyze data in domains as diverse as physics, biology, chemistry, planetary science, and the social sciences. Across domains, random graph models relate generative processes to expected graph properties,…
We show variants of spectral sparsification routines can preserve the total spanning tree counts of graphs, which by Kirchhoff's matrix-tree theorem, is equivalent to determinant of a graph Laplacian minor, or equivalently, of any SDDM…
We study the following combinatorial counting and sampling problems: can we efficiently sample from the Erd\H{o}s-R\'{e}nyi random graph $G(n,p)$ conditioned on triangle-freeness? Can we efficiently approximate the probability that $G(n,p)$…
We consider topological dynamical systems over $\ZZ$ and, more generally, locally compact, $\sigma$-compact abelian groups. We relate spectral theory and diffraction theory. We first use a a recently developed general framework of…
Here we introduce a generalization of the exponential sampling series of optical physics and establish pointwise and uniform convergence theorem, also in a quantitative form. Moreover we compare the error of approximation for Mellin…
In spite of its many successes, the Standard Model makes many empirical assumptions in the Higgs and fermion sectors for which a deeper theoretical basis is sought. Starting from the usual gauge symmetry $u(1) \times su(2) \times su(3)$…
We investigate connections between the symmetries (automorphisms) of a graph and its spectral properties. Whenever a graph has a symmetry, i.e. a nontrivial automorphism $\phi$, it is possible to use $\phi$ to decompose any matrix…
We deal with a random graph model evolving in discrete time steps by duplicating and deleting the edges of randomly chosen vertices. We prove the existence of an a.s. asymptotic degree distribution, with streched exponential decay; more…
3D Point clouds (PCs) are commonly used to represent 3D scenes. They can have millions of points, making subsequent downstream tasks such as compression and streaming computationally expensive. PC sampling (selecting a subset of points) can…
We investigate the scalar potential of a general $S_3$-symmetric three-Higgs-doublet model. The outcome of our analysis does not depend on the fermionic sector of the model. We identify a decoupling limit for the scalar spectrum of this…
Vertex based and spectral based GSP sampling has been studied recently. The literature recognizes that methods in one domain do not have a counterpart in the other domain. This paper shows that in fact one can develop a unified graph signal…
The well known Weyl's asymptotic formula gives an approximation to the number $\mathcal{N}_{\omega}$ of eigenvalues (counted with multiplicities) on an interval $[0,\>\omega]$ of the Laplace-Beltrami operator on a compact Riemannian…
Specify a randomized algorithm that, given a very large graph or network, extracts a random subgraph. What can we learn about the input graph from a single subsample? We derive laws of large numbers for the sampler output, by relating…
Two-sample tests utilizing a similarity graph on observations are useful for high-dimensional and non-Euclidean data due to their flexibility and good performance under a wide range of alternatives. Existing works mainly focused on sparse…
We develop unbiased strategies to probabilistic T-wave snowball sampling from graphs, where the interest of estimation may concern finite-order subgraphs such as triangles, cycles or stars. Our approaches encompass also the…
Exchangeable random graphs, which include some of the most widely studied network models, have emerged as the mainstay of statistical network analysis in recent years. Graphons, which are the central objects in graph limit theory, provide a…
The decimation map $\mathcal{D}$ for a network of admittances on an $n$-simplex lattice fractal is studied. The asymptotic behaviour of $\mathcal{D}$ for large-size fractals is examined. It is found that in the vicinity of the isotropic…
The Spectral Excess Theorem (SPET) for distance-regular graphs states that a regular (connected) graph is distance-regular if and only if its spectral-excess equals its average excess. Recently, some local or global approaches to the SPET…