Related papers: Macroscopic cycles for the interchange and quantum…
Uniform random intersection graphs have received much interest and been used in diverse applications. A uniform random intersection graph with $n$ nodes is constructed as follows: each node selects a set of $K_n$ different items uniformly…
We consider a spin-s Heisenberg model coupled to two-dimensional quantum gravity. We quantize the model using the Feynman path integral, summing over all possible two-dimensional geometries and spin configurations. We regularize this path…
Random graphs offer a useful mathematical representation of a variety of real world complex networks. Exponential random graphs, for example, are particularly suited towards generating random graphs constrained to have specified statistical…
Using density matrix renormalization group calculations, ground state properties of the spin-1 Heisenberg chain with exchange and single-ion anisotropies in an external field are studied. Our findings confirm and refine recent results by…
We consider a model for random hypergraphs with identifiability, an analogue of connectedness. This model has a phase transition in the proportion of identifiable vertices when the underlying random graph becomes critical. The phase…
We present a framework for analyzing collections of interacting hysterons through the lens of catastrophe theory. By modeling hysteron dynamics as a gradient system, we show how to construct hysteron transition graphs by characterizing the…
A lattice boson model is used to study ordering phenomena in regular 2D array of superconductive mesoscopic granules, Josephson junctions or pores filled with a superfluid helium. Phase diagram of the system, when quantum fluctuations of…
Tensor network formalisms have emerged as powerful tools for simulating quantum state evolution. While widely applied in the study of optical quantum circuits, such as Boson Sampling, existing tensor network approaches fail to address the…
We study a quantum theory based on two assumptions: In the intrinsic frame of reference of an isolated, macroscopic system, (i) the system has no global motion and is not entangled with any other system, (ii) time evolution of statevectors…
In this work, we investigate a simple nonequilibrium system with many interconnected, open subsystems, each exchanging a globally conserved resource with an external reserve. The system is represented by a random graph, where nodes…
Homogeneous Boltzmann-type equations are an established tool for modelling interacting multi-agent systems in sociophysics by means of the principles of statistical mechanics and kinetic theory. A customary implicit assumption is that…
In this work, we study the percolation transition and large deviation properties of generalized canonical network ensembles. This new type of random networks might have a very rich complex structure, including high heterogeneous degree…
We introduce a random intersection graph process aimed at modeling sparse evolving affiliation networks that admit tunable (power law) degree distribution and assortativity and clustering coefficients. We show the asymptotic degree…
We consider the group of permutations of the vertices of a lattice. A random walk is generated by unit steps that each interchange two nearest neighbor vertices of the lattice. We study the heat equation on the permutation group, using the…
We study a random graph model which is a superposition of the bond percolation model on $Z^d$ with probability $p$ of an edge, and a classical random graph $G(n, c/n)$. We show that this model, being a {\it homogeneous} random graph, has a…
We study the thermodynamics of the one-dimensional extended Hubbard model at half-filling using a density-matrix renormalization group method applied to transfer matrices. We show that the various phase transitions in this system can be…
We study the behavior of the random walk in a continuum independent long-range percolation model, in which two given vertices $x$ and $y$ are connected with probability that asymptotically behaves like $|x-y|^{-\alpha}$ with $\alpha>d$,…
Networks observed in the real world often have many short loops. This violates the tree-like assumption that underpins the majority of random graph models and most of the methods used for their analysis. In this paper we sketch possible…
The rigorous approach aimed at providing exact analytical results for hybrid classical-quantum models is elaborated on the grounds of generalized algebraic mapping transformations. This conceptually simple method allows one to obtain novel…
Classical blockmodel is known as the simplest among models of networks with community structure. The model can be also seen as an extremely simply example of interconnected networks. For this reason, it is surprising that the percolation…