Related papers: Phase transitions on Markovian bipartite graphs - …
We compute the joint large deviation rate functional in the limit of large time for the current flowing through the edges of a finite graph on which a boundary-driven system of stochastic particles evolves with zero-range dynamics.This…
This study explores the relationship between the precise asymptotics of the level-two large deviation rate function and the behavior of metastable stochastic systems. Initially identified for overdamped Langevin dynamics (Ges{\`u} et al.,…
We study the problem of the existence of a giant component in a random multipartite graph. We consider a random multipartite graph with $p$ parts generated according to a given degree sequence $n_i^{\mathbf{d}}(n)$ which denotes the number…
We study algebraic properties of partition functions, particularly the location of zeros, through the lens of rapidly mixing Markov chains. The classical Lee-Yang program initiated the study of phase transitions via locating complex zeros…
We study the zero-range process on the complete graph. It is a Markov chain model for a microcanonical ensemble. We prove that the process converges to a fluid limit. The fluid limit rapidly relaxes to the appropriate Gibbs distribution.
In this paper, we study a bipartite analogue of the `random graphs evolving by degrees' process. We are given a bipartitioned set of vertices $V$ into two disjoint parts ${L}$ and ${R}$ and possibly unequal positive constants $\alpha$ and…
We review recent progress on the zero-range process, a model of interacting particles which hop between the sites of a lattice with rates that depend on the occupancy of the departure site. We discuss several applications which have…
In this paper, we study weakly interacting diffusion processes on random graphs. Our main focus is on the properties of the mean-field limit and, in particular, on the nonuniqueness and bifurcation structure of stationary states. By…
We study the giant component problem slightly above the critical regime for percolation on Poissonian random graphs in the scale-free regime, where the vertex weights and degrees have a diverging second moment. Critical percolation on…
The dynamics of a class of zero-range processes exhibiting a condensation transition in the stationary state is studied. The system evolves in time starting from a random disordered initial condition. The analytical study of the large-time…
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 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…
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…
We determine the asymptotic size of the largest component in the $2$-type binomial random graph $G(\mathbf{n},P)$ near criticality using a refined branching process approach. In $G(\mathbf{n},P)$ every vertex has one of two types, the…
A significant generalization of the Erd\"os-R\'enyi random graph model is an `inhomogeneous' random graph where the edge probabilities vary according to vertex types. We identify the threshold value for this random graph with a finite…
In this paper, we study a model of long-range site percolation on graphs of bounded degree, namely the Boolean percolation model. In this model, each vertex of an infinite connected graph is the center of a ball of random radius, and…
The largest connected component in duplication-divergence growing graphs with symmetric coupled divergence is studied. Finite-size scaling reveals a phase transition occurring at a divergence rate $\delta_c$. The $\delta_c$ found stands…
The zero-range process is a stochastic interacting particle system that exhibits a condensation transition under certain conditions on the dynamics. It has recently been found that a small perturbation of a generic class of jump rates leads…
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…
The weak component generalizes the idea of connected components to directed graphs. In this paper, an exact criterion for existence of the giant weak component is derived for directed graphs with arbitrary bivariate degree distributions. In…