DOCSLIB.ORG

Analysing Degeneracies in Networks Spectra

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Analysing Degeneracies in Networks Spectra epl draft Analysing degeneracies in networks spectra Lo¨ıc Marrec1,2 and Sarika Jalan1,3 1 Complex Systems Lab, Discipline of Physics, Indian Institute of Technology Indore, Khandwa Road, Simrol, Indore 453552, India 2 Universit´eParis-Sud, 91405 Orsay Cedex, France 3 Centre for Biosciences and Biomedical Engineering, Indian Institute of Technology Indore, Khandwa Road, Simrol, Indore 453552, India PACS 89.75.-k – Complex systems PACS 02.10.Yn – Matrix theory Abstract – Many real-world networks exhibit a high degeneracy at few eigenvalues. We show that a simple transformation of the network’s adjacency matrix provides an understanding to the origins of occurrence of high multiplicities in the networks spectra. We find that the eigenvec- tors associated with the degenerate eigenvalues shed light on the structures contributing to the degeneracy. Since these degeneracies are rarely observed in model graphs, we present results for various cancer networks. This approach gives an opportunity to search for structures contributing to degeneracy which might have an important role in a network. The paper written by Leonhard Euler on the Seven which are particularly interesting for biological systems as Bridges of Konigsberg¨ marks a beginning of graph the- they shed light on fundamental process in evolution re- ory [1] by introducing a concept of graphs representing lated with gene duplication [15], hence an interest lies in complex systems. The work was restricted to small sys- investigating origins of other degenerate eigenvalues. We tem size. Revolution in computing power later provided will see in the following that two reasons emerge to explain an opportunity to analyse very large real-world systems degeneracy of every eigenvalue. In particular cases, one of in terms of networks. Further, analysis of graph spectra these reasons reveals existence of characteristic structures has contributed significantly in our understanding of struc- in networks. tural and dynamical properties of graphs [2, 3]. Among In this paper, we consider finite undirected graphs de- other things, it has been noted that a symmetric spec- fined by G = {V, E} with V the node set, and E the edge trum about the origin is related to a bipartite graph [4]. set such as | V |= N and | E |= m. A graph is completely Further, bulk portion of eigenvalues has been shown to determined by its adjacency matrix for which its element be modeled using random matrix theory [5], whereas ex- Aij is 1 when there is an edge from vertex i to vertex tremal eigenvalues have been shown to be modeled using j, and 0 otherwise. In the following, the rows i of every arXiv:1609.08355v2 [physics.soc-ph] 13 Apr 2017 the generalized eigenvalue statistics [6, 7]. Recent inves- adjacency matrix will be denoted by Ri. tigations have revealed that real-world networks exhibit properties which are very different from those of the cor- The eigenvalues are obtained by computing the roots responding model graphs [8–10]. One of these properties is of the characteristic polynomial of the adjacency matrix, χ (λ) = det(A − λI) = N (λ − λ ) and denoted by occurrence of degeneracy at 0, −1 and −2 eigenvalues [2]. A i=1 i λ λ λ Few papers have related 0 and −1 eigenvalues to stars and 1 ≤ 2 ≤ ... ≤ N . Since the adjacency matrix of an undirected graph is symmetricQ with 0 and 1 entries, the cliques respectively [11–13]. However, graphs in absence v v of stars and cliques can still show a degeneracy at 0 and eigenvalues are real. The associated eigenvectors 1, 2 v Av λ v i −1 eigenvalues, respectively. As a result, these reasons ,..., N satisfy the eigen-equation i = i i with = , , ..., N are not exhaustive and it turns out that origins of degen- 1 2 . eracy at these eigenvalues are more complex. For exam- A complete graph, denoted by K, is an undirected graph ple, the 0 degeneracy has been shown to be resulted from for which every pair of nodes is connected by a unique the complete and the partial duplications [14] of nodes edge. This type of graphs is especially interesting since their spectra exhibit a very high multiplicity at −1 eigen- p-1 Lo¨ıcMarrec1,2 Sarika Jalan1,3 value. Specifically, a complete graph of N nodes has N −1 degeneracies for −1 eigenvalue [2]. However, it is mislead- 2 4 ing to associate this special graph structure with −1 de- generacy. Let us take as example the 5 nodes complete 1 3 5 graph in which we have removed an edge. In the result- K S ing graph, two −1 eigenvalues are retained whereas the (a) (b) globally connected structure is destroyed, which indicates that the globally connected structure is not sufficient to Fig. 1: (Color online) (a) and (b) verify the condition (ii) and explain occurrence of −1 degeneracy. We will see in the (iii) in A + I, respectively. following that only one type of particular structure con- sisting of a complete graph and its variants contribute to −1 eigenvalue. (Figure 1) contribute to −1 eigenvalue with multiplicity We consider the matrix A + I, where I is the identity n − 1. matrix, and we make a change of variables in the char- Next, we emphasize on the condition (iii), which for ex- ample may correspond to R1 +R2 = R3 +R4 in the matrix acteristic polynomial such as χA+I (λ) = χA(µ). By this way, µ is an eigenvalue of A if and only if λ is an eigen- A + I. For this particular case, the condition (iii) is satis- value of A+I. We can also prove that they have the same fied if and only if a1,j +a2,j = a3,j +a4,j for j =1, 2, ..., N. multiplicity. Hence, it is possible to reduce the computa- On this basis, we can clarify that the condition (iii) im- tion of −1 eigenvalue of A to the 0 eigenvalue of A + I. plies for the node j such as j = 5, 6, ..., N. Whether the This is especially interesting since the origin and impli- node j is adjacent (respectively non-adjacent) to the both cations of occurrence of 0 degeneracy in networks spec- nodes labelled 1 and 2, it is also adjacent (respectively tra are well characterized [14,16]. Spectrum of a matrix non-adjacent) to the both nodes 3 and 4. In the case of size N and rank r contains 0 eigenvalue with multi- where the node j is either connected to 1 or 2, the condi- plicity N − r. Three conditions lead to the lowering of tion (iii) imposes that j is either connected to 3 or 4 (see the rank of a matrix; (i) if the network has an isolated Table 1). node (R =0 ··· 0 ······ 0), (ii) At least two rows are equal i Node 1 Node 2 Node 3 Node 4 (Ri = Rj ), (iii) Two or more rows together are equal to 1 0 1 0 some other rows ( i aiRi = j bj Rj , where ai and bi take integer value included 0). In the case of A + I, it is 1 0 0 1 j obvious that the conditionP (i) isP never met. We focus now Node 0 1 1 0 on the condition (ii). Let us consider a network of size N 0 1 0 1 1 1 1 1 for which two nodes labelled 1 and 2 verify R1 = R2 in the adjacency matrix added to the identity matrix. 0 0 0 0 Table 1: Node j, such as j = 5, 6, ..., N, is adjacent (respec- 1 a1,2 ··· a1,N tively non-adjacent) to node i, such as i = 1, 2, 3 and 4, if the a1,2 1 ··· a2,N corresponding entry equals to 1 (respectively 0). A + I = . (1) . .. Let us now have a closer look at constraints which nodes a1,N a2,N ··· 1 1, 2, 3 and 4 must obey. Since we have a = 1, a = a i,i i,j j,i The condition (ii) is verified for any pair of rows, say and by considering the previous constraints: st nd 1 and 2 , if and only if a1,2 = 1 and a1,i = a2,i for i =3, 4, ..., N 1+ a1,2 = a1,3 + a1,4 a +1= a + a So, the adjacency matrix A takes the following form : 1,2 2,3 2,4 (3) a + a =1+ a 1,3 2,3 3,4 a1,4 + a2,4 = a3,4 +1 0 1 ··· a1,N 1 0 ··· a1,N This set has more unknown variables than the number A = . (2) . .. of equations. The system is underdetermined and has in- a a ··· 0 finitely many solutions. As a result, it is difficult to define 1,N 1,N a typical structure which corresponds to the condition (iii). The nodes 1 and 2 are interlinked and connected to the Here we will limit ourselves to illustrate it with the graph same set of other nodes. The rank of A + I is N − 1, and (b) in Figure 1 for which the adjacency matrix A added hence we deduce that the spectrum associated to the A to the identity matrix satisfies R1 + R4 = R2 + R5. matrix contains exactly one −1 eigenvalue. It is trivial This relation is at the origin of −1 eigenvalue observed to generalize this proof to the case R1 = R2 = ... = Rn. in the spectrum of A. More generally, each linear combi- Hence, n nodes forming a complete graph K connected to nation of rows in A+I leads to exactly one −1 eigenvalue. a same set S of other different nodes and denoted as K ∗S The power of this approach is that it can be extended to p-2 Title where nLC is the number of linear combinations of rows in the network.
Load more

