相关论文: A Cyclic Representation of Discrete Coordination P…

We study the powers of Hamiltonian cycles in randomly augmented Dirac graphs, that is, $n$-vertex graphs $G$ with minimum degree at least $(1/2+\varepsilon)n$ to which some random edges are added. For any Dirac graph and every integer…

We examine a random model consisting of objects with positive weights and evolving in discrete time steps, which generalizes certain random graph models. We prove almost sure convergence for the weight distribution and show scale-free…

In multi-terminal networks, feedback increases the capacity region and helps communication devices to coordinate. In this article, we deepen the relationship between coordination and feedback by considering a point-to-point scenario with an…

The understanding of how users in a network update their opinions based on their neighbours opinions has attracted a great deal of interest in the field of network science, and a growing body of literature recognises the significance of…

Inverse weighting with an estimated propensity score is widely used by estimation methods in causal inference to adjust for confounding bias. However, directly inverting propensity score estimates can lead to instability, bias, and…

In this paper we relate the study of actions of discrete groups over connected manifolds to that of their orbit spaces seen as differentiable stacks. We show that the orbit stack of a discrete dynamical system on a simply connected manifold…

For every compact almost complex manifold (M,J) equipped with a J-preserving circle action with isolated fixed points, a simple algebraic identity involving the first Chern class is derived. This enables us to construct an algorithm to…

Adaptive rational interpolation has been designed in the context of image processing as a new nonlinear technique that avoids the Gibbs phenomenon when we approximate a discontinuous function. In this work, we present a generalization to…

We propose a general modeling and algorithmic framework for discrete structure recovery that can be applied to a wide range of problems. Under this framework, we are able to study the recovery of clustering labels, ranks of players, signs…

A Hamiltonian cycle of a graph is a closed path that visits every vertex once and only once. It serves as a model of a compact polymer on a lattice. I study the number of Hamiltonian cycles, or equivalently the entropy of a compact polymer,…

We study a version of the functional Hodrick-Prescott filter where the associated operator is not necessarily compact, but merely closed and densely defined with closed range. We show that the associated optimal smoothing operator preserves…

Motivated by attitude control and attitude estimation problems for a rigid body, computational methods are proposed to propagate uncertainties in the angular velocity and the attitude. The nonlinear attitude flow is determined by…

We study the problem of distributed cooperative learning, where a group of agents seeks to agree on a set of hypotheses that best describes a sequence of private observations. In the scenario where the set of hypotheses is large, we propose…

DeGroot-style opinion formation presumes a continuous interaction among agents of a social network. Hence, it cannot handle agents external to the social network that interact only temporarily with the permanent ones. Many real-world…

We introduce a dynamic model for complexity control (CC) between systems, represented by time series characterized by different temporal complexity measures, as indicated by their respective inverse power law (IPL) indices. Given the…

A discrete model describing defects in crystal lattices and having the standard linear anisotropic elasticity as its continuum limit is proposed. The main ingredients entering the model are the elastic stiffness constants of the material…

We present a simple formula for the Hamiltonian in terms of the actions for spherically symmetric, scale-free potentials. The Hamiltonian is a power-law or logarithmic function of a linear combination of the actions. Our expression reduces…

We consider nonparametric invariant density and drift estimation for a class of multidimensional degenerate resp. hypoelliptic diffusion processes, so-called stochastic damping Hamiltonian systems or kinetic diffusions, under anisotropic…

This paper addresses the problem of differentially private distributed optimization under limited communication, where each agent aims to keep their cost function private while minimizing the sum of all agents' cost functions. In response,…

We describe a pipeline approach to decoding the surface code using minimum weight perfect matching, including taking into account correlations between detection events. An independent no-communication parallelizable processing stage…