Related papers: Macroscopic cycles for the interchange and quantum…
In exchange processes clusters composed of elementary building blocks, monomers, undergo binary exchange in which a monomer is transferred from one cluster to another. In assortative exchange only clusters with comparable masses participate…
In this work, building on state-of-the-art quantum Monte Carlo simulations, we perform systematic finite-size scaling of both entanglement and participation entropies for long-range Heisenberg chain with unfrustrated power-law decaying…
By studying the commuting graphs of conjugacy classes of the sequence of Heisenberg groups $H_{2n+1}(p)$ and their limit $H_\infty(p)$ we find pseudo-random behavior (and the random graph in the limiting case). This makes a nice case study…
We introduce a very general model of an inhomogenous random graph with independence between the edges, which scales so that the number of edges is linear in the number of vertices. This scaling corresponds to the p=c/n scaling for G(n,p)…
A graph is said to exhibit perfect state transfer (PST) if one of its corresponding Hamiltonian matrices, which are based on the vertex-edge structure of the graph, gives rise to PST in a quantum information-theoretic context, namely with…
The development of Graph Neural Networks (GNNs) has led to great progress in machine learning on graph-structured data. These networks operate via diffusing information across the graph nodes while capturing the structure of the graph.…
The gate version of quantum computation exploits several quantum key resources as superposition and entanglement to reach an outstanding performance. In the way, this theory was constructed adopting certain supposed processes imitating…
Hypergraphs naturally represent higher-order interactions, which persistently appear from social interactions to neural networks and other natural systems. Although their importance is well recognized, a theoretical framework to describe…
We have considered the $S=1/2$ antiferromagnetic Heisenberg model in two dimensions, with an additional Ising \nnn interaction. Antiferromagnetic \nnn interactions will lead to frustration, and the system responds with flipping the spins…
Many real-world interactions (e.g., researcher collaborations and email communication) occur among multiple entities. These group interactions are naturally modeled as hypergraphs. In graphs, transitivity is helpful to understand the…
The intention of the paper is to move a step towards a classification of network topologies that exhibit periodic quantum dynamics. We show that the evolution of a quantum system, whose hamiltonian is identical to the adjacency matrix of a…
The focus of this thesis is about statistical mechanics on heterogeneous random graphs, i.e. how this heterogeneity affects the cooperative behavior of model systems. It is not intended as a review on it, rather it is showed how this…
Hybrid percolation transitions (HPTs) induced by cascading processes have been observed in diverse complex systems such as $k$-core percolation, breakdown on interdependent networks and cooperative epidemic spreading models. Much effort has…
We present a detailed analysis of the Kitaev--Heisenberg model on a single hexagon. The energy spectra and spin--spin correlations obtained using exact diagonalisation indicate quantum phase transitions between antiferromagnetic and…
Effects of randomness on the spin-1/2 and 1 antiferromagnetic Heisenberg chains are studied using the quantum Monte Carlo method with the continuous-time loop algorithm. We precisely calculated the uniform susceptibility, string order…
We demonstrate that graph-based models are fully capable of representing higher-order interactions, and have a long history of being used for precisely this purpose. This stands in contrast to a common claim in the recent literature on…
Random intersection graphs have received much interest and been used in diverse applications. They are naturally induced in modeling secure sensor networks under random key predistribution schemes, as well as in modeling the topologies of…
We consider homological edge percolation on a sequence $(\mathcal{G}_t)_t$ of finite graphs covered by an infinite (quasi)transitive graph $\mathcal{H}$, and weakly convergent to $\mathcal{H}$. Namely, we use the covering maps to classify…
This is a presentation of recent work on quantum permutation groups. Contains: a short introduction to operator algebras and Hopf algebras; quantum permutation groups, and their basic properties; diagrams, integration formulae, asymptotic…
The finite-size behaviours of the homogeneous sine-Gordon models are analysed in detail, using the thermodynamic Bethe ansatz. Crossovers are observed which allow scales associated with both stable and unstable quantum particles to be…