Related papers: Percolation Hamiltonians
The statistical properties of a Hamiltonian $H_0$ perturbed by a localized scatterer are considered. We prove that when $H_0$ describes a bounded chaotic motion, the universal part of the spectral statistics are not changed by the…
We study the two most common types of percolation process on a sparse random graph with a given degree sequence. Namely, we examine first a bond percolation process where the edges of the graph are retained with probability p and afterwards…
We study topological Poincar\'e type inequalities on general graphs. We characterize graphs satisfying such inequalities and then turn to the best constants in these inequalities. Invoking suitable metrics we can interpret these constants…
We discuss the existence of Hamilton cycles in the random graph $G_{n,p}$ where there are restrictions caused by (i) coloring sequences, (ii) a subset of vertices must occur in a specific order and (iii) there is a bound on the number of…
We use random matrix theory to study the spectrum of random geometric graphs, a fundamental model of spatial networks. Considering ensembles of random geometric graphs we look at short range correlations in the level spacings of the…
In this paper we investigate the spectral and scattering theory for operators acting on topological crystals and on their perturbations. A special attention is paid to perturbations obtained by the addition of an infinite number of edges,…
In this article we consider fractional Laplacians which seem to be of interest to probability theory. This is a rather new class of operators for us but our methods works (with a twist, as usual). Our main goal is to derive a two-term…
The spectrum of a local random Hamiltonian can be represented generically by the so-called $\epsilon$-free convolution of its local terms' probability distributions. We establish an isomorphism between the set of $\epsilon$-noncrossing…
We present a selection of results on variation of the spectral subspace of a Hermitian operator under a Hermitian perturbation and show how these results may work for few-body Hamiltonians.
Complex networks or graphs are ubiquitous in sciences and engineering: biological networks, brain networks, transportation networks, social networks, and the World Wide Web, to name a few. Spectral graph theory provides a set of useful…
We give the first properties of independent Bernoulli percolation, for oriented graphs on the set of vertices $\Z^d$ that are translation-invariant and may contain loops. We exhibit some examples showing that the critical probability for…
This is a (long) survey about applications of percolation theory in equilibrium statistical mechanics. The chapters are as follows: 1. Introduction 2. Equilibrium phases 3. Some models 4. Coupling and stochastic domination 5. Percolation 6.…
Correlations are known to play a crucial role in determining the structure of complex networks. Here we study how their presence affects the computation of the percolation threshold in random hypergraphs. In order to mimic the correlation…
We study operators on rooted graphs with a certain spherical homogeneity. These graphs are called path commuting and allow for a decomposition of the adjacency matrix and the Laplacian into a direct sum of Jacobi matrices which reflect the…
We discuss a connection between two areas of mathematics which until recently seemed to be rather distant from each other: (1) noncommutative harmonic analysis on groups and (2) some topics in probability theory related to random point…
Percolation is the paradigm for random connectivity and has been one of the most applied statistical models. With simple geometrical rules a transition is obtained which is related to magnetic models. This transition is, in all dimensions,…
Non-asymptotic theory of random matrices strives to investigate the spectral properties of random matrices, which are valid with high probability for matrices of a large fixed size. Results obtained in this framework find their applications…
Graphs and networks play an important role in modeling and analyzing complex interconnected systems such as transportation networks, integrated circuits, power grids, citation graphs, and biological and artificial neural networks. Graph…
We consider operators in the domains with the boundaries and derive sharp spectral asymptotics (containing non-Weyl correction) in the case when Hamiltonian flow is periodic. Even if operator is scalar but not second order (or even…
We consider the problem of variation of spectral subspaces for linear self-adjoint operators under off-diagonal perturbations. We prove a number of new optimal results on the shift of the spectrum and obtain (sharp) estimates on the norm of…