Dynamics of domain wall networks with junctions

Physics – High Energy Physics – High Energy Physics - Phenomenology

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Submitted to Phys. Rev. D

Scientific paper

10.1103/PhysRevD.78.103508

We use a combination of analytic tools and an extensive set of the largest and most accurate three-dimensional field theory numerical simulations to study the dynamics of domain wall networks with junctions. We build upon our previous work and consider a class of models which, in the limit of large number $N$ of coupled scalar fields, approaches the so-called `ideal' model (in terms of its potential to lead to network frustration). We consider values of $N$ between N=2 and N=20, and a range of cosmological epochs, and we also compare this class of models with other toy models used in the past. In all cases we find compelling evidence for a gradual approach to scaling, strongly supporting our no-frustration conjecture. We also discuss the various possible types of junctions (including cases where there is a hierarchy of them) and their roles in the dynamics of the network. Finally, we revise the Zel'dovich bound and provide an updated cosmological bound on the energy scale of this type of defect network: it must be lower than $10 {\rm keV}$.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Dynamics of domain wall networks with junctions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Dynamics of domain wall networks with junctions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dynamics of domain wall networks with junctions will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-313196

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.