Related papers: Inapproximability for Antiferromagnetic Spin Syste…
Finding a d-regular spanning subgraph (or d-factor) of a graph is easy by Tutte's reduction to the matching problem. By the same reduction, it is easy to find a minimal or maximal d-factor of a graph. However, if we require that the…
Hyperuniform states of matter are characterized by anomalous suppression of long-wavelength density fluctuations. While most of interesting cases of disordered hyperuniformity are provided by complex many-body systems like liquids or…
We analyze the ferromagnetic Ising model on a scale-free tree; the growing random network model with the linear attachment kernel $A_k=k+\alpha$ introduced by [Krapivsky et al.: Phys. Rev. Lett. {\bf 85} (2000) 4629-4632]. We derive an…
The identification of microscopic models describing the low-energy properties of correlated materials has been a central goal of spectroscopic measurements. We demonstrate how 2D non-linear spectroscopy can be used to distinguish effective…
The common feature for a nontrivial hard problem is the existence of nontrivial topological structures, non-planarity graphs, nonlocalities, or long-range spin entanglements in a model system with randomness. For instance, the Boolean…
To develop new devices based on synthetic ferrimagnetic heterostructures, understanding the material's physical properties is pivotal. Here, the induced magnetic moment (IMM), magnetic exchange coupling, and spin textures are investigated…
Altermagnets combine antiferromagnetic order with ferromagnet-like spin splitting, a duality that unlocks ultrafast spin-dependent responses. This unique property creates unprecedented opportunities for spin-current generation, overcoming…
We report some results on the quenched disordered Spherical multi-$p$-Spin Model in presence of ferromagnetic couplings. In particular, we present the phase diagrams of some representative cases that schematically describe, in the…
Random graph alignment refers to recovering the underlying vertex correspondence between two random graphs with correlated edges. This can be viewed as an average-case and noisy version of the well-known graph isomorphism problem. For the…
This paper develops results for the next nearest neighbour Ising model on random graphs. Besides being an essential ingredient in classic models for frustrated systems, second neighbour interactions interactions arise naturally in several…
We study the problem of assortative and disassortative partitions on random $d$-regular graphs. Nodes in the graph are partitioned into two non-empty groups. In the assortative partition every node requires at least $H$ of their neighbors…
In a variety of systems which exhibit aging, the two-time response function scales as $R(t,s)\approx s^{-1-a} f(t/s)$. We argue that dynamical scaling can be extended towards conformal invariance, obtaining thus the explicit form of the…
We study the structure learning problem for $H$-colorings, an important class of Markov random fields that capture key combinatorial structures on graphs, including proper colorings and independent sets, as well as spin systems from…
Altermagnetism, a recently proposed and experimentally confirmed class of magnetic order, features collinear compensated magnetism with unconventional d-, g-, or i-wave spin order. Here, we show that in a metallic 2D d-wave altermagnet with…
Accurate determination of the full momentum-dependent spin susceptibility $\chi(\mathbf{q}) $ is very important for the description of magnetism and superconductivity. While in principle the formalism for calculating $\chi(\mathbf{q})$ in…
The stability of the ferromagnetic phase of the 2D quantum spin-1/2 model with nearest-neighbor ferro- and next-nearest neighbor antiferromagnetic interactions is studied. It turns out that values of exchange integrals at which the…
We consider quantum error-correcting subsystem codes whose gauge generators realize a translation-invariant, free-fermion-solvable spin model. In this setting, errors are suppressed by a Hamiltonian whose terms are the gauge generators of…
We investigate the tractability of a simple fusion of two fundamental structures on graphs, a spanning tree and a perfect matching. Specifically, we consider the following problem: given an edge-weighted graph, find a minimum-weight…
The physics of complex systems stands to greatly benefit from the qualitative changes in data availability and advances in data-driven computational methods. Many of these systems can be represented by interacting degrees of freedom on…
This paper is aimed to investigate some computational aspects of different isoperimetric problems on weighted trees. In this regard, we consider different connectivity parameters called {\it minimum normalized cuts}/{\it isoperimteric…