Related papers: A Cyclic Representation of Discrete Coordination P…

In this article we discuss the question of presence of Hamiltonian cycle in the un-directed power graph of a group. In the process we develop weighted Hamiltonian cycle concept and prove a few general results regarding the Hamiltonian…

We address discrete-time consensus on the Euclidean unit sphere. For this purpose we consider a distributed algorithm comprising the iterative projection of a conical combination of neighboring states. Neighborhoods are represented by a…

We have obtained the exact asymptotics of the determinant $\det_{1\leq r,s\leq L}[\binom{r+s-2}{r-1}+\exp(i\theta)\delta_{r,s}]$. Inverse symbolic computing methods were used to obtain exact analytical expressions for all terms up to…

The computation of electrical flows is a crucial primitive for many recently proposed optimization algorithms on weighted networks. While typically implemented as a centralized subroutine, the ability to perform this task in a fully…

Consider a symplectic circle action on a closed symplectic manifold with non-empty isolated fixed points. Associated to each fixed point, there are well-defined non-zero integers, called weights. We prove that the action is Hamiltonian if…

Let $n$ be sufficiently large and suppose that $G$ is a digraph on $n$ vertices where every vertex has in- and outdegree at least $n/2$. We show that $G$ contains every orientation of a Hamilton cycle except, possibly, the antidirected one.…

For a compact manifold, which has a part isometric to a cylinder of finite length, we consider an adiabatic limit procedure, in which the length of the cylinder tends to infinity. We study the asymptotic of the spectrum of Hodge-Laplacian…

We analyze discrete optimal control problems and their connection with back propagation and deep learning. We consider in particular the symmetric representation of the discrete rigid body equations developed via optimal control analysis…

This work presents a unified framework for the unsupervised prediction of physically plausible interpolations between two 3D articulated shapes and the automatic estimation of dense correspondence between them. Interpolation is modelled as…

It is well known that the Lagrangian and Hamiltonian descriptions of field theories are equivalent at the discrete time level when variational integrators are used. Besides the symplectic Hamiltonian structure, many physical systems exhibit…

The wisdom of crowds is an umbrella term for phenomena suggesting that the collective judgment or decision of a large group can be more accurate than the individual judgments or decisions of the group members. A well-known example…

The hierarchical Dirichlet process is a discrete random measure used as a prior in Bayesian nonparametrics and motivated by the study of groups of clustered data. We study the asymptotic behavior of the power sum symmetric polynomials for…

Recently a model for the interplay between homophily-based appraisal dynamics and influence-based opinion dynamics has been proposed. The model explores for the first time how the opinions of a group of agents on a certain number of…

Decoupling the interactions in a spin network governed by a pair-interaction Hamiltonian is a well-studied problem. Combinatorial schemes for decoupling and for manipulating the couplings of Hamiltonians have been developed which use…

A fundamental challenge in opinion dynamics research is the scarcity of real-world longitudinal opinion data, which complicates the validation of theoretical models. To address this, we propose a novel simulation framework using large…

Understanding how group interactions influence opinion dynamics is fundamental to the study of collective behavior. In this work, we propose and study a model of opinion dynamics on $d$-uniform hypergraphs, where individuals interact…

Pull voting is a random process in which vertices of a connected graph have initial opinions chosen from a set of $k$ distinct opinions, and at each step a random vertex alters its opinion to that of a randomly chosen neighbour. If the…

We introduce and study a class of discrete particle ensembles that naturally arise in connection with classical random matrix ensembles, log-gases and Jack polynomials. Under technical assumptions on a general analytic potential we prove…

We consider Hamilton cycles in the random digraph $D_{n,m}$ where the orientation of edges follows a pattern other than the trivial orientation in which the edges are oriented in the same direction as we traverse the cycle. We show that if…

We study the discretization of (almost-)Dirac structures using the notion of retraction and discretization maps on manifolds. Additionally, we apply the proposed discretization techniques to obtain numerical integrators for port-Hamiltonian…