相关论文: Hamiltonian Cycles on Random Eulerian Triangulatio…

We introduce a matrix model describing the fully-packed O(n) model on random Eulerian triangulations (i.e. triangulations with all vertices of even valency). For n=1 the model is mapped onto a particular gravitational 6-vertex model with…

Random spin chains at quantum critical points exhibit an entanglement entropy between a segment of length L and the rest of the chain that scales as log_2 L with a universal coefficient. Since for pure quantum critical spin chains this…

For quantum critical spin chains without disorder, it is known that the entanglement of a segment of N>>1 spins with the remainder is logarithmic in N with a prefactor fixed by the central charge of the associated conformal field theory. We…

In this paper, we review how to obtain the central charge of a critical entanglement Hamiltonian through the nested entanglement entropy which was first introduced in [J. Lou et al. PRB 84, 245128 (2011)]. The critical phenomena of the…

We study the statistics of Hamiltonian cycles on various families of bicolored random planar maps (with the spherical topology). These families fall into two groups corresponding to two distinct universality classes with respective central…

We establish a relationship between the two important central lines of the triangle, the Euler line and the Brocard axis, in a configuration with an arbitrary rectangle and a random point. The classical Cartesian coordinate system method…

It is known that the entropy of a block of spins of size $L$ embedded in an infinite pure critical spin chain diverges as the logarithm of $L$ with a prefactor fixed by the central charge of the corresponding conformal field theory. For a…

In this paper we study the connection between the phenomenon of homological percolation (the formation of "giant" cycles in persistent homology), and the zeros of the expected Euler characteristic curve. We perform an experimental study…

We investigate the entanglement within a system undergoing a random, local process. We find that there is initially a phase of very fast generation and spread of entanglement. At the end of this phase the entanglement is typically maximal.…

In quantum statistical mechanics, it is of fundamental interest to understand how close the bipartite entanglement entropy of eigenstates of quantum chaotic Hamiltonians is to maximal. For random pure states in the Hilbert space, the…

We present a procedure for averaging one-parameter random unitary groups and random self-adjoint groups. Central to this is a generalization of the notion of weak convergence of a sequence of measures and the corresponding generalization of…

Delaunay triangulations of a point set in the Euclidean plane are ubiquitous in a number of computational sciences, including computational geometry. Delaunay triangulations are not well defined as soon as 4 or more points are concyclic but…

We evaluate the entanglement entropy of exactly solvable Hamiltonians corresponding to general families of three-dimensional topological models. We show that the modification to the entropic area law due to three-dimensional topological…

Dunkel and Trigger [Phys. Rev. A {71}, 052102 (2005)] show that the Leipnik's joint entropy monotonously increases for the initially maximally classical Gaussian wave packet for a free particle. After expressing the joint entropy of the…

We show that the averaged equation for a one-frequency fast-oscillating Hamiltonian system is the result of symplectic reduction of a certain natural system on the corresponding $S^1$-bundle with respect to the circle action. Furthermore,…

We present numerical evidences for the logarithmic scaling of the entanglement entropy in critical random spin chains. Very large scale exact diagonalizations performed at the critical XX point up to L=2000 spins 1/2 lead to a perfect…

The Eulerian triangle is a classical array of combinatorial numbers defined by a linear recursion. The associated boundary problem asks one to find all extreme nonnegative solutions to a dual recursion. Exploiting connections with random…

Let $\mathcal{G}(n,r,s)$ denote a uniformly random $r$-regular $s$-uniform hypergraph on $n$ vertices, where $s$ is a fixed constant and $r=r(n)$ may grow with $n$. An $\ell$-overlapping Hamilton cycle is a Hamilton cycle in which…

In the random hypergraph H=H(n,p;3) each possible triple appears independently with probability p. A loose Hamilton cycle can be described as a sequence of edges {x_i,y_i,x_{i+1}\} for i=1,2,...,n/2. We prove that there exists an absolute…

In the random hypergraph $H_{n,p;k}$ each possible $k$-tuple appears independently with probability $p$. A loose Hamilton cycle is a cycle in which every pair of adjacent edges intersects in a single vertex. We prove that if $p n^{k-1}/\log…