Related papers: On the phase transition curve in a directed expone…
We demonstrate how to generalize two of the most well-known random graph models, the classic random graph, and random graphs with a given degree distribution, by the introduction of hidden variables in the form of extra degrees of freedom,…
A one-dimensional model on a line of the length L is investigated, which involves particle diffusion as well as single particle annihilation. There are also creation and annihilation at the boundaries. The static and dynamical behaviors of…
Fitting a graphical model to a collection of random variables given sample observations is a challenging task if the observed variables are influenced by latent variables, which can induce significant confounding statistical dependencies…
We analyse features of the patterns formed from a simple model for a martensitic phase transition. This is a fragmentation model that can be encoded by a general branching random walk. An important quantity is the distribution of the…
The generic feature of traffic in a network of flowing electronic data packets is a phase transition from a stationary free-flow phase to a continuously growing congested non-stationary phase. In the most simple network of directed oriented…
Let $\mathbb{S}_g$ be the orientable surface of genus $g$. We prove that the component structure of a graph chosen uniformly at random from the class $\mathcal{S}_g(n,m)$ of all graphs on vertex set $[n]=\{1,\dotsc,n\}$ with $m$ edges…
We present a linear stability analysis of stationary states (or fixed points) in large dynamical systems defined on random directed graphs with a prescribed distribution of indegrees and outdegrees. We obtain two remarkable results for such…
We study the $k$-core of a random (multi)graph on $n$ vertices with a given degree sequence. In our previous paper [Random Structures Algorithms 30 (2007) 50--62] we used properties of empirical distributions of independent random variables…
We study the stabilization time of a wide class of processes on graphs, in which each node can only switch its state if it is motivated to do so by at least a $\frac{1+\lambda}{2}$ fraction of its neighbors, for some $0 < \lambda < 1$. Two…
Exponential random graph models (ERGMs) are widely used for modeling social networks observed at one point in time. However the computational difficulty of ERGM parameter estimation has limited the practical application of this class of…
Energy-based models for discrete domains, such as graphs, explicitly capture relative likelihoods, naturally enabling composable probabilistic inference tasks like conditional generation or enforcing constraints at test-time. However,…
We investigate the contact process on four different types of scale-free inhomogeneous random graphs evolving according to a stationary dynamics, where each potential edge is updated with a rate depending on the strength of the adjacent…
We calculate exponential growth constants describing the asymptotic behavior of several quantities enumerating classes of orientations of arrow variables on the bonds of several types of directed lattice strip graphs $G$ of finite width and…
We investigate the dynamics of a gas of non-interacting particle-like soliton waves, demonstrating that phase transitions originate from their collective behavior. This is predicted by solving exactly the nonlinear equations and by…
We introduce two simple two-dimensional lattice models to study traffic flow in cities. We have found that a few basic elements give rise to the characteristic phase diagram of a first-order phase transition from a freely moving phase to a…
We analyse the normal quotient structure of several infinite families of finite connected edge-transitive, four-valent oriented graphs. These families were singled out by Marusic and others to illustrate various different internal…
We consider the contact process on a dynamic graph defined as a random $d$-regular graph with a stationary edge-switching dynamics. In this graph dynamics, independently of the contact process state, each pair $\{e_1,e_2\}$ of edges of the…
We introduce two simple two-dimensional lattice models to study traffic flow in cities. We have found that a few basic elements give rise to the characteristic phase diagram of a first-order phase transition from a freely moving phase to a…
Percolation is perhaps the simplest example of a process exhibiting a phase transition and one of the most studied phenomena in statistical physics. The percolation transition is continuous if sites/bonds are occupied independently with the…
We analyze a minimal model of a growing network. At each time step, a new vertex is added; then, with probability delta, two vertices are chosen uniformly at random and joined by an undirected edge. This process is repeated for t time…