Goal: Structural brain graphs are conventionally limited to defining nodes as gray matter regions from an atlas, with edges reflecting the density of axonal projections between pairs of nodes. Here we explicitly model the entire set of voxels within a brai ...
Correlation Clustering is a fundamental and widely-studied problem in unsupervised learning and data mining. The input is a graph and the goal is to construct a clustering minimizing the number of inter-cluster edges plus the number of missing intra-cluste ...
Recent work analyzing the social impact of technology in processes of globalization signals a shared Western voice in sustainability related discourses dating back twenty years (Fernández Fernández and Savcisens. However, many scholars propose the idea tha ...
Centre pour la Communication Scientifique Directe (CCSD)2024
We prove that unary Sherali-Adams requires proofs of size n(Omega(d)) to rule out the existence of an n(Theta(1))-clique in Erdos-Renyi random graphs whose maximum clique is of size d
We compute three-term semiclassical asymptotic expansions of counting functions and Riesz-means of the eigenvalues of the Laplacian on spheres and hemispheres, for both Dirichlet and Neumann boundary conditions. Specifically for Riesz-means we prove upper ...
The numerical solution of singular eigenvalue problems is complicated by the fact that small perturbations of the coefficients may have an arbitrarily bad effect on eigenvalue accuracy. However, it has been known for a long time that such perturbations are ...
Some implications of absolute geometries in the description of complex systems dynamics, at various scale resolutions are highlighted. In such context, by means of an analytic geometry of 2 x 2 matrices, a generalization of the standard velocities space in ...
The choice of the shape parameter highly effects the behaviour of radial basis function (RBF) approximations, as it needs to be selected to balance between the ill-conditioning of the interpolation matrix and high accuracy. In this paper, we demonstrate ho ...
We confirm, for the primes up to 3000, the conjecture of Bourgain-Gamburd-Sarnak and Baragar on strong approximation for the Markoff surface modulo primes. For primes congruent to 3 modulo 4, we find data suggesting that some natural graphs constructed fro ...
