Related papers: Scaling Limits for the Gibbs States on Distance-Re…
Models of quantum and classical particles on the d-dimensional cubic lattice with pair interparticle interactions are considered. The classical model is obtained from the corresponding quantum one when the reduced physical mass of the…
It is well known that a minimal distance emerges in quantum field theories owing to the need to regularize the UV divergences. The macroscopical limit at large minimal distance, weak spatial resolution, is investigated for a self…
A continuous bundle of $C^*$-algebras provides a rigorous framework to study the thermodynamic limit of quantum theories. If the bundle admits the additional structure of a strict deformation quantization (in the sense of Rieffel) one is…
Random-scan Gibbs samplers possess a natural hierarchical structure. The structure connects Gibbs samplers targeting higher dimensional distributions to those targeting lower dimensional ones. This leads to a quasi-telescoping property of…
This work will appear as a chapter in a forthcoming volume titled "Topics in Probabilistic Graph Theory". A theory of scaling limits for random graphs has been developed in recent years. This theory gives access to the large-scale geometric…
A discrete gradient model for interfaces is studied. The interaction potential is a non-convex perturbation of the quadratic gradient potential. Based on a representation for the finite volume Gibbs measure obtained via a renormalization…
The standard notion of a classical limit, represented schematically by $\hbar\rightarrow 0$, provides a method for approximating a quantum system by a classical one. In this work we explain why the standard classical limit fails when…
Any directed graph G with N vertices and J edges has an associated line-graph L(G) where the J edges form the vertices of L(G). We show that the non-zero eigenvalues of the adjacency matrices are the same for all graphs of such a family…
Gibbs states of an infinite system of interacting quantum particles are considered. Each particle moves on a compact Riemannian manifold and is attached to a vertex of a graph (one particle per vertex). Two kinds of graphs are studied: (a)…
Nearest neighbor cells in $R^d,d\in\mathbb{N}$, are used to define coefficients of divergence ($\phi$-divergences) between continuous multivariate samples. For large sample sizes, such distances are shown to be asymptotically normal with a…
The method of the quantum probability theory only requires simple structural data of graph and allows us to avoid a heavy combinational argument often necessary to obtain full description of spectrum of the adjacency matrix. In the present…
We review the present knowledge of the Standard Model that is relevant in formulating its possible short distance extensions. We present different scenarios in terms of the Higgs mass, the only unknown parameter of the model. We concentrate…
We introduce a solvable model of randomly growing systems consisting of many independent subunits. Scaling relations and growth rate distributions in the limit of infinite subunits are analysed theoretically. Various types of scaling…
We introduce the notion of Benjamini-Schramm convergence for quantum graphs. This notion of convergence, intended to play the role of the already existing notion for discrete graphs, means that the restriction of the quantum graph to a…
We consider the disordered monomer-dimer model on general finite graphs with bounded degrees. Under the finite fourth moment assumption on the weight distributions, we prove a Gaussian central limit theorem for the free energy of the…
The paper considers the spectral determinant of quantum graph families with chaotic classical limit and no symmetries. The secular coefficients of the spectral determinant are found to follow distributions with zero mean and variance…
We study the spatial Gibbs random graphs introduced in [MV16] from the point of view of local convergence. These are random graphs embedded in an ambient space consisting of a line segment, defined through a probability measure that favors…
We prove that Aldous' Brownian CRT is the scaling limit, with respect to the Gromov--Prokhorov topology, of uniform random graphs in each of the three following families of graphs: distance-hereditary graphs, $2$-connected…
Let $\Gamma=(X,\mathcal{R})$ denote a finite, simple, connected, and undirected non-bipartite graph with vertex set $X$ and edge set $\mathcal{R}$. Fix a vertex $x \in X$, and define $\mathcal{R}_f = \mathcal{R} \setminus \{yz \mid…
We study criteria which ensure that Gibbs states (often also called generalized vacuum states) on distance-regular graphs are positive. Our main criterion assumes that the graph can be embedded into a growing family of distance-regular…