Related papers: Exact solution of the isotropic majority-vote mode…
Building on recent work by Medvedev (2014) we establish new connections between a basic consensus model, called the voting model, and the theory of graph limits. We show that in the voting model if consensus is attained in the continuum…
The NASA Magnetospheric Multiscale mission has made in situ diffusion region and kinetic-scale resolution measurements of asymmetric magnetic reconnection for the first time, in the Earth's magnetopause. The principal theoretical tool…
In this paper, we focus on deriving some sufficient conditions for the existence of solutions to non-monotone Variational Inequalities (VIs) based on inverse mapping theory. We have obtained several widely applicable sufficient conditions…
We consider non-i.i.d. random holomorphic dynamical systems whose choice of maps depends on Markovian rules. We show that generically, such a system is mean stable or chaotic with full Julia set. If a system is mean stable, then the…
We study through Monte Carlo simulations and finite-size scaling analysis the nonequilibrium phase transitions of the majority-vote model taking place on spatially embedded networks. These structures are built from an underlying regular…
An instance of a strongly stable matching problem (SSMP) is an undirected bipartite graph $G=(A \cup B, E)$, with an adjacency list of each vertex being a linearly ordered list of ties, which are subsets of vertices equally good for a given…
We show that the quasi-stationary states observed in the $N$-particle dynamics of the Hamiltonian Mean-Field (HMF) model are nothing but Vlasov stable homogeneous (zero magnetization) states. There is an infinity of Vlasov stable…
We consider complete graphs with edge weights and/or node weights taking values in some set. In the first part of this paper, we show that a large number of graphs are completely determined, up to isomorphism, by the distribution of their…
A concentration graph associated with a random vector is an undirected graph where each vertex corresponds to one random variable in the vector. The absence of an edge between any pair of vertices (or variables) is equivalent to full…
Majority voting is one of the few black-box interventions that can improve a fixed stochastic predictor: repeated access can be cheaper than changing a high-capability model. Classical fixed-competence theory makes this intervention look…
The cutoff phenomenon describes a sharp transition in the convergence of a Markov chain to equilibrium. In recent work, the authors established cutoff and its location for the stochastic Ising model on the $d$-dimensional torus $(Z/nZ)^d$…
The complete point symmetry group of the barotropic vorticity equation on the sphere is determined. The method we use relies on the invariance of megaideals of the maximal Lie invariance algebra of a system of differential equations under…
Approximate master equations are derived for the two-state $q$-voter model with independence on signed random graphs, with negative and positive weights of links corresponding to antagonistic and reinforcing interactions, respectively.…
We introduce a general class of mean-field-like spin systems with random couplings that comprises both the Ising model on inhomogeneous dense random graphs and the randomly diluted Hopfield model. We are interested in quantitative estimates…
By considering three different spin models belonging to the generalized voter class for ordering dynamics in two dimensions [I. Dornic, \textit{et al.} Phys. Rev. Lett. \textbf{87}, 045701 (2001)], we show that they behave differently from…
We consider matrix-valued stochastic processes known as isotropic Brownian motions, and show that these can be solved exactly over complex fields. While these processes appear in a variety of questions in mathematical physics, our main…
Out-of-equilibrium behavior is explored in the one-dimensional anisotropic $XY$ model. Initially preparing the system in the isotropic $XX$ model with a linearly varying magnetic field to create a domain-wall magnetization profile, dynamics…
Existence of a perfect matching in a random bipartite digraph with bipartition $(V_1, V_2)$, $|V_i|=n$, is studied. The graph is generated in two rounds of random selections of a potential matching partner such that the average number of…
One-flip stable configurations of an Ising-model on a random graph with fluctuating connectivity are examined. In order to perform the quenched average of the number of stable configurations we introduce a global order-parameter function…
In this paper we study several monotonicity axioms in approval-based multi-winner voting rules. We consider monotonicity with respect to the support received by the winners and also monotonicity in the size of the committee. Monotonicity…