Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userOn the principal eigenvector of a graph
319
0
0.0
(
0
)
Authors
Yueheng Zhang
Ask ChatGPT about the research
No Arabic abstract
The principal ratio of a connected graph $G$, $gamma(G)$, is the ratio between the largest and smallest coordinates of the principal eigenvector of the adjacency matrix of $G$. Over all connected graphs on $n$ vertices, $gamma(G)$ ranges from $1$ to $n^{cn}$. Moreover, $gamma(G)=1$ if and only if $G$ is regular. This indicates that $gamma(G)$ can be viewed as an irregularity measure of $G$, as first suggested by Tait and Tobin (El. J. Lin. Alg. 2018). We are interested in how stable this measure is. In particular, we ask how $gamma$ changes when there is a small modification to a regular graph $G$. We show that this ratio is polynomially bounded if we remove an edge belonging to a cycle of bounded length in $G$, while the ratio can jump from $1$ to exponential if we join a pair of vertices at distance $2$. We study the connection between the spectral gap of a regular graph and the stability of its principal ratio. A naive bound shows that given a constant multiplicative spectral gap and bounded degree, the ratio remains polynomially bounded if we add or delete an edge. Using results from matrix perturbation theory, we show that given an additive spectral gap greater than $(2+epsilon)sqrt{n}$, the ratio stays bounded after adding or deleting an edge.
rate research
Read More
In this paper, we give some bounds for principal eigenvector and spectral radius of connected uniform hypergraphs in terms of vertex degrees, the diameter, and the number of vertices and edges.
Recently, eigenvector localization of complex network has seen a spurt in activities due to its versatile applicability in many different areas which includes networks centrality measure, spectral partitioning, development of approximation algorithms and disease spreading phenomenon. For a network, an eigenvector is said to be localized when most of its components are near to zero, with few taking very high values. Here, we develop three different randomized algorithms, which by using edge rewiring method, can evolve a random network having a delocalized principal eigenvector to a network having a highly localized principal eigenvector. We discuss drawbacks and advantages of these algorithms. Additionally, we show that the construction of such networks corresponding to the highly localized principal eigenvector is a non-convex optimization problem when the objective function is the inverse participation ratio.
Network science is increasingly being developed to get new insights about behavior and properties of complex systems represented in terms of nodes and interactions. One useful approach is investigating localization properties of eigenvectors having diverse applications including disease-spreading phenomena in underlying networks. In this work, we evolve an initial random network with an edge rewiring optimization technique considering the inverse participation ratio as a fitness function. The evolution process yields a network having localized principal eigenvector. We analyze various properties of the optimized networks and those obtained at the intermediate stage. Our investigations reveal the existence of few special structural features of such optimized networks including the presence of a set of edges which are necessary for the localization, and rewiring only one of them leads to a complete delocalization of the principal eigenvector. Our investigation reveals that PEV localization is not a consequence of a single network property, and preferably requires co-existence of various distinct structural as well as spectral features.
Complex networks or graphs provide a powerful framework to understand importance of individuals and their interactions in real-world complex systems. Several graph theoretical measures have been introduced to access importance of the individual in systems represented by networks. Particularly, eigenvector centrality (EC) measure has been very popular due to its ability in measuring importance of the nodes based on not only number of interactions they acquire but also particular structural positions they have in the networks. Furthermore, the presence of certain structural features, such as the existence of high degree nodes in a network is recognized to induce localization transition of the principal eigenvector (PEV) of the networks adjacency matrix. Localization of PEV has been shown to cause difficulties in assigning centrality weights to the nodes based on the EC. We revisit PEV localization and its relation with failure of EC problem, and by using simple model networks demonstrate that in addition to the localization of the PEV, the delocalization of PEV may also create difficulties for using EC as a measure to rank the nodes. Our investigation while providing fundamental insight to the relation between PEV localization and centrality of nodes in networks, suggests that for the networks having delocalized PEVs, it is better to use degree centrality measure to rank the nodes.
Let $S$ be a connected graph which contains an induced path of $n-1$ vertices, where $n$ is the order of $S.$ We consider a puzzle on $S$. A configuration of the puzzle is simply an $n$-dimensional column vector over ${0, 1}$ with coordinates of the vector indexed by the vertex set $S$. For each configuration $u$ with a coordinate $u_s=1$, there exists a move that sends $u$ to the new configuration which flips the entries of the coordinates adjacent to $s$ in $u.$ We completely determine if one configuration can move to another in a sequence of finite steps.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
