Related papers: Localization for the Anderson Model on Trees with …
We present a new large-deviation approach to investigate the critical properties of the Anderson model on the Bethe lattice close to the localization transition in the thermodynamic limit. Our method allows us to study accurately the…
We study a lattice sigma model which is expected to reflect the Anderson localization and delocalization transition for real symmetric band matrices in 3D. In this statistical mechanics model, the field takes values in a supermanifold based…
The number of embeddings of a partially ordered set $S$ in a partially ordered set $T$ is the number of subposets of $T$ isomorphic to $S$. If both, $S$ and $T$, have only one unique maximal element, we define good embeddings as those in…
Anderson localization is studied for two-dimensional Dirac fermions in the presence of strong random scattering. Averaging with respect to the latter leads to a graphical representation of the correlation function with entangled random…
Results of large-scale numerical simulations are reported on the Anderson localization in a two-dimensional square lattice tight-binding model with random flux. Localization lengths, fluctuations of the conductance, and the density of…
A mixture of two fermionic species with different masses is studied in an optical lattice. The heavy fermions are subject only to thermal fluctuations, the light fermions also to quantum fluctuations. We derive the Ising-like distribution…
A bijection between ternary trees with $n$ nodes and a subclass of Motzkin paths of length $3n$ is given. This bijection can then be generalized to $t$-ary trees.
Our recent study on the Bethe lattice reported that a discontinuous percolation transition emerges as the number of occupied links increases and each node rewires its links to locally suppress the growth of neighboring clusters. However,…
Statistical analysis of the eigenfunctions of the Anderson tight-binding model with on-site disorder on regular random graphs strongly suggests that the extended states are multifractal at any finite disorder. The spectrum of fractal…
The ternary betweenness relation of a tree, B(x,y,z) expresses that y is on the unique path between x and z. This notion can be extended to order-theoretic trees defined as partial orders such that the set of nodes larger than any node is…
Tree sets are abstract structures that can be used to model various tree-shaped objects in combinatorics. Finite tree sets can be represented by finite graph-theoretical trees. We extend this representation theory to infinite tree sets.…
We discuss the techniques and results of the multi-particle Anderson localization theory for disordered quantum systems with nontrivial interaction. After a detailed presentation of the approach developed earlier by Aizenman and Warzel, we…
For a partially ordered set P, we denote by Co(P) the lattice of order-convex subsets of P. We find three new lattice identities, (S), (U), and (B), such that the following result holds. Theorem. Let L be a lattice. Then L embeds into some…
To a given gene tree topology $G$ and species tree topology $S$ with leaves labeled bijectively from a fixed set $X$, one can associate a set of ancestral configurations, each of which encodes a set of gene lineages that can be found at a…
We define a family of asymmetric processes for particles on a one-dimensional lattice, depending on a continuous parameter $\lambda \in [0,1] $, interpolating between the completely asymmetric processes [1] (for $\lambda =1$) and the n=1…
We express $D^{(2)}_{2}$ transfer matrices as products of $A^{(1)}_{1}$ transfer matrices, for both closed and open spin chains. We use these relations, which we call factorization identities, to solve the models by algebraic Bethe ansatz.…
We provide a bijection between the set of factorizations, that is, ordered (n-1)-tuples of transpositions in ${\mathcal S}_{n}$ whose product is (12...n), and labelled trees on $n$ vertices. We prove a refinement of a theorem of D\'{e}nes…
Tree sets are posets with additional structure that generalize tree-like objects in graphs, matroids, or other combinatorial structures. They are a special class of abstract separation systems. We study infinite tree sets and how they…
This article focuses on properties and structures of trees with maximum mean subtree order in a given family; such trees are called optimal in the family. Our main goal is to describe the structure of optimal trees in $\mathcal{T}_n$ and…
We propose boundary conditions on a two dimensional 6-vertex model, which is defined on the lightcone lattice for an open string worldsheet. We show that, in the continuum limit, the degrees of freedom of this 6-vertex model describe a…