Formulae and asymptotics for coefficients of algebraic functions
C Banderier, M Drmota - Combinatorics, Probability and Computing, 2015 - cambridge.org
We study the coefficients of algebraic functions∑ n≥ 0fnzn. First, we recall the too-little-
known fact that these coefficients fn always admit a closed form. Then we study their …
known fact that these coefficients fn always admit a closed form. Then we study their …
Some families of increasing planar maps
M Albenque, JF Marckert - 2008 - projecteuclid.org
Stack-triangulations appear as natural objects when one wants to define some families of
increasing triangulations by successive additions of faces. We investigate the asymptotic …
increasing triangulations by successive additions of faces. We investigate the asymptotic …
Some properties of random Apollonian networks
A Frieze, CE Tsourakakis - Internet Mathematics, 2014 - Taylor & Francis
In this work, we analyze fundamental properties of random Apollonian networks [Zhang et al.
06, Zhou et al. 05], a popular random graph model that generates planar graphs with power …
06, Zhou et al. 05], a popular random graph model that generates planar graphs with power …
A characterization of some graphs with metric dimension two
A set W⊆ V (G) is called a resolving set, if for each pair of distinct vertices u, v∈ V (G) there
exists t∈ W such that d (u, t)≠ d (v, t), where d (x, y) is the distance between vertices x and y …
exists t∈ W such that d (u, t)≠ d (v, t), where d (x, y) is the distance between vertices x and y …
Coefficients of algebraic functions: formulae and asymptotics
C Banderier, M Drmota - Discrete Mathematics & Theoretical …, 2013 - dmtcs.episciences.org
This paper studies the coefficients of algebraic functions. First, we recall the too-little-known
fact that these coefficients f_n have a closed form. Then, we study their asymptotics, known …
fact that these coefficients f_n have a closed form. Then, we study their asymptotics, known …
[PDF][PDF] Mathematical and algorithmic analysis of network and biological data
CE Tsourakakis - arXiv preprint arXiv:1407.0375, 2014 - arxiv.org
Mathematical and Algorithmic Analysis of Network and Biological Data Page 1 Carnegie Mellon
University Doctoral Thesis Mathematical and Algorithmic Analysis of Network and Biological …
University Doctoral Thesis Mathematical and Algorithmic Analysis of Network and Biological …
Limiting Distribution for Distances in k-Trees
A Darrasse, M Soria - International Workshop on Combinatorial Algorithms, 2009 - Springer
This paper examines the distances between vertices in a rooted k-tree, for a fixed k, by
exhibiting a correspondence with a variety of trees that can be specified in terms of …
exhibiting a correspondence with a variety of trees that can be specified in terms of …
Characterizing several properties of high-dimensional random Apollonian networks
P Zhang - Journal of Complex Networks, 2020 - academic.oup.com
In this article, we investigate several properties of high-dimensional random Apollonian
networks, including two types of degree profiles, the small-world effect (clustering property) …
networks, including two types of degree profiles, the small-world effect (clustering property) …
Heavy subtrees of Galton-Watson trees with an application to Apollonian networks
L Devroye, C Holmgren, H Sulzbach - 2019 - projecteuclid.org
We study heavy subtrees of conditional Galton-Watson trees. In a standard Galton-Watson
tree conditional on its size being n, we order all children by their subtree sizes, from large …
tree conditional on its size being n, we order all children by their subtree sizes, from large …
[PDF][PDF] A Characterization of Graphs with Metric Dimension Two
M Shreesha Kalkoor - 2018 - ijrar.org
In this paper, we define distance partition of vertex set of a graph G with reference to a vertex
in it and with the help of the same, a graph with metric dimension two (ie β (G)= 2) is …
in it and with the help of the same, a graph with metric dimension two (ie β (G)= 2) is …