Zobrazeno 1 - 10
of 2 496
pro vyhledávání: '"68r10"'
Publikováno v:
Complex Networks XIV (CompleNet 2023). Springer Proceedings in Complexity. Springer, Cham
We investigate searching efficiency of different kinds of random walk on complex networks which rely on local information and one-step memory. For the studied navigation strategies we obtained theoretical and numerical values for the graph mean first
Externí odkaz:
http://arxiv.org/abs/2411.08608
Autor:
Paul, Pravakar, Saikia, Manjil P.
In this paper, we give inductive sum formulas to calculate the number of diagonally symmetric, and diagonally \& anti-diagonally symmetric domino tilings of Aztec Diamonds. As a byproduct, we also find such a formula for the unrestricted case as well
Externí odkaz:
http://arxiv.org/abs/2410.23324
Graph Convolutional Networks (GCNs) have become a pivotal method in machine learning for modeling functions over graphs. Despite their widespread success across various applications, their statistical properties (e.g. consistency, convergence rates)
Externí odkaz:
http://arxiv.org/abs/2410.20068
Autor:
Murray, Ryan, Pickarski, Adam
This work considers large-data asymptotics for t-distributed stochastic neighbor embedding (tSNE), a widely-used non-linear dimension reduction algorithm. We identify an appropriate continuum limit of the tSNE objective function, which can be viewed
Externí odkaz:
http://arxiv.org/abs/2410.13063
We study algorithms for drawing planar graphs and 1-planar graphs using cubic B\'ezier curves with bounded curvature. We show that any n-vertex 1-planar graph has a 1-planar RAC drawing using a single cubic B\'ezier curve per edge, and this drawing c
Externí odkaz:
http://arxiv.org/abs/2410.12083
Let $S$ be a point set in the plane, $\mathcal{P}(S)$ and $\mathcal{C}(S)$ sets of all plane spanning paths and caterpillars on $S$. We study reconfiguration operations on $\mathcal{P}(S)$ and $\mathcal{C}(S)$. In particular, we prove that all of the
Externí odkaz:
http://arxiv.org/abs/2410.07419
We explore a scaled spectral preconditioner for the efficient solution of sequences of symmetric and positive-definite linear systems. We design the scaled preconditioner not only as an approximation of the inverse of the linear system but also with
Externí odkaz:
http://arxiv.org/abs/2410.02204
Autor:
de Verdière, Éric Colin, Hliněný, Petr
The basic crossing number problem is to determine the minimum number of crossings in a topological drawing of an input graph in the plane. In this paper, we develop fixed-parameter tractable (FPT) algorithms for various generalized crossing number pr
Externí odkaz:
http://arxiv.org/abs/2410.00206
We present a rigorous convergence analysis of a new method for density-based topology optimization: Sigmoidal Mirror descent with a Projected Latent variable. SiMPL provides point-wise bound preserving design updates and faster convergence than other
Externí odkaz:
http://arxiv.org/abs/2409.19341
Nambu-determinant brackets on $R^d\ni x=(x^1,...,x^d)$, $\{f,g\}_d(x)=\rho(x) \det(\partial(f,g,a_1,...,a_{d-2})/\partial(x^1,...,x^d))$, with $a_i\in C^\infty(R^d)$ and $\rho\partial_x\in\mathfrak{X}^d(R^d)$, are a class of Poisson structures with (
Externí odkaz:
http://arxiv.org/abs/2409.18875