Rigidity of infinite disk patterns

Let P be a locally finite disk pattern on the complex plane C whose combinatorics are described by the one-skeleton G of a triangulation of the open topological disk and whose dihedral angles are equal to a function \Theta:E\to [0,\pi/2] on the set of edges. Let P^* be a combinatorially equivalent disk pattern on the plane with the same dihedral angle function. We show that P and P^* differ only by a euclidean similarity. In particular, when the dihedral angle function \Theta is identically zero, this yields the rigidity theorems of B. Rodin and D. Sullivan, and of O. Schramm, whose arguments rely essentially on the pairwise disjointness of the interiors of the disks. The approach here is analytical, and uses the maximum principle, the concept of vertex extremal length, and the recurrency of a family of electrical networks obtained by placing resistors on the edges in the contact graph of the pattern. A similar rigidity property holds for locally finite disk patterns in the hyperbolic plane, where the proof follows by a simple use of the maximum principle. Also, we have a uniformization result for disk patterns. In a future paper, the techniques of this paper will be extended to the case when 0 \le \Theta < \pi. In particular, we will show a rigidity property for a class of infinite convex polyhedra in the 3-dimensional hyperbolic space.Comment: 33 pages, published versio

Entanglement and chaos in warped conformal field theories

Various aspects of warped conformal field theories (WCFTs) are studied including entanglement entropy on excited states, the Renyi entropy after a local quench, and out-of-time-order four-point functions. Assuming a large central charge and dominance of the vacuum block in the conformal block expansion, (i) we calculate the single-interval entanglement entropy on an excited state, matching previous finite temperature results by changing the ensemble; and (ii) we show that WCFTs are maximally chaotic, a result that is compatible with the existence of black holes in the holographic duals. Finally, we relax the aforementioned assumptions and study the time evolution of the Renyi entropy after a local quench. We find that the change in the Renyi entropy is topological, vanishing at early and late times, and nonvanishing in between only for charged states in spectrally-flowed WCFTs.Comment: 31 pages; v2: corrected typos, matches published versio

Coil combination using linear deconvolution in k-space for phase imaging

Background: The combination of multi-channel data is a critical step for the imaging of phase and susceptibility contrast in magnetic resonance imaging (MRI). Magnitude-weighted phase combination methods often produce noise and aliasing artifacts in the magnitude images at accelerated imaging sceneries. To address this issue, an optimal coil combination method through deconvolution in k-space is proposed in this paper. Methods: The proposed method firstly employs the sum-of-squares and phase aligning method to yield a complex reference coil image which is then used to calculate the coil sensitivity and its Fourier transform. Then, the coil k-space combining weights is computed, taking into account the truncated frequency data of coil sensitivity and the acquired k-space data. Finally, combining the coil k-space data with the acquired weights generates the k-space data of proton distribution, with which both phase and magnitude information can be obtained straightforwardly. Both phantom and in vivo imaging experiments were conducted to evaluate the performance of the proposed method. Results: Compared with magnitude-weighted method and MCPC-C, the proposed method can alleviate the phase cancellation in coil combination, resulting in a less wrapped phase. Conclusions: The proposed method provides an effective and efficient approach to combine multiple coil image in parallel MRI reconstruction, and has potential to benefit routine clinical practice in the future

The Connectivity and the Harary Index of a Graph

The Harary index of a graph is defined as the sum of reciprocals of distances between all pairs of vertices of the graph. In this paper we provide an upper bound of the Harary index in terms of the vertex or edge connectivity of a graph. We characterize the unique graph with maximum Harary index among all graphs with given number of cut vertices or vertex connectivity or edge connectivity. In addition we also characterize the extremal graphs with the second maximum Harary index among the graphs with given vertex connectivity

On Spectral Graph Embedding: A Non-Backtracking Perspective and Graph Approximation

Graph embedding has been proven to be efficient and effective in facilitating graph analysis. In this paper, we present a novel spectral framework called NOn-Backtracking Embedding (NOBE), which offers a new perspective that organizes graph data at a deep level by tracking the flow traversing on the edges with backtracking prohibited. Further, by analyzing the non-backtracking process, a technique called graph approximation is devised, which provides a channel to transform the spectral decomposition on an edge-to-edge matrix to that on a node-to-node matrix. Theoretical guarantees are provided by bounding the difference between the corresponding eigenvalues of the original graph and its graph approximation. Extensive experiments conducted on various real-world networks demonstrate the efficacy of our methods on both macroscopic and microscopic levels, including clustering and structural hole spanner detection.Comment: SDM 2018 (Full version including all proofs