Related papers: Formation of an interface by competitive erosion
Small-world graphs, which combine randomized and structured elements, are seen as prevalent in nature. Jon Kleinberg showed that in some graphs of this type it is possible to route, or navigate, between vertices in few steps even with very…
As an alternative view to the graph formation models in the statistical physics community, we introduce graph formation models using \textit{network formation} through selfish competition as an approach to modeling graphs with particular…
We consider multi-player games played on graphs, in which the players aim at fulfilling their own (not necessarily antagonistic) objectives. In the spirit of evolutionary game theory, we suppose that the players have the right to repeatedly…
A coarse grained description of a two phase fluid is used to study the steady state configuration of the interface separating the coexisting phases, and the motion of the contact line at which the interface intersects a solid boundary. The…
We present a general formalism which allows us to derive the evolution equations describing one-dimensional (1D) and isotropic 2D interfacelike systems, that is based on symmetries, conservation laws, multiple scale arguments, and exploits…
This paper is concerned with diffuse-interface approximations of the Willmore flow. We first present numerical results of standard diffuse-interface models for colliding one dimensional interfaces. In such a scenario evolutions towards…
Competitive systems can exhibit both hierarchical (transitive) and cyclic (intransitive) structures. Despite theoretical interest in cyclic competition, which offers richer dynamics, and occupies a larger subset of the space of possible…
We study the structure and dynamics of the interface separating a passive fluid from a microtubule-based active fluid. Turbulent-like active flows power giant interfacial fluctuations, which exhibit pronounced asymmetry between regions of…
We give a constructive method for realizing an arbitrary directed graph (with no one-cycles) as a heteroclinic or an excitable dynamic network in the phase space of a system of coupled cells of two types. In each case, the system is…
The dynamics of spherical particles driven along an interface between two immiscible fluids is investigated asymptotically. Under the assumptions of a pinned three-phase contact line and very different viscosities of the two fluids, a…
For a graph whose vertex set is a finite set of points in the Euclidean $d$-space consider the closed (open) balls with diameters induced by its edges. The graph is called a (an open) Tverberg graph if these closed (open) balls intersect.…
The flow through a porous medium strongly depends on the boundary conditions, very often assumed to be static. Here, we consider changes in the medium due to swelling and erosion and extend existing Lattice-Boltzmann models to include both.…
We present a systematic derivation of the gradient flows associated to a broad class of interfacial energies, emphasizing the relation between intrinsic and extrinsic variations of the interface. We show that the intrinsic variables…
This article presents a multi-physics methodology for the numerical simulation of physical systems that involve the non-linear interaction of multi-phase reactive fluids and elastoplastic solids, inducing high strain-rates and high…
We study the coevolution of network structure and signaling behavior. We model agents who can preferentially associate with others in a dynamic network while they also learn to play a simple sender-receiver game. We have four major…
Triangles are abundant in real-world networks but rare in standard null models for sparse graphs. Existing explanations typically rely on explicit triadic closure mechanisms or geometry-based connection rules. We propose an alternative…
Random intersection graphs containing an underlying community structure are a popular choice for modelling real-world networks. Given the group memberships, the classical random intersection graph is obtained by connecting individuals when…
The exponential family of random graphs is one of the most promising class of network models. Dependence between the random edges is defined through certain finite subgraphs, analogous to the use of potential energy to provide dependence…
We predict the structural interaction of crystalline solid-melt interfaces using amplitude equations which are derived from classical density functional theory or phase-field-crystal modeling. The solid ordering decays exponentially on the…
An analysis is made of a moving disturbance using a directed cyclic graph. A statistical approach is used to calculate the alternative positions in space and state of the disturbance with a defined observed time. The probability for a…