Searched for: subject%3A%22graph%22
(1 - 19 of 19)
document
Van Mieghem, P.F.A. (author), Jokic, I. (author)
Except for the empty graph, we show that the orthogonal matrix X of the adjacency matrix A determines that adjacency matrix completely, but not always uniquely. The proof relies on interesting properties of the Hadamard product Ξ = X ◦ X. As a consequence of the theory, we show that irregular co-eigenvector graphs exist only if the number of...
journal article 2024
document
Van Mieghem, P.F.A. (author)
Although eigenvectors belong to the core of linear algebra, relatively few closed-form expressions exist, which we bundle and discuss here. A particular goal is their interpretation for graph-related matrices, such as the adjacency matrix of an undirected, possibly weighted graph.
journal article 2024
document
Jokic, I. (author), Van Mieghem, P.F.A. (author)
We propose a linear clustering process on a network consisting of two opposite forces: attraction and repulsion between adjacent nodes. Each node is mapped to a position on a one-dimensional line. The attraction and repulsion forces move the nodal position on the line, depending on how similar or different the neighbourhoods of two adjacent...
journal article 2023
document
Devriendt, Karel (author), Van Mieghem, P.F.A. (author)
Graphs are a central object of study in various scientific fields, such as discrete mathematics, theoretical computer science and network science. These graphs are typically studied using combinatorial, algebraic or probabilistic methods, each of which highlights the properties of graphs in a uniqueway. Here, we discuss a novel approach to study...
review 2019
document
Douw, Linda (author), Dellen, van, Edwin (author), Gouw, Alida A. (author), Griffa, Alessandra (author), de Haan, Willem (author), van den Heuvel, Martijn (author), Hillebrand, Arjan (author), Van Mieghem, P.F.A. (author), Nissen, Ida A. (author)
Clinical network neuroscience, the study of brain network topology in neurological and psychiatric diseases, has become a mainstay field within clinical neuroscience. Being a multidisciplinary group of clinical network neuroscience experts based in The Netherlands, we often discuss the current state of the art and possible avenues for future...
review 2019
document
Devriendt, K.L.T. (author), Van Mieghem, P.F.A. (author)
The cut-set ∂V in a graph is defined as the set of all links between a set of nodes V and all other nodes in that graph. Finding bounds for the size of a cut-set |∂V| is an important problem, and is related to mixing times, connectedness and spreading processes on networks. A standard way to bound the number of links in a cut-set |∂V| relies...
journal article 2019
document
Wang, X. (author), Dubbeldam, J.L.A. (author), Van Mieghem, P.F.A. (author)
Kemeny's constant and its relation to the effective graph resistance has been established for regular graphs by Palacios et al. [1]. Based on the Moore–Penrose pseudo-inverse of the Laplacian matrix, we derive a new closed-form formula and deduce upper and lower bounds for the Kemeny constant. Furthermore, we generalize the relation between...
journal article 2017
document
Liu, D. (author), Trajanovski, S. (author), Van Mieghem, P. (author)
This paper presents a new and efficient algorithm, ILIGRA, for inverse line graph construction. Given a line graph H, ILIGRA constructs its root graph G with the time complexity being linear in the number of nodes in H. If ILIGRA does not know whether the given graph H is a line graph, it firstly assumes that H is a line graph and starts its...
journal article 2014
document
Stam, C.J. (author), Tewarie, P. (author), Van Dellen, E. (author), Van Straaten, E.C.W. (author), Hillebrand, A. (author), Van Mieghem, P. (author)
In recent years there has been a shift in focus from the study of local, mostly task-related activation to the exploration of the organization and functioning of large-scale structural and functional complex brain networks. Progress in the interdisciplinary field of modern network science has introduced many new concepts, analytical tools and...
journal article 2014
document
Trajanovski, S. (author), Kuipers, F.A. (author), Martín-Hernández, J. (author), Van Mieghem, P. (author)
Modularity is a quantitative measure for characterizing the existence of a community structure in a network. A network's modularity depends on the chosen partitioning of the network into communities, which makes finding the specific partition that leads to the maximum modularity a hard problem. In this paper, we prove that deciding whether a...
journal article 2013
document
Liu, D. (author), Blenn, N. (author), Van Mieghem, P.F.A. (author)
ur society contains all types of organizations, such as companies, research groups and hobby clubs. Affliation networks, as a large and important portion of social networks, consist of individuals and their affiation relations: Two individuals are connected by a link if they belong to the same organization(s). Affliation networks naturally...
journal article 2012
document
Blenn, N. (author), Doerr, C. (author), Shadravan, N. (author), Van Mieghem, P. (author)
After the early land rush and fast exponential growth of online social networking platforms, concerns about how data placed in online social networks may be exploited and abused have begun to appear among mainstream users. Social networking sites have responded to these new public sentiments by introducing privacy filters to their site, allowing...
conference paper 2012
document
Li, C. (author), Wang, H. (author), De Haan, W. (author), Stam, C.J. (author), Van Mieghem, P.F.A. (author)
An increasing number of network metrics have been applied in network analysis. If metric relations were known better, we could more effectively characterize networks by a small set of metrics to discover the association between network properties/metrics and network functioning. In this paper, we investigate the linear correlation coefficients...
journal article 2011
document
Stam, C.J. (author), Hillebrand, A. (author), Wang, H. (author), Van Mieghem, P. (author)
A network of 32 or 64 connected neural masses, each representing a large population of interacting excitatory and inhibitory neurons and generating an electroencephalography/magnetoencephalography like output signal, was used to demonstrate how an interaction between dynamics and connectivity might explain the emergence of complex network...
journal article 2010
document
Wang, H. (author), Kooij, R.E. (author), Van Mieghem, P. (author)
We propose a class of graphs G?D(n1, n2, ..., nD+1), containing of a chain of D+1 cliques Kn1 , Kn2 , ..., KnD+1, where neighboring cliques are fully-interconnected. The class of graphs has diameter D and size N = ? 1?i?D+1ni. We prove that this class of graphs can achieve the maximal number of links, the minimum average hopcount, and more...
journal article 2010
document
Wang, H. (author), Martin Hernandez, J. (author), Van Mieghem, P. (author)
journal article 2008
document
Van Mieghem, P. (author)
conference paper 2007
document
Martin Hernandez, J. (author), Kleiberg, T. (author), Wang, H. (author), Van Mieghem, P. (author)
conference paper 2007
document
Van Mieghem, P. (author)
conference paper 2005
Searched for: subject%3A%22graph%22
(1 - 19 of 19)