相关论文: The interchange process with reversals on the comp…
We generalize the random graph evolution process of Bohman, Frieze, and Wormald [T. Bohman, A. Frieze, and N. C. Wormald, Random Struct. Algorithms, 25, 432 (2004)]. Potential edges, sampled uniformly at random from the complete graph, are…
We introduce random interlacements for transient vertex-reinforced jump processes on a general graph $G$. Using increasing finite subgraphs $G_n$ of $G$ with wired boundary conditions, we show convergence of the vertex-reinforced jump…
A dynamical process that takes a random time to complete, e.g., a chemical reaction, may either be accelerated or hindered due to resetting. Tuning system parameters such as temperature, viscosity or concentration, can invert the effect of…
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…
The function of a real network depends not only on the reliability of its own components, but is affected also by the simultaneous operation of other real networks coupled with it. Robustness of systems composed of interdependent network…
The generalised random graph contains $n$ vertices with positive i.i.d. weights. The probability of adding an edge between two vertices is increasing in their weights. We require the weight distribution to have finite second moments and…
We analyze the component evolution in inhomogeneous random intersection graphs when the average degree is close to 1. As the average degree increases, the size of the largest component in the random intersection graph goes through a phase…
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)…
We introduce a model of epidemics among moving particles on any locally finite graph. At any time, each vertex is empty, occupied by a healthy particle, or occupied by an infected particle. Infected particles recover at rate $1$ and…
We introduce a model for stochastic transport on a one-dimensional substrate with particles assuming different conformations during their stepping cycles. These conformations correspond to different footprints on the substrate: in order to…
Aspects of cell metabolism are modeled by ordinary differential equations describing the change of intracellular chemical concentrations. There is a correspondence between this dynamical system and a complex network. As in the classic…
We study the effect of interfacial phenomena in two-dimensional perfect and random (or disordered) $q$-state Potts models with continuous phase transitions, using, mainly, Monte Carlo techniques. In particular, for the total interfacial…
Message passing, also known as belief propagation, is a versatile framework for analyzing models defined on graphs. Its most prototypical application is percolation; yet, the interpretation of the message passing formulation of percolation…
The graph of overlapping permutations is a directed graph that is an analogue to the De Bruijn graph. It consists of vertices that are permutations of length $n$ and edges that are permutations of length $n+1$ in which an edge $a_1\cdots…
We study the asymptotic behavior of short cycles of random permutations with cycle weights. More specifically, on a specially constructed metric space whose elements encode all possible cycles, we consider a point process containing all…
Given a weighted graph, we introduce a partition of its vertex set such that the distance between any two clusters is bounded from below by a power of the minimum weight of both clusters. This partition is obtained by recursively merging…
The combination of protrusions and retractions in the movement of polarized cells leads to understand the effect of possible synchronisation between the two ends of the cells. This synchronisation, in turn, could lead to different dynamics…
In recent decades, it has been emphasized that the evolving structure of networks may be shaped by interaction principles that yield sparse graphs with a vertex degree distribution exhibiting an algebraic tail, and other structural traits…
For a graph with edge ordering, a linear order on the edge set, we obtain a permutation of vertices by considering the edges as transpositions of endvertices. It is known from D\'enes' results that the permutation of a tree is a full cyclic…
This paper studies thresholds in random generalized Johnson graphs for containing large cycles, i.e. cycles of variable length growing with the size of the graph. Thresholds are obtained for different growth rates.