Related papers: The two-star model: exact solution in the sparse r…
For the classification of rotating compact stars with two high density phases a phase diagram in the angular velocity (Omega) - baryon number (N) plane is investigated. The dividing line N_crit(Omega) between configurations with one and two…
We consider a natural variant of the Erd\H{o}s-R\'enyi random graph process in which $k$ vertices are special and are never put into the same connected component. The model is natural and interesting on its own, but is actually inspired by…
A sufficient criterion for "non-degeneracy" is given for Exponential Random Graph Models on sparse graphs with sufficient statistics which are functions of the degree sequence. This criterion explains why statistics such as alternating…
A network as a substrate for dynamic processes may have its own dynamics. We propose a model for networks which evolve together with diffusing particles through a coupled dynamics, and investigate emerging structural property. The model…
We study the asymptotics of large directed graphs, constrained to have certain densities of edges and/or outward $p$-stars. Our models are close cousins of exponential random graph models (ERGMs), in which edges and certain other subgraph…
A wide array of random graph models have been postulated to understand properties of observed networks. Typically these models have a parameter $t$ and a critical time $t_c$ when a giant component emerges. It is conjectured that for a large…
Percolation is a model for random damage to a network. It is one of the simplest models that displays a phase transition: when the network is severely damaged, it falls apart in many small connected components, while if the damage is light,…
We consider random networks whose dynamics is described by a rate equation, with transition rates $w_{nm}$ that form a symmetric matrix. The long time evolution of the system is characterized by a diffusion coefficient $D$. In one dimension…
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 current paper is a short review of rigorous results for the 1-2 model. The 1-2 model on the hexagonal lattice is a model of statistical mechanics in which each vertex is constrained to have degree either 1 or 2. It was proposed in a…
We introduce a method for the theoretical analysis of exponential random graph models. The method is based on a large-deviations approximation to the normalizing constant shown to be consistent using theory developed by Chatterjee and…
We present the Stagger-grid, a comprehensive grid of time-dependent, 3D hydrodynamic model atmospheres for late-type stars with realistic treatment of radiative transfer, covering a wide range in stellar parameters. This grid of 3D models…
The study and characterization of the diversity of spatiotemporal patterns generated when a rectangular layer of fluid is locally heated beneath its free surface is presented. We focus on the instability of a stationary cellular pattern of…
Random graphs undergo structural phase transitions that are crucial for dynamical processes and cooperative behavior of models defined on graphs. In this work we investigate the impact of a first-order structural transition on the…
This paper concerns the large deviations of a system of interacting particles on a random graph. There is no stochasticity, and the only sources of disorder are the random graph connections, and the initial condition. The average number of…
We study two models having an infinite-disorder critical point --- the zero temperature random transverse-field Ising model and the random contact process --- on a star-like network composed of $M$ semi-infinite chains connected to a common…
The 2-Edge-Connected Spanning Subgraph Problem (2ECSS) is a fundamental problem in survivable network design. Given an undirected $2$-edge-connected graph, the goal is to find a $2$-edge-connected spanning subgraph with the minimum number…
Network Models with couplings between link pairs are the simplest models for a class of networks with Higher Order interactions. In this paper we give an analytic, general solution to this family of Random Graph Models extending previous…
We study in detail the active Ising model, a stochastic lattice gas where collective motion emerges from the spontaneous breaking of a discrete symmetry. On a 2d lattice, active particles undergo a diffusion biased in one of two possible…
Several recent imaging experiments access the equilibrium density profiles of interacting particles confined to a two-dimensional substrate. When these particles are in a fluid phase, we show that such data yields precise information…