Related papers: Improvements for Vachaspati-Vilenkin-type Algorith…
Understanding the evolution and cosmological consequences of topological defect networks requires a combination of analytic modeling and numerical simulations. The canonical analytic model for defect network evolution is the…
We calculate the corrections to the Fine Structure Constant in the spacetime of a cosmic string. These corrections stem from the generalized uncertainty principle. In the absence of a cosmic string our result here is in agreement with our…
A two-dimensional hydrogen atom offers a promising alternative for describing the quantum interaction between an electron and a proton in the presence of a straight cosmic string. Reducing the hydrogen atom to two dimensions enhances its…
This paper deals with the geometry of supermassive cosmic strings. We have used an approach that enforces the spacetime of cosmic strings to also satisfy the conservation laws of a cylindric gravitational topological defect, that is a…
In order to investigate the dependence on lattice size of several observables in percolation, the Hoshen-Kopelman algorithm was modified so that growing lattices could be simulated. By this way, when simulating a lattice of size L, lattices…
Virtual quark pair screening leads to breaking of the string between fundamental representation quarks in QCD. For unquenched four dimensional lattice QCD, this (so far elusive) phenomenon is studied using the recently developed truncated…
The existence of cosmic superstrings may be probed by astronomical time domain surveys. When crossing the line of sight to point-like sources, strings produce a distinctive microlensing signature. We consider two avenues to hunt for a relic…
Due to the complex characteristics of bottle-brush polymers, it became a challenge to develop an efficient algorithm for studying such macromolecules under various solvent conditions or some constraints in the space by using computer…
We present a new machine learning library for computing metrics of string compactification spaces. We benchmark the performance on Monte-Carlo sampled integrals against previous numerical approximations and find that our neural networks are…
In principle, the probability of configurations, determined by the system's partition function or wave function, encapsulates essential information about phases and phase transitions. Despite the exponentially large configuration space, we…
Finding an optimal match between two different crystal structures underpins many important materials science problems, including describing solid-solid phase transitions, developing models for interface and grain boundary structures. In…
Metastable cosmic strings appear in models of new physics with a two-step symmetry breaking $G\to H\to 1$, where $\pi_1(H)\neq 0$ and $\pi_1(G)=0$. They decay via the monopole-antimonopole pair creation inside. Conventionally, the breaking…
The self-organized Monte Carlo simulations of 2D Ising ferromagnet on the square lattice are performed. The essence of devised simulation method is the artificial dynamics consisting of the single-spin-flip algorithm of Metropolis…
Vector perturbations sourced by topological defects can generate rotations in the lensing of background galaxies. This is a potential smoking gun for the existence of defects since rotation generates a curl-like component in the weak…
Tessellations are valuable both conceptually and for analysis in the study of the large-scale structure of the universe. They provide a conceptual model for the 'cosmic web,' and are of great use to analyze cosmological data. Here we…
The critical behavior of the contact process in disordered and periodic binary 2d-lattices is investigated numerically by means of Monte Carlo simulations as well as via an analytical approximation and standard mean field theory.…
We investigate lattice simulations of scalar and nonabelian gauge fields in Minkowski space-time. For SU(2) gauge-theory expectation values of link variables in 3+1 dimensions are constructed by a stochastic process in an additional (5th)…
We consider dynamically constrained Monte-Carlo dynamics and show that this leads to the generation of long ranged effective interactions. This allows us to construct a local algorithm for the simulation of charged systems without ever…
This paper presents, in a unified fashion, deterministic as well as statistical Lagrangian-verification techniques. They formally quantify the behavioral robustness of any time-continuous process, formulated as a continuous-depth model. To…
We introduce a Monte Carlo method, as a modification of existing cluster algorithms, which allows simulations directly on systems of infinite size, and for quantum models also at beta=infinity. All two-point functions can be obtained,…