Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userCriticality on networks with topology-dependent interactions
60
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Weighted scale-free networks with topology-dependent interactions are studied. It is shown that the possible universality classes of critical behaviour, which are known to depend on topology, can also be explored by tuning the form of the interactions at fixed topology. For a model of opinion formation, simple mean field and scaling arguments show that a mapping $gamma=(gamma-mu)/(1-mu)$ describes how a shift of the standard exponent $gamma$ of the degree distribution can absorb the effect of degree-dependent pair interactions $J_{ij} propto (k_ik_j)^{-mu}$, where $k_i$ stands for the degree of vertex $i$. This prediction is verified by extensive numerical investigations using the cavity method and Monte Carlo simulations. The critical temperature of the model is obtained through the Bethe-Peierls approximation and with the replica technique. The mapping can be extended to nonequilibrium models such as those describing the spreading of a disease on a network.
rate research
Read More
We study the dynamics of networks with coupling delay, from which the connectivity changes over time. The synchronization properties are shown to depend on the interplay of three time scales: the internal time scale of the dynamics, the coupling delay along the network links and time scale at which the topology changes. Concentrating on a linearized model, we develop an analytical theory for the stability of a synchronized solution. In two limit cases the system can be reduced to an effective topology: In the fast switching approximation, when the network fluctuations are much faster than the internal time scale and the coupling delay, the effective network topology is the arithmetic mean over the different topologies. In the slow network limit, when the network fluctuation time scale is equal to the coupling delay, the effective adjacency matrix is the geometric mean over the adjacency matrices of the different topologies. In the intermediate regime the system shows a sensitive dependence on the ratio of time scales, and specific topologies, reproduced as well by numerical simulations. Our results are shown to describe the synchronization properties of fluctuating networks of delay-coupled chaotic maps.
We study synchronization dynamics of a population of pulse-coupled oscillators. In particular, we focus our attention in the interplay between networks topological disorder and its synchronization features. Firstly, we analyze synchronization time $T$ in random networks, and find a scaling law which relates $T$ to networks connectivity. Then, we carry on comparing synchronization time for several other topological configurations, characterized by a different degree of randomness. The analysis shows that regular lattices perform better than any other disordered network. The fact can be understood by considering the variability in the number of links between two adjacent neighbors. This phenomenon is equivalent to have a non-random topology with a distribution of interactions and it can be removed by an adequate local normalization of the couplings.
In real networks, the dependency between nodes is ubiquitous; however, the dependency is not always complete and homogeneous. In this paper, we propose a percolation model with weak and heterogeneous dependency; i.e., dependency strengths could be different between different nodes. We find that the heterogeneous dependency strength will make the system more robust, and for various distributions of dependency strengths both continuous and discontinuous percolation transitions can be found. For ErdH{o}s-R{e}nyi networks, we prove that the crossing point of the continuous and discontinuous percolation transitions is dependent on the first five moments of the dependency strength distribution. This indicates that the discontinuous percolation transition on networks with dependency is determined not only by the dependency strength but also by its distribution. Furthermore, in the area of the continuous percolation transition, we also find that the critical point depends on the first and second moments of the dependency strength distribution. To validate the theoretical analysis, cases with two different dependency strengths and Gaussian distribution of dependency strengths are presented as examples.
Models for non-unitary quantum dynamics, such as quantum circuits that include projective measurements, have been shown to exhibit rich quantum critical behavior. There are many complementary perspectives on this behavior. For example, there is a known correspondence between d-dimensional local non-unitary quantum circuits and tensor networks on a D=(d+1)-dimensional lattice. Here, we show that in the case of systems of non-interacting fermions, there is furthermore a full correspondence between non-unitary circuits in d spatial dimensions and unitary non-interacting fermion problems with static Hermitian Hamiltonians in D=(d+1) spatial dimensions. This provides a powerful new perspective for understanding entanglement phases and critical behavior exhibited by non-interacting circuits. Classifying the symmetries of the corresponding non-interacting Hamiltonian, we show that a large class of random circuits, including the most generic circuits with randomness in space and time, are in correspondence with Hamiltonians with static spatial disorder in the ten Altland-Zirnbauer symmetry classes. We find the criticality that is known to occur in all of these classes to be the origin of the critical entanglement properties of the corresponding random non-unitary circuit. To exemplify this, we numerically study the quantum states at the boundary of Haar-random Gaussian fermionic tensor networks of dimension D=2 and D=3. We show that the most general such tensor network ensemble corresponds to a unitary problem of non-interacting fermions with static disorder in Altland-Zirnbauer symmetry class DIII, which for both D=2 and D=3 is known to exhibit a stable critical metallic phase. Tensor networks and corresponding random non-unitary circuits in the other nine Altland-Zirnbauer symmetry classes can be obtained from the DIII case by implementing Clifford algebra extensions for classifying spaces.
We uncover a local order parameter for measurement-induced phase transitions: the average entropy of a single reference qubit initially entangled with the system. Using this order parameter, we identify scalable probes of measurement-induced criticality (MIC) that are immediately applicable to advanced quantum computing platforms. We test our proposal on a 1+1 dimensional stabilizer circuit model that can be classically simulated in polynomial time. We introduce the concept of a decoding light cone to establish the local and efficiently measurable nature of this probe. We also estimate bulk and surface critical exponents for the transition. Developing scalable probes of MIC in more general models may be a useful application of noisy-intermediate scale quantum (NISQ) devices, as well as point to more efficient realizations of fault-tolerant quantum computation.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
