Results 1 to 10 of about 88,866 (231)
Universal circuit matrix for adjacency graphs of feedback functions
Discrete Mathematics, 1994 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
J. Zurawiecki
openaire +3 more sources
On the main eigenvalues of universal adjacency matrices and u-controllable graphs [PDF]
, 2015 A universal adjacency matrix U of a graph G is a linear combination of the 0–1 adjacency matrix A, the diagonal matrix of vertex degrees D, the identity matrix I and the matrix J each of whose entries is 1.
Farrugia, Alexander, Sciriha, Irene
core +2 more sources
The algebra of adjacency patterns: Rees matrix semigroups with reversion [PDF]
Fields of Logic and Computation, 2009 We establish a surprisingly close relationship between universal Horn classes of directed graphs and varieties generated by so-called adjacency semigroups which are Rees matrix semigroups over the trivial group with the unary operation of reversion.
D.M. Clark +18 more
core +3 more sources
Universal quantum computation by discontinuous quantum walk [PDF]
, 2010 Quantum walks are the quantum-mechanical analog of random walks, in which a quantum `walker' evolves between initial and final states by traversing the edges of a graph, either in discrete steps from node to node or via continuous evolution under the ...
A. M. Childs +6 more
core +2 more sources
Universality in Complex Networks: Random Matrix Analysis [PDF]
Physical review. E, Statistical, nonlinear, and soft matter physics, 2007 We apply random matrix theory to complex networks. We show that nearest neighbor spacing distribution of the eigenvalues of the adjacency matrices of various model networks, namely scale-free, small-world and random networks follow universal Gaussian ...
D. M. Cvetković +3 more
core +5 more sources
Social Network Analysis: A Novel Paradigm for Improving Community Detection
International Journal of Computational Intelligence SystemsSocial network analysis has become increasingly important across a wide range of fields, offering valuable insights into complex systems of interconnected entities. One of the fundamental challenges in this field is the community detection problem, which
Rodrigo Hernández +2 more
doaj +2 more sources
Universal State Transfer on Graphs [PDF]
, 2013 A continuous-time quantum walk on a graph $G$ is given by the unitary matrix $U(t) = \exp(-itA)$, where $A$ is the Hermitian adjacency matrix of $G$. We say $G$ has pretty good state transfer between vertices $a$ and $b$ if for any $\epsilon > 0$, there ...
Cameron, Stephen +5 more
core +3 more sources
Universally consistent vertex classification for latent positions graphs [PDF]
, 2013 In this work we show that, using the eigen-decomposition of the adjacency matrix, we can consistently estimate feature maps for latent position graphs with positive definite link function $\kappa$, provided that the latent positions are i.i.d.
Priebe, Carey E. +2 more
core +2 more sources
TechnologiesDigital twins (DTs) have seen widespread application across industries, enabling deep integration of cyber–physical systems. However, previous research has largely focused on domain-specific DTs and lacks a universal, cross-industry modeling framework ...
Xubin Wu +4 more
doaj +2 more sources
Universal Matrix Sparsifiers and Fast Deterministic Algorithms for Linear Algebra [PDF]
Information Technology Convergence and Services, 2023 Let $\mathbf S \in \mathbb R^{n \times n}$ satisfy $\|\mathbf 1-\mathbf S\|_2\le\epsilon n$, where $\mathbf 1$ is the all ones matrix and $\|\cdot\|_2$ is the spectral norm. It is well-known that there exists such an $\mathbf S$ with just $O(n/\epsilon^2)
Rajarshi Bhattacharjee +4 more
semanticscholar +1 more source