相关论文: Invaded cluster algorithm for equilibrium critical…
We promote use of the geometric entropy formula derived by Holzhey et. al. from conformal field theory, $S_\ell\sim ({c}/{3}) \log(\sin{\pi\ell}/{N})$, to identify critical regions in zero temperature 1D quantum systems. The method is…
Recently a cluster Monte Carlo algorithm has been used very successfully in the two-dimensional Edwards-Anderson (EA) model. We show that this algorithm and a variant thereof can also be used successfully in models with a non-zero spin…
Working within the Stochastic Series Expansion (SSE) framework, we construct efficient quantum cluster algorithms for transverse field Ising antiferromagnets on the pyrochlore lattice and the planar pyrochlore lattice, for the fully…
Spin glasses are notoriously difficult to study both analytically and numerically due to the presence of frustration and metastability. Their highly non-convex landscapes require collective updates to explore efficiently. Currently, most…
When simulating a lattice system near its critical temperature, local algorithms for modeling the system's evolution can introduce very large autocorrelation times into sampled data. This critical slowing down places restrictions on the…
We study the problem of clustering sequences of unlabeled point sets taken from a common metric space. Such scenarios arise naturally in applications where a system or process is observed in distinct time intervals, such as biological…
It is well known that conventional simulation algorithms are inefficient for the statistical description of macroscopic systems exactly at the critical point due to the divergence of the corresponding relaxation time (critical slowing…
Monte Carlo simulations are methods for simulating statistical systems. The aim is to generate a representative ensemble of configurations to access thermodynamical quantities without the need to solve the system analytically or to perform…
After a sudden quench from the disordered high-temperature $T_0\to\infty$ phase to a final temperature below the critical point $T_F \ll T_c$, the non-conserved order parameter dynamics of the two-dimensional ferromagnetic Ising model on a…
The problem of change-point estimation is considered under a general framework where the data are generated by unknown stationary ergodic process distributions. In this context, the consistent estimation of the number of change-points is…
We study invasion percolation in two dimensions. We compare connectivity properties of the origin's invaded region to those of (a) the critical percolation cluster of the origin and (b) the incipient infinite cluster. To exhibit…
A generalization to the quantum case of a recently introduced algorithm (Y. Tomita and Y. Okabe, Phys. Rev. Lett. {\bf 86}, 572 (2001)) for the determination of the critical temperature of classical spin models is proposed. We describe a…
We study the geometric properties of a system initially in equilibrium at a critical point that is suddenly quenched to another critical point and subsequently evolves towards the new equilibrium state. We focus on the bidimensional Ising…
The study of the Ising model from a percolation perspective has played a significant role in the modern theory of critical phenomena. We consider the celebrated square-lattice Ising model and construct percolation clusters by placing bonds,…
Dilute dipolar Ising magnets remain a notoriously hard problem to tackle both analytically and numerically because of long-ranged interactions between spins as well as rare region effects. We study a new type of anisotropic dilute dipolar…
The dynamics of the spins in the Ising model are analyzed using a virtual walk scenario. The system is quenched from a very high temperature to a lower one using the Glauber scheme in one and two dimensions. A walk is associated with each…
3D perception in point clouds is transforming the perception ability of future intelligent machines. Point cloud algorithms, however, are plagued by irregular memory accesses, leading to massive inefficiencies in the memory sub-system,…
Invasion percolation is a stochastic growth model that follows a greedy algorithm. After assigning i.i.d. uniform random variables (weights) to all edges of $\mathbb{Z}^d$, the growth starts at the origin. At each step, we adjoin to the…
The recent solution to the fermion sign problem allows, for the first time, the use of cluster algorithm techniques to compute certain fermionic path integrals. To illustrate the underlying ideas behind the progress, a cluster algorithm is…
We investigate the geometry of a typical spin cluster in random triangulations sampled with a probability proportional to the energy of an Ising configuration on their vertices, both in the finite and infinite volume settings. This model is…