Related papers: Correlation of clusters: Partially truncated corre…
Equal time spin--spin and pair field correlation functions are calculated for a two-chain Hubbard model using a density-matrix numerical renormalization group approach. At half-filling, the antiferromagnetic and pair field correlations both…
This paper investigates the intrinsic group structures within the framework of large-dimensional approximate factor models, which portrays homogeneous effects of the common factors on the individuals that fall into the same group. To this…
We use a previously introduced mapping between the continuum percolation model and the Potts fluid (a system of interacting s-states spins which are free to move in the continuum) to derive the low density expansion of the pair…
We present a method to describe driven-dissipative multi-mode systems by considering a truncated hierarchy of equations for the correlation functions. We consider two hierarchy truncation schemes with a global cutoff on the correlation…
By a small-size complex network of coupled chaotic Hindmarsh-Rose circuits, we study experimentally the stability of network synchronization to the removal of shortcut links. It is shown that the removal of a single shortcut link may…
This paper deals with the construction of a correlation decay tree (hypertree) for interacting systems modeled using graphs (hypergraphs) that can be used to compute the marginal probability of any vertex of interest. Local message passing…
The two-point correlation function (2pcf) is the key statistic in structure formation; it measures the clustering of galaxies or other density field tracers. Estimators of the 2pcf, including the standard Landy-Szalay (LS) estimator,…
Jigsaw percolation is a nonlocal process that iteratively merges connected clusters in a deterministic "puzzle graph" by using connectivity properties of a random "people graph" on the same set of vertices. We presume the Erdos--Renyi…
We present a number of results relating partial Cauchy-Littlewood sums, integrals over the compact classical groups, and increasing subsequences of permutations. These include: integral formulae for the distribution of the longest…
We present a novel algorithm that allows one to obtain temperature dependent properties of quantum lattice models in the thermodynamic limit from exact diagonalization of small clusters. Our Numerical Linked Cluster (NLC) approach provides…
We study the temporal k-core component search (TCCS), which outputs the k-core containing the query vertex in the snapshot over an arbitrary query time window in a temporal graph. The problem has been shown to be critical for tasks such as…
Starting from a semiclassical approach recently developed for spectral correlation functions of quantum systems whose classical dynamics is chaotic, we focus on the case of broken time-reversal symmetry, the so-called unitary class. We…
We observed a phase transition-like behavior that is marked by the onset of the realization of the connectivity between two sites on a two-dimensional cross-section of a three-dimensional percolation cluster. This was found using…
Frozen percolation on the binary tree was introduced by Aldous around fifteen years ago, inspired by sol-gel transitions. We investigate a version of the model on the triangular lattice, where connected components stop growing ("freeze") as…
The initial purpose of this work is to provide a probabilistic explanation of a recent result on a version of Smoluchowski's coagulation equations in which the number of aggregations is limited. The latter models the deterministic evolution…
The site percolation on the triangular lattice stands out as one of the few exactly solved statistical systems. By initially configuring critical percolation clusters of this model and randomly reassigning the color of each percolation…
Spectral Clustering as a relaxation of the normalized/ratio cut has become one of the standard graph-based clustering methods. Existing methods for the computation of multiple clusters, corresponding to a balanced $k$-cut of the graph, are…
A cluster tree provides a highly-interpretable summary of a density function by representing the hierarchy of its high-density clusters. It is estimated using the empirical tree, which is the cluster tree constructed from a density…
The classical matrix-tree theorem relates the determinant of the combinatorial Laplacian on a graph to the number of spanning trees. We generalize this result to Laplacians on one- and two-dimensional vector bundles, giving a combinatorial…
The physical properties of a classical many-particle system with interactions given by a repulsive Gaussian pair potential are extended to arbitrarily high Euclidean dimensions. The goals of this paper are to characterize the behavior of…