Related papers: The simplest nearest-neighbor spin system on regul…
We perform an analytical investigation of the cell interface dynamics in the framework of a minimal phase field model of cell motility suggested in [1], which consists of two coupled evolution equations for the order parameter and a…
We consider the Vertex Cover problem in intersection graphs of axis-parallel rectangles on the plane. We present two algorithms: The first is an EPTAS for non-crossing rectangle families, rectangle families $\calR$ where $R_1 \setminus R_2$…
The skew mean curvature flow(SMCF), which origins from the study of fluid dynamics, describes the evolution of a codimension two submanifold along its binormal direction. We study the basic properties of the SMCF and prove the existence of…
We offer a solution to a long-standing problem in the physics of networks, the creation of a plausible, solvable model of a network that displays clustering or transitivity -- the propensity for two neighbors of a network node also to be…
Minimum flow decomposition (MFD) is the NP-hard problem of finding a smallest decomposition of a network flow/circulation $X$ on a directed graph $G$ into weighted source-to-sink paths whose superposition equals $X$. We show that, for…
The Second Neighborhood Conjecture states that every simple digraph has a vertex whose second out-neighborhood is at least as large as its first out-neighborhood, i.e. a vertex with the Second Neighborhood Property. A cycle intersection…
We study the low temperature dynamics of a two dimensional short-range spin system with uniform ferromagnetic interactions, which displays glassiness at low temperatures despite the absence of disorder or frustration. The model has a dual…
It is known that families of graphs with a semialgebraic edge relation of bounded complexity satisfy much stronger regularity properties than arbitrary graphs, and that they can be decomposed into very homogeneous semialgebraic pieces up to…
We define the following parameter of connected graphs. For a given graph $G$ we place one agent in each vertex of $G$. Every pair of agents sharing a common edge is declared to be acquainted. In each round we choose some matching of $G$…
We discuss ergodicity breaking in frustrated disordered systems with no apparent broken symmetry of the Hamiltonian and present a way how to amend it in the low-temperature phase. We demonstrate this phenomenon on mean-field models of spin…
In this paper we provide a method of finding possible numbers of shortest paths between two points in a space of compact sets in Euclidean space with Hausdorff distance. We also prove that there cannot be some of the numbers of shortest…
The spread of traffic jams in urban networks has long been viewed as a complex spatio-temporal phenomenon that often requires computationally intensive microscopic models for analysis purposes. In this study, we present a framework to…
Many known networks have structure of affiliation networks, where each of $n$ network's nodes (actors) selects an attribute set from a given collection of $m$ attributes and two nodes (actors) establish adjacency relation whenever they…
The Laplacian spread of a graph is the difference between the largest eigenvalue and the second-smallest eigenvalue of the Laplacian matrix of the graph. We find that the class of strongly regular graphs attains the maximum of largest…
Statistical inference for exponential-family models of random graphs with dependent edges is challenging. We stress the importance of additional structure and show that additional structure facilitates statistical inference. A simple…
Bipartite graphs, representing two-mode networks, arise in many research fields. These networks have two disjoint node sets representing distinct entity types, for example persons and groups, with edges representing associations between the…
The mean-field theory (MFT) of simple glasses, which is exact in the limit of infinite spatial dimensions, $d\rightarrow\infty$, offers theoretical insight as well as quantitative predictions about certain features of $d=3$ systems. In…
Let $X$ be a compact Hausdorff space, with uniformity $\mathscr{U}$, and let $f \colon X \to X$ be a continuous function. For $D \in \mathscr{U}$, a $D$-pseudo-orbit is a sequence $(x_i)$ for which $(f(x_i),x_{i+1}) \in D$ for all indices…
The small amplitude perturbations of spins are considered in the four component antiferromagnetic materials with the equilibrium state of form up-up-down-down (uniaxial samples). Other configurations for the four component antiferromagnetic…
Typical-case computation complexity is a research topic at the boundary of computer science, applied mathematics, and statistical physics. In the last twenty years the replica-symmetry-breaking mean field theory of spin glasses and the…