5,109 research outputs found

    Bounds on the radius and status of graphs

    Full text link
    Two classical concepts of centrality in a graph are the median and the center. The connected notions of the status and the radius of a graph seem to be in no relation. In this paper, however, we show a clear connection of both concepts, as they obtain their minimum and maximum values at the same type of tree graphs. Trees with fixed maximum degree and extremum radius and status, resp., are characterized. The bounds on radius and status can be transferred to general connected graphs via spanning trees. A new method of proof allows not only to regain results of Lin et al. on graphs with extremum status, but it allows also to prove analogous results on graphs with extremum radius

    Statistical Inference in a Directed Network Model with Covariates

    Get PDF
    Networks are often characterized by node heterogeneity for which nodes exhibit different degrees of interaction and link homophily for which nodes sharing common features tend to associate with each other. In this paper, we propose a new directed network model to capture the former via node-specific parametrization and the latter by incorporating covariates. In particular, this model quantifies the extent of heterogeneity in terms of outgoingness and incomingness of each node by different parameters, thus allowing the number of heterogeneity parameters to be twice the number of nodes. We study the maximum likelihood estimation of the model and establish the uniform consistency and asymptotic normality of the resulting estimators. Numerical studies demonstrate our theoretical findings and a data analysis confirms the usefulness of our model.Comment: 29 pages. minor revisio

    Stabbing line segments with disks: complexity and approximation algorithms

    Full text link
    Computational complexity and approximation algorithms are reported for a problem of stabbing a set of straight line segments with the least cardinality set of disks of fixed radii r>0r>0 where the set of segments forms a straight line drawing G=(V,E)G=(V,E) of a planar graph without edge crossings. Close geometric problems arise in network security applications. We give strong NP-hardness of the problem for edge sets of Delaunay triangulations, Gabriel graphs and other subgraphs (which are often used in network design) for r[dmin,ηdmax]r\in [d_{\min},\eta d_{\max}] and some constant η\eta where dmaxd_{\max} and dmind_{\min} are Euclidean lengths of the longest and shortest graph edges respectively. Fast O(ElogE)O(|E|\log|E|)-time O(1)O(1)-approximation algorithm is proposed within the class of straight line drawings of planar graphs for which the inequality rηdmaxr\geq \eta d_{\max} holds uniformly for some constant η>0,\eta>0, i.e. when lengths of edges of GG are uniformly bounded from above by some linear function of r.r.Comment: 12 pages, 1 appendix, 15 bibliography items, 6th International Conference on Analysis of Images, Social Networks and Texts (AIST-2017

    Statuses and double branch weights of quadrangular outerplanar graphs

    Get PDF
    In this paper we study some distance properties of outerplanar graphs with the Hamiltonian cycle whose all bounded faces are cycles isomorphic to the cycle C4. We call this family of graphs quadrangular outerplanar graphs. We give the lower and upper bound on the double branch weight and the status for this graphs. At the end of this paper we show some relations between median and double centroid in quadrangular outerplanar graphs
    corecore