Related papers: Interactive Particle Systems on Hypergraphs, Drift…
Consider a system of interacting particles indexed by the nodes of a graph whose vertices are equipped with marks representing parameters of the model such as the environment or initial data. Each particle takes values in a countable state…
We consider the problem of fitting a parametric model to time-series data that are afflicted by correlated noise. The noise is represented by a sum of two stationary Gaussian processes: one that is uncorrelated in time, and another that has…
We study the existence and the exponential ergodicity of a general interacting particle system, whose components are driven by independent diffusion processes with values in an open subset of $\mathds{R}^d$, $d\geq 1$. The interaction…
We study an exactly solvable version of the famous random Boolean satisfiability problem, the so called random XOR-SAT problem. Rare events are shown to affect the combinatorial ``phase diagram'' leading to a coexistence of solvable and…
In this paper we continue the study of the derivation of different types of kinetic equations which arise from scaling limits of interacting particle systems. We began this study in \cite{NVW}. More precisely, we consider the derivation of…
Let F be a uniformly distributed random k-SAT formula with n variables and m clauses. We prove that the Walksat algorithm from Papadimitriou (FOCS 1991)/Schoning (FOCS 1999) finds a satisfying assignment of F in polynomial time w.h.p. if…
We introduce and analyze a class of interacting particle systems on the real line that combine features of the stochastic rat race and (deterministic) follow-the-leader models. The particle system evolves as a continuous-time pure jump…
We consider the NP-hard problem of finding a spanning tree with a maximum number of internal vertices. This problem is a generalization of the famous Hamiltonian Path problem. Our dynamic-programming algorithms for general and…
The goal of this paper is to describe the various kinetic equations which arise from scaling limits of interacting particle systems. We provide a formalism which allows us to determine the kinetic equation for a given interaction potential…
Open-source software (OSS) is a critical component of modern software systems, yet supply chain security remains challenging in practice due to unavailable or obfuscated source code. Consequently, security teams often rely on runtime…
We give new sublinear and parallel algorithms for the extensively studied problem of approximating n-variable r-CSPs (constraint satisfaction problems with constraints of arity r up to an additive error. The running time of our algorithms…
In a paper from 2006, Couder and Fort [1] describe a version of the famous double slit experiment performed with drops bouncing on a vibrated fluid surface, where interference in the particle statistics is found even though it is possible…
In this paper, we present a quantum algorithm for the dynamic programming approach for problems on directed acyclic graphs (DAGs). The running time of the algorithm is $O(\sqrt{\hat{n}m}\log \hat{n})$, and the running time of the best known…
We present a new algorithm for detecting transiting extrasolar planets in time-series photometry. The Quasiperiodic Automated Transit Search (QATS) algorithm relaxes the usual assumption of strictly periodic transits by permitting a…
A canonical feature of the constraint satisfaction problems in NP is approximation hardness, where in the worst case, finding sufficient-quality approximate solutions is exponentially hard for all known methods. Fundamentally, the lack of…
We study the Fleming-Viot particle process formed by N interacting continuous-time asymmetric random walks on the cycle graph, with uniform killing. We show that this model has a remarkable exact solvability, despite the fact that it is…
We study the geometric ergodicity and the long time behavior of the Random Batch Method for interacting particle systems, which exhibits superior numerical performance in recent large-scale scientific computing experiments. We show that for…
We propose an interacting particle system to model the evolution of a system of banks with mutual exposures. In this model, a bank defaults when its normalized asset value hits a lower threshold, and its default causes instantaneous losses…
We study a dynamical system motivated by our earlier work on the statistical physics of social balance on graphs that can be viewed as a generalization of annihilating walks along two directions: first, the interaction topology is a…
In this paper we consider three classes of interacting particle systems on $\mathbb Z$: independent random walks, the exclusion process, and the inclusion process. We allow particles to switch their jump rate (the rate identifies the type…