Abstract In this work we study statistical properties of graph-based clustering algorithms that rely on the optimization balanced graph cuts, main example being Cheeger cuts. We consider proximity graphs built from data sampled an underlying distribution supported a generic smooth compact manifold $${\mathcal {M}}$$ M </...

The convergence behavior of an iterative decoder for low-density parity-check codes is investigated. The influence of finite length codes containing cycles in the factor graph is considered and different types of decoding errors are identified and classified.

Using the binary Hop eld network as a basis, a new model has been developed that has high storage capacity, deterministic non-Hamming distance dynamics, and rapid convergence. It's key properties have been expressed and analysed using graph theory.

We use graph convergence of set valued maps to show the existence of an equilibrium for an abstract economy without assuming the lower semi continuity of the constraint maps.

The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...

A feedback neural network for solving graph coloring problem is presented. The circuit has an associated transcendental energy function that ensures fast convergence to the exact solution. Hardware and PSPICE simulation results on random and benchmark problems have been presented. Test results are compared with existing techniques for graph coloring to show that the proposed neural network mode...

Testable weighted graph parameters and equivalent notions of testability – proved in [4] for simple graphs – are generalized for vertexand edge-weighted graphs with no dominant vertex-weights. We prove that certain balanced minimum multiway cut densities are testable. Using this fact, quadratic programming techniques are applied to approximate some of these quantities. The problem is related to...

In this article, we propose a general graph optimization-based framework for localization, which can accommodate different types of measurements with varying measurement time intervals. Special emphasis will be on range-based localization. Range and trajectory smoothness constraints are constructed in position graph, then the robot over sliding window is estimated by graph-based optimization al...

We investigate various features of a quite new family of graphs, introduced as a possible example of vertex-transitive graph not roughly isometric with a Cayley graph of some finitely generated group. We exhibit a natural compactification and study a large class of random walks, proving theorems concerning almost sure convergence to the boundary, a strong law of large numbers and a central limi...