Recommended publications
  • Degenerate Eigenvalue Problem 32.1 Degenerate Perturbation
    Physics 342 Lecture 32 Degenerate Eigenvalue Problem Lecture 32 Physics 342 Quantum Mechanics I Wednesday, April 23rd, 2008 We have the matrix form of the first order perturbative result from last time. This carries over pretty directly to the Schr¨odingerequation, with only minimal replacement (the inner product and finite vector space change, but notationally, the results are identical). Because there are a variety of quantum mechanical systems with degenerate spectra (like the Hydrogen 2 eigenstates, each En has n associated eigenstates) and we want to be able to predict the energy shift associated with perturbations in these systems, we can copy our arguments for matrices to cover matrices with more than one eigenvector per eigenvalue. The punch line of that program is that we can use the non-degenerate perturbed energies, provided we start with the \correct" degenerate linear combinations. 32.1 Degenerate Perturbation N×N Going back to our symmetric matrix example, we have A IR , and 2 again, a set of eigenvectors and eigenvalues: A xi = λi xi. This time, suppose that the eigenvalue λi has a set of M associated eigenvectors { that is, suppose a set of eigenvectors yj satisfy: A yj = λi yj j = 1 M (32.1) −! 1 of 9 32.1. DEGENERATE PERTURBATION Lecture 32 (so this represents M separate equations) that are themselves orthonormal1. Clearly, any linear combination of these vectors is also an eigenvector: M M X X A βk yk = λi βk yk: (32.2) k=1 k=1 M PM Define the general combination of yi to be z βk yk, also an f gi=1 ≡ k=1 eigenvector of A with eigenvalue λi.
    [Show full text]
  • DEGENERACY CURVES, GAPS, and DIABOLICAL POINTS in the SPECTRA of NEUMANN PARALLELOGRAMS P Overfelt
    DEGENERACY CURVES, GAPS, AND DIABOLICAL POINTS IN THE SPECTRA OF NEUMANN PARALLELOGRAMS P Overfelt To cite this version: P Overfelt. DEGENERACY CURVES, GAPS, AND DIABOLICAL POINTS IN THE SPECTRA OF NEUMANN PARALLELOGRAMS. 2020. hal-03017250 HAL Id: hal-03017250 https://hal.archives-ouvertes.fr/hal-03017250 Preprint submitted on 20 Nov 2020 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. DEGENERACY CURVES, GAPS, AND DIABOLICAL POINTS IN THE SPECTRA OF NEUMANN PARALLELOGRAMS P. L. OVERFELT Abstract. In this paper we consider the problem of solving the Helmholtz equation over the space of all parallelograms subject to Neumann boundary conditions and determining the degeneracies occurring in their spectra upon changing the two parameters, angle and side ratio. This problem is solved numerically using the finite element method (FEM). Specifically for the lowest eleven normalized eigenvalue levels of the family of Neumann parallelograms, the intersection of two (or more) adjacent eigen- value level surfaces occurs in one of three ways: either as an isolated point associated with the special geometries, i.e., the rectangle, the square, or the rhombus, as part of a degeneracy curve which appears to contain an infinite number of points, or as a diabolical point in the Neumann parallelogram spec- trum.
    [Show full text]
  • A Singular One-Dimensional Bound State Problem and Its Degeneracies
    A Singular One-Dimensional Bound State Problem and its Degeneracies Fatih Erman1, Manuel Gadella2, Se¸cil Tunalı3, Haydar Uncu4 1 Department of Mathematics, Izmir˙ Institute of Technology, Urla, 35430, Izmir,˙ Turkey 2 Departamento de F´ısica Te´orica, At´omica y Optica´ and IMUVA. Universidad de Valladolid, Campus Miguel Delibes, Paseo Bel´en 7, 47011, Valladolid, Spain 3 Department of Mathematics, Istanbul˙ Bilgi University, Dolapdere Campus 34440 Beyo˘glu, Istanbul,˙ Turkey 4 Department of Physics, Adnan Menderes University, 09100, Aydın, Turkey E-mail: [email protected], [email protected], [email protected], [email protected] October 20, 2017 Abstract We give a brief exposition of the formulation of the bound state problem for the one-dimensional system of N attractive Dirac delta potentials, as an N N matrix eigenvalue problem (ΦA = ωA). The main aim of this paper is to illustrate that the non-degeneracy× theorem in one dimension breaks down for the equidistantly distributed Dirac delta potential, where the matrix Φ becomes a special form of the circulant matrix. We then give elementary proof that the ground state is always non-degenerate and the associated wave function may be chosen to be positive by using the Perron-Frobenius theorem. We also prove that removing a single center from the system of N delta centers shifts all the bound state energy levels upward as a simple consequence of the Cauchy interlacing theorem. Keywords. Point interactions, Dirac delta potentials, bound states. 1 Introduction Dirac delta potentials or point interactions, or sometimes called contact potentials are one of the exactly solvable classes of idealized potentials, and are used as a pedagogical tool to illustrate various physically important phenomena, where the de Broglie wavelength of the particle is much larger than the range of the interaction.
    [Show full text]
  • 11.-HYPERBOLA-THEORY.Pdf
    12. HYPERBOLA 1. INTRODUCTION A hyperbola is the locus of a point which moves in the plane in such a way that Z the ratio of its distance from a fixed point in the same plane to its distance X’ P from a fixed line is always constant which is always greater than unity. M The fixed point is called the focus, the fixed line is called the directrix. The constant ratio is generally denoted by e and is known as the eccentricity of the Directrix hyperbola. A hyperbola can also be defined as the locus of a point such that S (focus) the absolute value of the difference of the distances from the two fixed points Z’ (foci) is constant. If S is the focus, ZZ′ is the directrix and P is any point on the hyperbola as show in figure. Figure 12.1 SP Then by definition, we have = e (e > 1). PM Note: The general equation of a conic can be taken as ax22+ 2hxy + by + 2gx + 2fy += c 0 This equation represents a hyperbola if it is non-degenerate (i.e. eq. cannot be written into two linear factors) ahg ∆ ≠ 0, h2 > ab. Where ∆=hb f gfc MASTERJEE CONCEPTS 1. The general equation ax22+ 2hxy + by + 2gx + 2fy += c 0 can be written in matrix form as ahgx ah x x y + 2gx + 2fy += c 0 and xy1hb f y = 0 hb y gfc1 Degeneracy condition depends on the determinant of the 3x3 matrix and the type of conic depends on the determinant of the 2x2 matrix.
    [Show full text]
  • Triangle-Free Penny Graphs: Degeneracy, Choosability, and Edge Count
    Triangle-Free Penny Graphs: Degeneracy, Choosability, and Edge Count David Eppstein 25th International Symposium on Graph Drawing & Network Visualization Boston, Massachusetts, September 2017 Circle packing theorem Contacts of interior-disjoint disks in the plane form a planar graph All planar graphs can be represented this way Unique (up to M¨obius)for triangulated graphs [Koebe 1936; Andreev 1970; Thurston 2002] Balanced circle packing Some planar graphs may require exponentially-different radii a b c d But polynomial radii are e f g h i j k possible for: l m n o I Trees p I Outerpaths I Cactus graphs a I Bounded tree-depth b c d [Alam et al. 2015] j e g h i f m k l p n o Perfect balance Circle packings with all radii equal represent penny graphs [Harborth 1974; Erd}os1987] Penny graphs as proximity graphs Given any finite set of points in the plane Draw an edge between each closest pair of points (Pennies: circles centered at the given points with radius = half the minimum distance) So penny graphs may also be called closest-pair graphs or minimum-distance graphs Penny graphs as optimal graph drawings Penny graphs are exactly graphs that can be drawn I With no crossings I All edges equal length I Angular resolution ≥ π=3 Properties of penny graphs 3-degenerate (convex hull vertices have degree ≤ 3) ) easy proof of 4-color theorem; 4-list-colorable [Hartsfield and Ringel 2003] p Number of edges at most 3n − 12n − 3 Maximized by packing into a hexagon [Harborth 1974; Kupitz 1994] NP-hard to recognize, even for trees [Bowen et al.
    [Show full text]
  • Removing Degeneracy May Require a Large Dimension Increase∗
    THEORY OF COMPUTING, Volume 3 (2007), pp. 159–177 http://theoryofcomputing.org Removing Degeneracy May Require a Large Dimension Increase∗ Jirˇ´ı Matousekˇ Petr Skovroˇ nˇ Received: March 12, 2007; published: September 26, 2007. Abstract: Many geometric algorithms are formulated for input objects in general position; sometimes this is for convenience and simplicity, and sometimes it is essential for the al- gorithm to work at all. For arbitrary inputs this requires removing degeneracies, which has usually been solved by relatively complicated and computationally demanding perturbation methods. The result of this paper can be regarded as an indication that the problem of removing degeneracies has no simple “abstract” solution. We consider LP-type problems, a successful axiomatic framework for optimization problems capturing, e. g., linear programming and the smallest enclosing ball of a point set. For infinitely many integers D we construct a D- dimensional LP-type problem such that in order to remove degeneracies from it, we have to increase the dimension to at least (1 + ε)D, where ε > 0 is an absolute constant. The proof consists of showing that certain posets cannot be covered by pairwise disjoint copies of Boolean algebras under some restrictions on their placement. To this end, we prove that certain systems of linear inequalities are unsolvable, which seems to require surprisingly precise calculations. ∗An extended abstract of this paper has appeared in Proceedings of European Conference on Combinatorics, Graph Theory and Applications 2007 (Eurocomb), pp. 107–113. ACM Classification: F.2.2 AMS Classification: 68U05, 06A07, 68R99 Key words and phrases: LP-type problem, degeneracy, general position, geometric computation, par- tially ordered set Authors retain copyright to their work and grant Theory of Computing unlimited rights to publish the work electronically and in hard copy.
    [Show full text]
  • Degeneracy and All That = ∫
    DEGENERACY AND ALL THAT The Nature of Thermodynamics, Statistical Mechanics and Classical Mechanics Thermodynamics The study of the equilibrium bulk properties of matter within the context of four laws or ‘facts of experience’ that relate measurable properties, like temperature, pressure, and volume etc. It is important to understand that from the viewpoint of thermodynamics the microscopic nature of matter is irrelevant, that is, thermodynamics would apply equally well if matter formed a continuum. In addition, thermodynamics is a measurement or laboratory based science and is not a branch of metaphysics. Statistical Mechanics Statistical Mechanics is a statistical approach to solving the classical n body problem in order to study the same bulk properties of matter as thermodynamics but doing so at the microscopic level. In this way Statistical Mechanics allows an understanding of the equilibrium properties of matter at a molecular level. Statistical Mechanics makes heavy use of Thermodynamics, Classical Mechanics and Quantum Mechanics for its development and hence the perquisites for this course. Classical Mechanics The Classical Mechanical approach to studying the n body problem involves solving six simultaneous differential equations for each particle in the system. This assumes one knows the initial position q(t) and momentum p(t) of each particle at time to. Since the bulk properties of the system of interest are themselves functions of the q and p, i.e., G=G[p(t),q(t)] we can then do a time average of the form 1 t0 G Gobs G[ p ( t ), q ( t )] dt t0 where is long enough to ensure G is independent of , i.e., fluctuations are negligible.
    [Show full text]
  • A Non-Degeneracy Property for a Class of Degenerate Parabolic Equations
    Zeitschrift für Analysis und ihre Anwendungen Journal for Analysis and its Applications Volume 15 (1996), No. 3, 637-650 A Non-Degeneracy Property for a Class of Degenerate Parabolic Equations C. Ebmeyer Abstract. We deal with the initial and boundary value problem for the degenerate parabolic equation u = A,3(u) in the cylinder fI x (0,T), where I C R" is bounded, 3(0) = (0) 0, and,O ' ^! 0 (e.g., /3(U) uIlzIm_l (m > 1)). We study the appearance of the free boundary, and prove under certain hypothesis on 3 that the free boundary has a finite speed of propagation, and is Holder continuous. Further, we estimate the Lebesgue measure of the set where u > 0 is small and obtain the non-degeneracy property I10 < /3(u(x,t)) < e} < ce. Keywords: Free boundary problems, finite speed of propagation, porous medium equations AMS subject classification: Primary 35K65, secondary 35R35, 76S05 0. Introduction Consider the initial and boundary value problem u t =Ls13( u ) in Qx(0,T] u(x,t)=0 onôfZx(0,T] (0.1) u(x,0)=uo(x) in where Q C 1Ris bounded, T < +00, 0 is a function with /3(0) = i3(0) = 0 and ,3 > 0, and u0 > 0. Written in divergence form Ut = div(/3(u)Vu) we see that (0.1) is a degenerate parabolic equation. The model equation of this type is the porous medium equation Ut = I. (uIuI m_l ) (m > 1). (0.2) Equation (0.2) has been the subject of intensive research, surveys can be found in [14, 16].
    [Show full text]
  • A Computational Model of View Degeneracy and Its Application to Active Focal Length Control
    Please do not remove this page A Computational Model of View Degeneracy and its Application to Active Focal Length Control Wilkes, David; Dickinson, Sven J.; Tsotsos, John K. https://scholarship.libraries.rutgers.edu/discovery/delivery/01RUT_INST:ResearchRepository/12643458520004646?l#13643535820004646 Wilkes, D., Dickinson, S. J., & Tsotsos, J. K. (1997). A Computational Model of View Degeneracy and its Application to Active Focal Length Control. Rutgers University. https://doi.org/10.7282/T3R214W9 This work is protected by copyright. You are free to use this resource, with proper attribution, for research and educational purposes. Other uses, such as reproduction or publication, may require the permission of the copyright holder. Downloaded On 2021/10/04 10:05:38 -0400 A Computational Mo del of View Degeneracy and its Application to Active Focal Length Control David Wilkes Department of Computer Science University of Toronto Sven J Dickinson Rutgers University Center for Cognitive Science RuCCS and Department of Computer Science Rutgers University John K Tsotsos Department of Computer Science University of Toronto Abstract We quantify the observation by Kender and Freudenstein that degenerate views o ccupy a signicant fraction of the viewing sphere surrounding an ob ject This demonstrates that systems for recognition must explicitly account for the p ossibility of view degeneracy We show that view degeneracy cannot b e detected from a single camera viewp oint As a result systems designed to recognize ob jects from a single arbitrary
    [Show full text]
  • On Degeneracy in Geometric Computations*
    Chapter 3 On Degeneracy in Geometric Computations* Christoph Burnikelt Kurt Mehlhornt S tefan Schirrat Abstract solves P and z is a degenerate problem instance The main goal of this paper is to argue against the then x is also degenerate for A. Typical cases belief that perturbation is a “theoretical paradise” and of degeneracy are four cocircular points, three to put forward the claim that it is simpler (in terms collinear points, or two points with the same x- of programming effort) and more efficient (in terms of coordinate. Degeneracy is considered to be a running time) to avoid the perturbation technique and curse in geometric computations. It is common to deal directly with degenerate inputs. We substantiate belief that the requirement to handle degenerate our claim on two basic problems in computational geometry, the line segment intersection problem and the inputs leads to difficult and boring case analyses, convex hull problem. complicates algorithms, and produces cluttered code. 1 Introduction. Fortunately, there is a general technique for Following Emiris and Canny [EC921 we view a coping with degeneracies: the perturbation tech- geometric problem P as a function from IRnd to nique introduced by Edelsbrunner and Miicke S x IR,“, where n, m, and d are integers and S is [EM901 and later refined by Yap [YapSO] and some discrete space, modelling the symbolic part of Emiris and Canny [EC92]. In this technique, the the output (e.g., a planar graph or a face incidence input is perturbed symbolically, e.g., Emiris and lattice). A problem instance z E lRnd, which for Canny propose to replace the j-th coordinate ~;j concreteness we view as n points in d-dimensional of the i-th input point by x;j + E .
    [Show full text]
  • Edge Bounds and Degeneracy of Triangle-Free Penny Graphs and Squaregraphs
    Journal of Graph Algorithms and Applications http://jgaa.info/ vol. 0, no. 0, pp. 0{0 (0) DOI: 10.7155/jgaa.00463 Edge Bounds and Degeneracy of Triangle-Free Penny Graphs and Squaregraphs David Eppstein Department of Computer Science, University of California, Irvine Abstract We show that triangle-free penny graphs have degeneracy at most two, and that both triangle-free penny graphs and squaregraphs have at most p min2n − Ω( n); 2n − D − 2 edges, where n is the number of vertices and D is the diameter of the graph. Submitted: Reviewed: Revised: Accepted: Final: October 2017 January 2017 February 2017 February 2018 March 2018 Published: Article type: Communicated by: Regular paper F. Frati and K.-L. Ma A preliminary version of this paper appears as \Triangle-Free Penny Graphs: Degeneracy, Choosability, and Edge Count" in the proceedings of the 25th International Symposium on Graph Drawing and Network Visualization. The material on squaregraphs was added subsequently to that version. This work was supported in part by the National Science Foundation under Grants CCF-1228639, CCF-1618301, and CCF-1616248. E-mail address: [email protected] (David Eppstein) JGAA, 0(0) 0{0 (0) 1 1 Introduction In this paper we investigate the number of edges and degeneracy of two classes of planar graphs, the triangle-free penny graphs and the squaregraphs. 1.1 Background Numbers of edges. It is standard that n-vertex planar graphs have at most 3n − 6 edges, and that bipartite planar graphs have at most 2n − 4 edges. The 3n − 6 bound follows by observing that in an embedded graph with n vertices, e edges, and f faces, each face has at least three edges, and by using the corresponding inequality on the number of face-edge incidences, 2e ≥ 3f, to eliminate the number f of faces from Euler's formula n − e + f = 2.
    [Show full text]
  • Arxiv:1807.08641V1 [Cond-Mat.Mes-Hall] 23 Jul 2018
    Attractive Coulomb interactions in a triple quantum dot Changki Hong,1 Gwangsu Yoo,2 Jinhong Park,3 Min-Kyun Cho,4 Yunchul Chung,1, 3, ∗ H.-S. Sim,2, y Dohun Kim,4, z Hyungkook Choi,5 Vladimir Umansky,3 and Diana Mahalu3 1Department of Physics, Pusan National University, Busan 46241, Republic of Korea 2Department of Physics, Korea Advanced Institute of Science and Technology, Daejeon 34141, Republic of Korea 3Department of Condensed Matter Physics, Weizmann Institute of Science, Rehovot 76100, Israel 4Department of Physics and Astronomy, and Institute of Applied Physics, Seoul National University, Seoul 08826, Republic of Korea 5Department of Physics, Research Institute of Physics and Chemistry, Chonbuk National University, Jeonju 54896, Republic of Korea Electron pairing due to a repulsive Coulomb interaction in a triple quantum dot (TQD) is exper- imentally studied. It is found that electron pairing in two dots of a TQD is mediated by the third dot, when the third dot strongly couples with the other two via Coulomb repulsion so that the TQD is in the twofold degenerate ground states of (1; 0; 0) and (0; 1; 1) charge configurations. Using the transport spectroscopy that monitors electron transport through each individual dot of a TQD, we analyze how to achieve the degeneracy in experiments, how the degeneracy is related to electron pairing, and the resulting nontrivial behavior of electron transport. Our findings may be used to design a system with nontrivial electron correlations and functionalities. Recently, it was experimentally demonstrated [1], us- charges, we find that electron pairing in two QDs of the ing an electrostatically coupled quadruple quantum dot TQD is mediated by the third QD, when the third QD formed in carbon nanotubes, that an effectively attrac- strongly couples with the other two QDs via Coulomb re- tive interaction between electrons can be induced purely pulsion.
    [Show full text]