相关论文: The simplest nearest-neighbor spin system on regul…
In this paper, we propose a new assumption (1.2) that involves a small oscillation and $C^2$ norms for maps from smooth bounded domains into Euclidean spaces. Furthermore, by assuming that the domain has non-negative Ricci curvature, we…
Representing spectral densities, real-frequency, and real-time Green's functions of continuous systems by a small discrete set of complex poles is an ubiquitous problem in condensed matter physics, with applications ranging from quantum…
A simple random walk on a graph is a sequence of movements from one vertex to another where at each step an edge is chosen uniformly at random from the set of edges incident on the current vertex, and then transitioned to next vertex.…
Ramsey spectroscopy has become a powerful technique for probing non-equilibrium dynamics of internal (pseudospin) degrees of freedom of interacting systems. In many theoretical treatments, the key to understanding the dynamics has been to…
We consider the following activation process in undirected graphs: a vertex is active either if it belongs to a set of initially activated vertices or if at some point it has at least $r$ active neighbors, where $r>1$ is the activation…
A notorious problem in mathematics and physics is to create a solvable model for random sequential adsorption of non-overlapping congruent spheres in the $d$-dimensional Euclidean space with $d\geq 2$. Spheres arrive sequentially at…
Exponential random graph models (ERGMs) are flexible probability models allowing edge dependency. However, it is known that, to a first-order approximation, many ERGMs behave like Erd\"os-R\'enyi random graphs, where edges are independent.…
In this paper we introduce and study the Minimum Edge Compact Spanner~(MECS) problem. We prove hardness results related to the problem, design exact and greedy algorithms for solving the problem, and show related experimental results. The…
Given a drawing of a graph, its \emph{visual complexity} is defined as the number of geometrical entities in the drawing, for example, the number of segments in a straight-line drawing or the number of arcs in a circular-arc drawing (in…
Low-energy magnetic excitations in the spin-1/2 chain compound (C$_6$H$_9$N$_2$)CuCl$_3$ [known as (6MAP)CuCl$_3$] are probed by means of tunable-frequency electron spin resonance. Two modes with asymmetric (with respect to the $h\nu=g\mu_B…
We study the complexity of sampling from the stationary distribution of a mean-field SDE, or equivalently, the complexity of minimizing a functional over the space of probability measures which includes an interaction term. Our main insight…
We consider first order variational MFG in the whole space, with aggregative interactions and density constraints, such that the stationary states of the game are contained in two isolated compact sets of mass distributions with finite…
We consider a system of $N$ particles whose interactions are characterized by a (weighted) graph $G^N$. Each particle is a node of the graph with an internal state. The state changes according to Markovian dynamics that depend on the states…
In these notes the main theoretical concepts and techniques in the field of mean-field spin-glasses are reviewed in a compact and pedagogical way, for the benefit of the graduate and undergraduate student. One particular spin-glass model is…
We consider the problem of completely covering an unknown discrete environment with a swarm of asynchronous, frequently-crashing autonomous mobile robots. We represent the environment by a discrete graph, and task the robots with occupying…
The next-nearest neighbor interaction (NNN) is included in a tight-binding calculation of the electronic spectrum and conductivity of doped graphene. As a result, we observe a wide variation of the conductivity behavior, since the Fermi…
The Minimum Path Cover (MPC) problem consists of finding a minimum-cardinality set of node-disjoint paths that cover all nodes in a given graph. We explore a variant of the MPC problem on acyclic digraphs (DAGs) where, given a subset of…
Graph comparison deals with identifying similarities and dissimilarities between graphs. A major obstacle is the unknown alignment of graphs, as well as the lack of accurate and inexpensive comparison metrics. In this work we introduce the…
A network is said to have the properties of a small world if a suitably defined average distance between any two nodes is proportional to the logarithm of the number of nodes, $N$. In this paper, we present a novel derivation of the…
Networks of interacting nodes connected by edges arise in almost every branch of scientific enquiry. The connectivity structure of the network can force the existence of invariant subspaces, which would not arise in generic dynamical…