相关论文: The simplest nearest-neighbor spin system on regul…
We study the statistical properties of the physical action $S$ for random graphs, by treating the number of neighbors at each vertex of the graph (degree), as a scalar field. For each configuration (run) of the graph we calculate the…
Generalizing the well-known relations on characteristic functions on a plane to the case of a one-dimensional regular surface (curve) with compact support, we establish implicit equations for these functions. Introducing an approximation,…
In this work we study the dynamics of systems composed of numerous interacting elements interconnected through a random weighted directed graph, such as models of random neural networks. We develop an original theoretical approach based on…
In this paper, we give approximation algorithms for the \textsc{Minimum Dominating Set (MDS)} problem on \emph{string} graphs and its subclasses. A \emph{path} is a simple curve made up of alternating horizontal and vertical line segments.…
A nearest-neighbor-interaction Ising spin glass, in the presence of an external magnetic field, is studied on different hierarchical lattices that approach the cubic lattice. The magnetic field is considered as uniform, or random (following…
The possible functional forms of the effective conductivity sigma_{eff} of the randomly inhomogeneous two-phase system at arbitrary values of concentrations are discussed. A new functional equation, generalizing the duality relation, is…
A disordered spin model suitable for studying inverse freezing in fragile glass-forming systems is introduced. The model is a microscopic realization of the ``random-first order'' scenario in which the glass transition can be either…
Given two sets $A$ and $B$ of integers, we consider the problem of finding a set $S \subseteq A$ of the smallest possible cardinality such the greatest common divisor of the elements of $S \cup B$ equals that of those of $A \cup B$. The…
We develop a second order formalism for spin 1/2 fermions based on the projection over Poincar\'{e} invariant subspaces in the $(1/2,0)\oplus(0,1/2)$ representation of the homogeneous Lorentz group. Using $U(1)_{em}$ gauge principle we…
This paper gathers together different conditions which are all equivalent to geometric ergodicity of time-homogeneous Markov chains on general state spaces. A total of 34 different conditions are presented (27 for general chains plus 7 just…
The state space for the $N$-spin mean field (SK) spin glass--nominally an $N$-cube--is embedded in a low dimensional continuous space in such a way that metastable and stable phases can easily be discerned, a concept of nearness of…
We discuss conditions for unique ergodicity of a collective random walk on a continuous circle. Individual particles in this collective motion perform independent (and different in general) random walks conditioned by the assumption that…
We study the problems of finding a minimum cycle basis (a minimum weight set of cycles that form a basis for the cycle space) and a minimum homology basis (a minimum weight set of cycles that generates the $1$-dimensional…
We analyze the properties of degree-preserving Markov chains based on elementary edge switchings in undirected and directed graphs. We give exact yet simple formulas for the mobility of a graph (the number of possible moves) in terms of its…
I consider a spin chain with nearest-neighbor and next nearest-neighbor interactions. I show that the Hamiltonian obtained by specifying the desired combination of symmetry blocks is a fast scrambler. This is a smaller model than the…
We provide a comprehensive study of a natural geometric optimization problem motivated by questions in the context of satellite communication and astrophysics. In the problem Minimum Scan Cover with Angular Costs (MSC), we are given a graph…
We consider the long time behavior of heterogeneously interacting diffusive particle systems and their large population limit. The interaction is of mean field type with weights characterized by an underlying graphon. The limit is given by…
Consider a graph with n nodes and m edges, independent edge weights and lengths, and arbitrary distance demands for node pairs. The spanner problem asks for a minimum-weight subgraph that satisfies these demands via sufficiently short paths…
The critical behavior of a family of fully connected mean-field models with quenched disorder, the $M-p$ Ising spin glass, is analyzed, displaying a crossover between a continuous and a random first order phase transition as a control…
In this note we prove convergence of Green functions with Neumann boundary conditions for the random walk to their continuous counterparts. Also a few Beurling type hitting estimates are obtained for the random walk on discretizations of…