Computing the eigenvalues and eigenvectors of a fuzzy matrix

Computation of fuzzy eigenvalues and fuzzy eigenvectors of a fuzzy matrix is a challenging problem. Determining the maximal and minimal symmetric solution can help to find the eigenvalues. So, we try to compute these eigenvalues by determining the maximal and minimal symmetric solution of the fully fuzzy linear system $widetilde{A}widetilde{X}= widetilde{lambda} widetilde{X}.

Physical states in the canonical tensor model from the perspective of random tensor networks

Tensor models, generalization of matrix models, are studied aiming for quantum gravity in dimensions larger than two. Among them, the canonical tensor model is formulated as a totally constrained system with first-class constraints, the algebra of which resembles the Dirac algebra of general relativity. When quantized, the physical states are defined to be vanished by the quantized constraints. In explicit representations, the constraint equations are a set of partial differential equations for the physical wave-functions, which do not seem straightforward to be solved due to their non-linear character. In this paper, after providing some explicit solutions for $N=2,3$, we show that certain scale-free integration of partition functions of statistical systems on random networks (or random tensor networks more generally) provides a series of solutions for general $N$. Then, by generalizing this form, we also obtain various solutions for general $N$. Moreover, we show that the solutions for the cases with a cosmological constant can be obtained from those with no cosmological constant for increased $N$. This would imply the interesting possibility that a cosmological constant can always be absorbed into the dynamics and is not an input parameter in the canonical tensor model. We also observe the possibility of symmetry enhancement in $N=3$, and comment on an extension of Airy function related to the solutions.Comment: 41 pages, 1 figure; typos correcte

Searching for network modules

When analyzing complex networks a key target is to uncover their modular structure, which means searching for a family of modules, namely node subsets spanning each a subnetwork more densely connected than the average. This work proposes a novel type of objective function for graph clustering, in the form of a multilinear polynomial whose coefficients are determined by network topology. It may be thought of as a potential function, to be maximized, taking its values on fuzzy clusterings or families of fuzzy subsets of nodes over which every node distributes a unit membership. When suitably parametrized, this potential is shown to attain its maximum when every node concentrates its all unit membership on some module. The output thus is a partition, while the original discrete optimization problem is turned into a continuous version allowing to conceive alternative search strategies. The instance of the problem being a pseudo-Boolean function assigning real-valued cluster scores to node subsets, modularity maximization is employed to exemplify a so-called quadratic form, in that the scores of singletons and pairs also fully determine the scores of larger clusters, while the resulting multilinear polynomial potential function has degree 2. After considering further quadratic instances, different from modularity and obtained by interpreting network topology in alternative manners, a greedy local-search strategy for the continuous framework is analytically compared with an existing greedy agglomerative procedure for the discrete case. Overlapping is finally discussed in terms of multiple runs, i.e. several local searches with different initializations.Comment: 10 page

Classical and Quantum Solitons in the Symmetric Space Sine-Gordon Theories

We construct the soliton solutions in the symmetric space sine-Gordon theories. The latter are a series of integrable field theories in 1+1-dimensions which are associated to a symmetric space F/G, and are related via the Pohlmeyer reduction to theories of strings moving on symmetric spaces. We show that the solitons are kinks that carry an internal moduli space that can be identified with a particular co-adjoint orbit of the unbroken subgroup H of G. Classically the solitons come in a continuous spectrum which encompasses the perturbative fluctuations of the theory as the kink charge becomes small. We show that the solitons can be quantized by allowing the collective coordinates to be time-dependent to yield a form of quantum mechanics on the co-adjoint orbit. The quantum states correspond to symmetric tensor representations of the symmetry group H and have the interpretation of a fuzzy geometric version of the co-adjoint orbit. The quantized finite tower of soliton states includes the perturbative modes at the base.Comment: 53 pages, additional comments and small errors corrected, final journal versio

An Ordinal View of Independence with Application to Plausible Reasoning

An ordinal view of independence is studied in the framework of possibility theory. We investigate three possible definitions of dependence, of increasing strength. One of them is the counterpart to the multiplication law in probability theory, and the two others are based on the notion of conditional possibility. These two have enough expressive power to support the whole possibility theory, and a complete axiomatization is provided for the strongest one. Moreover we show that weak independence is well-suited to the problems of belief change and plausible reasoning, especially to address the problem of blocking of property inheritance in exception-tolerant taxonomic reasoning.Comment: Appears in Proceedings of the Tenth Conference on Uncertainty in Artificial Intelligence (UAI1994