Related papers: Formation of an interface by competitive erosion
A random intersection graph is constructed by independently assigning a subset of a given set of objects $W,$ to each vertex of the vertex set $V$ of a simple graph $G.$ There is an edge between two vertices of $V,$ iff their respective…
This paper presents a phenomenon which sometimes occurs in tetravalent bipartite locally dart-transitive graphs, called a Base Graph -- Connection Graph dissection. In this dissection, each white vertex is split into two vertices of valence…
Large-scale perturbations in the microbiome constitution are strongly correlated, whether as a driver or a consequence, with the health and functioning of human physiology. However, understanding the difference in the microbiome profiles of…
The one-dimensional nearest-neighbor totally asymmetric simple exclusion process can be constructed in the same space as a last-passage percolation model in Z^2. We show that the trajectory of a second class particle in the exclusion…
We present a edge-coloured analogue of the duality theorem for transitive tournaments and directed paths. Given a edge-coloured path $P$ whose edges alternate blue and red, we construct a edge-coloured graph $D$ so that for any…
We investigate the interface dynamic in Laplacian growth model, using the conformal mapping technique. Starting from the governing equation for the conformal map, obtained by B.Shraiman and D.Bensimon, we derive different possible forms of…
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 study competing first passage percolation on graphs generated by the configuration model. At time 0, vertex 1 and vertex 2 are infected with the type 1 and the type 2 infection, respectively, and an uninfected vertex then becomes type 1…
Social learning algorithms provide models for the formation of opinions over social networks resulting from local reasoning and peer-to-peer exchanges. Interactions occur over an underlying graph topology, which describes the flow of…
A model of an evolving network of interacting molecular species is shown to exhibit repeated rounds of crashes in which several species get rapidly depopulated, followed by recoveries. The network inevitably self-organizes into an…
Graphs arise naturally in many real-world applications including social networks, recommender systems, ontologies, biology, and computational finance. Traditionally, machine learning models for graphs have been mostly designed for static…
We study random graphs with latent geometric structure, where the probability of each edge depends on the underlying random positions corresponding to the two endpoints. We focus on the setting where this conditional probability is a…
A game-theoretic model for the study of dynamic networks is analyzed. The model is motivated by communication networks that are subject to failure of nodes and where the restoration needs resources. The corresponding two-player game is…
A normal odd partition T of the edges of a cubic graph is a partition into trails of odd length (no repeated edge) such that each vertex is the end vertex of exactly one trail of the partition and internal in some trail. For each vertex v,…
We consider a moving interface that is coupled to an elliptic equation in a heterogeneous medium. The problem is motivated by the study of displacive solid-solid phase transformations. We show that a nearly flat interface is given by the…
Stability of Wardrop equilibria is analyzed for dynamical transportation networks in which the drivers' route choices are influenced by information at multiple temporal and spatial scales. The considered model involves a continuum of…
An interface description and numerical simulations of model A kinetics are used for the first time to investigate the intra-surface kinetics of phase ordering on corrugated surfaces. Geometrical dynamical equations are derived for the…
Formation and competition of associations are studied in a six-species ecological model where each species has two predators and two prey. Each site of a square lattice is occupied by an individual belonging to one of the six species. The…
We introduce a technique called graph fission which takes in a graph which potentially contains only one observation per node (whose distribution lies in a known class) and produces two (or more) independent graphs with the same node/edge…
We find analytical solutions to the Cahn-Hilliard equation for the dynamics of an interface in a system with a conserved order parameter (Model B). We show that, although steady-state solutions of Model B are unphysical in the far-field,…