Related papers: Macroscopic cycles for the interchange and quantum…
We study a family of random permutation models on the Hamming graph $H(2,n)$ (i.e., the $2$-fold Cartesian product of complete graphs), containing the interchange process and the cycle-weighted interchange process with parameter $\theta >…
We present a systematic analysis of quantum Heisenberg-, XY- and interchange models on the complete graph. These models exhibit phase transitions accompanied by spontaneous symmetry breaking, which we study by calculating the generating…
We study the weighted version of the interchange process where a permutation receives weight $\theta^{\#\mathrm{cycles}}$. For $\theta=2$ this is T\'oth's representation of the quantum Heisenberg ferromagnet on the complete graph. We prove,…
We prove the occurrence of a phase transition accompanied by the emergence of cycles of diverging lengths in the random interchange process on the hypercube.
The interchange process on a finite graph is obtained by placing a particle on each vertex of the graph, then at rate 1, selecting an edge uniformly at random and swapping the two particles at either end of this edge. In this paper we…
We consider an extension of the interchange process on the complete graph, in which a fraction of the transpositions are replaced by `reversals'. The model is motivated by statistical physics, where it plays a role in stochastic…
Consider the interchange process on a connected graph $G=(V,E)$ on $n$ vertices. I.e.\ shuffle a deck of cards by first placing one card at each vertex of $G$ in a fixed order and then at each tick of the clock, picking an edge uniformly at…
Consider the process of random transpositions on the complete graph. We use representation theory to give an exact, simple formula for the expected number of cycles of size k at time t, in terms of an incomplete Beta function. Using this we…
The `random intersection graph with communities' models networks with communities, assuming an underlying bipartite structure of groups and individuals. Each group has its own internal structure described by a (small) graph, while groups…
Quantum entanglement is the quintessence of quantum information processing mostly limited to the microscopic regime governed by Heisenberg uncertainty principle. For practical applications, however, macroscopic entanglement gives great…
We offer a solution to a long-standing problem in the physics of networks, the creation of a plausible, solvable model of a network that displays clustering or transitivity -- the propensity for two neighbors of a network node also to be…
We present a new theoretical approach for the study of the phase diagram of interacting quantum particles: bosons, fermions or spins. In the neighborhood of a phase transition, the expected renormalization group structure is recovered both…
We study random subcube intersection graphs, that is, graphs obtained by selecting a random collection of subcubes of a fixed hypercube $Q_d$ to serve as the vertices of the graph, and setting an edge between a pair of subcubes if their…
We give estimates of the critical parameter for random loop models that are related to quantum spin systems. A special case of the model that we consider is the interchange- or random-stirring process. We consider here the model defined on…
Random intersection graphs containing an underlying community structure are a popular choice for modelling real-world networks. Given the group memberships, the classical random intersection graph is obtained by connecting individuals when…
We study a one parameter family of random graph models that spans a continuum between traditional random graphs of the Erd\H{o}s-R\'enyi type, where there is no underlying structure, and percolation models, where the possible edges are…
We discuss the interrelation between phase transitions in interacting lattice or continuum models, and the existence of infinite clusters in suitable random-graph models. In particular, we describe a random-geometric approach to the phase…
We describe random loop models and their relations to a family of quantum spin systems on finite graphs. The family includes spin 1/2 Heisenberg models with possibly anisotropic spin interactions and certain spin 1 models with…
We consider a model of random permutations of the sites of the cubic lattice. Permutations are weighted so that sites are preferably sent onto neighbors. We present numerical evidence for the occurrence of a transition to a phase with…
We give a short and completely elementary method to find the full spectrum of the exclusion process and a nicely limited superset of the spectrum of the interchange process (a.k.a.\ random transpositions) on the complete graph. In the case…