Algorithms and Models for the Web Graph Anthony

Bonato get pdf

Get your copy at textbookfull.com

( 4.6/5.0 ★ | 273 downloads )

https://textbookfull.com/product/algorithms-and-models-for-the-web-
graph-anthony-bonato/
Algorithms and Models for the Web Graph Anthony Bonato

TEXTBOOK

Available Formats

■ PDF eBook Study Guide Ebook

EXCLUSIVE 2025 ACADEMIC EDITION – LIMITED RELEASE

Available Instantly Access Library

More products digital (pdf, epub, mobi) instant
download maybe you interests ...

Algorithms and Models for the Web Graph 17th

International Workshop WAW 2020 Warsaw Poland September
21 22 2020 Proceedings Bogumi■ Kami■ski

https://textbookfull.com/product/algorithms-and-models-for-the-
web-graph-17th-international-workshop-waw-2020-warsaw-poland-
september-21-22-2020-proceedings-bogumil-kaminski/

Graph Searching Games and Probabilistic Methods 1st

Edition Bonato

https://textbookfull.com/product/graph-searching-games-and-
probabilistic-methods-1st-edition-bonato/

A guide to graph colouring algorithms and applications

Lewis

https://textbookfull.com/product/a-guide-to-graph-colouring-
algorithms-and-applications-lewis/

Graph Algorithms for Data Science: With examples in

Neo4j 1st Edition Tomaž Bratanic

https://textbookfull.com/product/graph-algorithms-for-data-
science-with-examples-in-neo4j-1st-edition-tomaz-bratanic/
Hybrid System Identification: Theory and Algorithms for
Learning Switching Models Fabien Lauer

https://textbookfull.com/product/hybrid-system-identification-
theory-and-algorithms-for-learning-switching-models-fabien-lauer/

Graph Algorithms Practical Examples in Apache Spark and

Neo4j 1st Edition Mark Needham

https://textbookfull.com/product/graph-algorithms-practical-
examples-in-apache-spark-and-neo4j-1st-edition-mark-needham/

Discrete Mathematics Graph Algorithms Algebraic

Structures Coding Theory and Cryptography 1st Edition
Sriraman Sridharan

https://textbookfull.com/product/discrete-mathematics-graph-
algorithms-algebraic-structures-coding-theory-and-
cryptography-1st-edition-sriraman-sridharan/

Biological Network Analysis: Trends, Approaches, Graph

Theory, and Algorithms 1st Edition Pietro Hiram Guzzi

https://textbookfull.com/product/biological-network-analysis-
trends-approaches-graph-theory-and-algorithms-1st-edition-pietro-
hiram-guzzi/

Genetic Algorithms and Machine Learning for Programmers

Create AI Models and Evolve Solutions 1st Edition
Frances Buontempo

https://textbookfull.com/product/genetic-algorithms-and-machine-
learning-for-programmers-create-ai-models-and-evolve-
solutions-1st-edition-frances-buontempo/
 Anthony Bonato
Paweł Prałat
Andrei Raigorodskii (Eds.)
LNCS 10836

Algorithms and Models

for the Web Graph
15th International Workshop, WAW 2018
Moscow, Russia, May 17–18, 2018
Proceedings

123
Lecture Notes in Computer Science 10836
Commenced Publication in 1973
Founding and Former Series Editors:
Gerhard Goos, Juris Hartmanis, and Jan van Leeuwen

Editorial Board
David Hutchison
Lancaster University, Lancaster, UK
Takeo Kanade
Carnegie Mellon University, Pittsburgh, PA, USA
Josef Kittler
University of Surrey, Guildford, UK
Jon M. Kleinberg
Cornell University, Ithaca, NY, USA
Friedemann Mattern
ETH Zurich, Zurich, Switzerland
John C. Mitchell
Stanford University, Stanford, CA, USA
Moni Naor
Weizmann Institute of Science, Rehovot, Israel
C. Pandu Rangan
Indian Institute of Technology Madras, Chennai, India
Bernhard Steffen
TU Dortmund University, Dortmund, Germany
Demetri Terzopoulos
University of California, Los Angeles, CA, USA
Doug Tygar
University of California, Berkeley, CA, USA
Gerhard Weikum
Max Planck Institute for Informatics, Saarbrücken, Germany
More information about this series at http://www.springer.com/series/7407
Anthony Bonato Paweł Prałat
•

Andrei Raigorodskii (Eds.)

Algorithms and Models

for the Web Graph
15th International Workshop, WAW 2018
Moscow, Russia, May 17–18, 2018
Proceedings

123
Editors
Anthony Bonato Andrei Raigorodskii
Department of Mathematics Department of Discrete Mathematics
Ryerson University Moscow Institute of Physics and Technology
Toronto, ON Dolgoprudny
Canada Russia
Paweł Prałat
Department of Mathematics
Ryerson University
Toronto, ON
Canada

ISSN 0302-9743 ISSN 1611-3349 (electronic)

Lecture Notes in Computer Science
ISBN 978-3-319-92870-8 ISBN 978-3-319-92871-5 (eBook)
https://doi.org/10.1007/978-3-319-92871-5

Library of Congress Control Number: 2018944417

LNCS Sublibrary: SL1 – Theoretical Computer Science and General Issues

© Springer International Publishing AG, part of Springer Nature 2018

This work is subject to copyright. All rights are reserved by the Publisher, whether the whole or part of the
material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation,
broadcasting, reproduction on microfilms or in any other physical way, and transmission or information
storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now
known or hereafter developed.
The use of general descriptive names, registered names, trademarks, service marks, etc. in this publication
does not imply, even in the absence of a specific statement, that such names are exempt from the relevant
protective laws and regulations and therefore free for general use.
The publisher, the authors and the editors are safe to assume that the advice and information in this book are
believed to be true and accurate at the date of publication. Neither the publisher nor the authors or the editors
give a warranty, express or implied, with respect to the material contained herein or for any errors or
omissions that may have been made. The publisher remains neutral with regard to jurisdictional claims in
published maps and institutional affiliations.

Printed on acid-free paper

This Springer imprint is published by the registered company Springer International Publishing AG
part of Springer Nature
The registered company address is: Gewerbestrasse 11, 6330 Cham, Switzerland
 Preface

The 15th Workshop on Algorithms and Models for the Web Graph (WAW 2018) took
place at the Moscow Institute of Physics and Technology, Russia, May 17–18, 2018.
This is an annual meeting, which is traditionally co-located with another, related,
conference. WAW 2018 was co-located with the Workshop on Graphs, Networks, and
Their Applications. The co-location of the two workshops provided opportunities for
researchers in two different but interrelated areas to interact and to exchange research
ideas. It was an effective venue for the dissemination of new results and for fostering
research collaboration.
The World Wide Web has become part of our everyday life, and information
retrieval and data mining on the Web are now of enormous practical interest. The
algorithms supporting these activities combine the view of the Web as a text repository
and as a graph, induced in various ways by links among pages, hosts and users. The
aim of the workshop was to further the understanding of graphs that arise from the Web
and various user activities on the Web, and stimulate the development of
high-performance algorithms and applications that exploit these graphs. The workshop
gathered together researchers working on graph-theoretic and algorithmic aspects of
related complex networks, including social networks, citation networks, biological
networks, molecular networks, and other networks arising from the Internet.
This volume contains the papers presented during the workshop. Each submission
was reviewed by Program Committee members. Papers were submitted and reviewed
using the EasyChair online system. The committee members accepted 11 papers.

May 2018 Anthony Bonato

Paweł Prałat
Andrei Raigorodskii
 Organization

General Chairs
Andrei Z. Broder Google Research, USA
Fan Chung Graham University of California San Diego, USA

Organizing Committee
Anthony Bonato Ryerson University, Canada
Paweł Prałat Ryerson University, Canada
Andrei Raigorodskii MIPT, Russia

Program Committee
Konstantin Avratchenkov Inria, France
Paolo Boldi University of Milan, Italy
Anthony Bonato Ryerson University, Canada
Milan Bradonjic Bell, USA
Fan Chung Graham UC San Diego, USA
Collin Cooper King’s College London, UK
Andrzej Dudek Western Michigan University, USA
Alan Frieze Carnegie Mellon University, USA
Aristides Gionis Aalto University, Finland
David Gleich Purdue University, USA
Jeannette Janssen Dalhousie University, Canada
Bogumil Kaminski Warsaw School of Economics, Poland
Ravi Kumar Google Research, USA
Silvio Lattanzi Google Research, USA
Marc Lelarge Inria, France
Stefano Leonardi Sapienza University of Rome, Italy
Nelly Litvak University of Twente, The Netherlands
Michael Mahoney UC Berkeley, USA
Oliver Mason NUI Maynooth, Ireland
Dieter Mitsche Université de Nice Sophia-Antipolis, France
Peter Morters University of Bath, UK
Tobias Mueller Utrecht University, The Netherlands
Liudmila Ostroumova Yandex, Russia
Pan Peng TU Dortmund, Germany
Xavier Perez-Gimenez University of Nebraska-Lincoln, USA
Pawel Pralat Ryerson University, Canada
Yana Volkovich AppNexus, USA
Stephen Young Pacific Northwest National Laboratory, USA
VIII Organization

Sponsoring Institutions

Microsoft Research New England, USA

Google Research, USA
Moscow Institute of Physics and Technology, Russia
Yandex, Russia
Internet Mathematics
 Contents

Finding Induced Subgraphs in Scale-Free Inhomogeneous

Random Graphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
Ellen Cardinaels, Johan S. H. van Leeuwaarden,
and Clara Stegehuis

The Asymptotic Normality of the Global Clustering Coefficient

in Sparse Random Intersection Graphs . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16
Mindaugas Bloznelis and Jerzy Jaworski

Clustering Properties of Spatial Preferential Attachment Model . . . . . . . . . . . 30

Lenar Iskhakov, Bogumił Kamiński, Maksim Mironov, Paweł Prałat,
and Liudmila Prokhorenkova

Parameter Estimators of Sparse Random Intersection Graphs

with Thinned Communities . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 44
Joona Karjalainen, Johan S. H. van Leeuwaarden, and Lasse Leskelä

Joint Alignment from Pairwise Differences with a Noisy Oracle . . . . . . . . . . 59

Michael Mitzenmacher and Charalampos E. Tsourakakis

Analysis of Relaxation Time in Random Walk with Jumps . . . . . . . . . . . . . 70

Konstantin Avrachenkov and Ilya Bogdanov

QAP Analysis of Company Co-mention Network . . . . . . . . . . . . . . . . . . . . 83

S. P. Sidorov, A. R. Faizliev, V. A. Balash, A. A. Gudkov,
A. Z. Chekmareva, M. Levshunov, and S. V. Mironov

Towards a Systematic Evaluation of Generative Network Models . . . . . . . . . 99

Thomas Bläsius, Tobias Friedrich, Maximilian Katzmann,
Anton Krohmer, and Jonathan Striebel

Dynamic Competition Networks: Detecting Alliances and Leaders . . . . . . . . 115

Anthony Bonato, Nicole Eikmeier, David F. Gleich, and Rehan Malik

An Experimental Study of the k-MXT Algorithm with Applications

to Clustering Geo-Tagged Data . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 145
Colin Cooper and Ngoc Vu

A Statistical Performance Analysis of Graph Clustering Algorithms. . . . . . . . 170

Pierre Miasnikof, Alexander Y. Shestopaloff, Anthony J. Bonner,
and Yuri Lawryshyn

Author Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 185

 Finding Induced Subgraphs in Scale-Free
Inhomogeneous Random Graphs

Ellen Cardinaels, Johan S. H. van Leeuwaarden, and Clara Stegehuis(B)

Eindhoven University of Technology, Eindhoven, The Netherlands

[email protected]

Abstract. We study the induced subgraph isomorphism problem on

inhomogeneous random graphs with infinite variance power-law degrees.
We provide a fast algorithm that determines for any connected graph H
on k vertices if it exists as induced subgraph in a random graph with n
vertices. By exploiting the scale-free graph structure, the algorithm runs
in O(nk) time for small values of k. We test our algorithm on several
real-world data sets.

1 Introduction
The induced subgraph isomorphism problem asks whether a large graph G con-
tains a connected graph H as an induced subgraph. When k is allowed to grow
with the graph size n, this problem is NP-hard in general. For example, k-
clique and k induced cycle, special cases of H, are known to be NP-hard [13,20].
For fixed k, this problem can be solved in polynomial time O(nk ) by search-
ing for H on all possible combinations of k vertices. Several randomized and
non-randomized algorithms exist to improve upon this trivial way of finding
H [14,25,27,29].
On real-world networks, many algorithms were observed to run much faster
than predicted by the worst-case running time of algorithms. This may be
ascribed to some of the properties that many real-world networks share [4],
such as the power-law degree distribution found in many networks [1,8,19,28].
One way of exploiting these power-law degree distributions is to design algo-
rithms that work well on random graphs with power-law degree distributions.
For example, finding the largest clique in a network is NP-complete for general
networks [20]. However, in random graph models such as the Erdős-Rényi ran-
dom graph and the inhomogeneous random graph, their specific structures can be
exploited to design fixed parameter tractable (FPT) algorithms that efficiently
find a clique of size k [10,12] or the largest independent set [15].
In this paper, we study algorithms that are designed to perform well for
the inhomogeneous random graph, a random graph model that can generate
graphs with a power-law degree distribution [2,3,5,6,24,26]. The inhomogeneous
random graph has a densely connected core containing many cliques, consisting
of vertices with degrees n log(n) and larger. In this densely connected core,
the probability of an edge being present is close to one, so that it contains
c Springer International Publishing AG, part of Springer Nature 2018
A. Bonato et al. (Eds.): WAW 2018, LNCS 10836, pp. 1–15, 2018.
https://doi.org/10.1007/978-3-319-92871-5_1
2 E. Cardinaels et al.

many complete graphs [18]. This observation was exploited in [11] to efficiently
determine whether a clique of size k occurs as a subgraph in an inhomogeneous
random graph. When searching for induced subgraphs however, some edges are
required not to be present. Therefore, searching for induced subgraphs in the
entire core is not efficient. We show that a connected subgraph H can be found
as an induced subgraph by scanning only vertices √ that are on the boundary of
the core: vertices with degrees proportional to n.
We present √ an algorithm that first selects the set of vertices with degrees
proportional to n, and then randomly searches for H as an induced subgraph on
a subset of k of those vertices. The first algorithm we present does not depend on
the specific structure of H. For general sparse graphs, the best known algorithms
to solve subgraph isomorphism on 3 or 4 vertices run in O(n1.41 ) or O(n1.51 ) time
with high probability [29]. For small values of k, our algorithm solves subgraph
isomorphism on k nodes in linear time with high probability on inhomogeneous
random graphs. However, the graph size needs to be very large for our algorithm
to perform well. We therefore present √a second algorithm that again selects the
vertices with degrees proportional to n, and then searches for induced subgraph
H in a more efficient way. This algorithm has the same performance guarantee
as our first algorithm, but performs much better in simulations.
We test our algorithm on large inhomogeneous random graphs, where it
indeed efficiently finds induced subgraphs. We also test our algorithm on real-
world network data with power-law degrees. There our algorithm does not per-
form well, probably due to the fact that the densely connected core of some
real-world
√ networks may not be the vertices of degrees at least proportional
to n. We then show that a slight modification of our algorithm that looks for
induced subgraphs on vertices of degrees proportional to nγ for some other value
of γ performs better on real-world networks, where the value of γ depends on
the specific network.
Notation. We say that a sequence of events (En )n≥1 happens with high prob-
ability (w.h.p.) if limn→∞ P (En ) = 1. Furthermore, we write f (n) = o(g(n)) if
limn→∞ f (n)/g(n) = 0, and f (n) = O(g(n)) if |f (n)|/g(n) is uniformly bounded,
where (g(n))n≥1 is nonnegative. Similarly, if lim supn→∞ |f (n)| /g(n) > 0, we
say that f (n) = Ω(g(n)) for nonnegative (g(n))n≥1 . We write f (n) = Θ(g(n)) if
f (n) = O(g(n)) as well as f (n) = Ω(g(n)).

1.1 Model
As a random graph null model, we use the inhomogeneous random graph or
hidden variable model [2,3,5,6,24,26]. Every vertex is equipped with a weight.
We assume that the weights are i.i.d. samples from the power-law distribution
P (wi > k) = Ck 1−τ (1.1)
for some constant C and for τ ∈ (2, 3). Two vertices with weights w and w are
connected with probability
 
 ww
p(w, w ) = min ,1 , (1.2)
μn
 Finding Induced Subgraphs in Scale-Free Inhomogeneous Random Graphs 3

where μ denotes the mean value of the power-law distribution (1.1). Choosing
the connection probability in this way ensures that the expected degree of a
vertex with weight w is w.

1.2 Algorithms

We now describe two randomized algorithms that determine whether a connected

graph H is an induced subgraph in an inhomogeneous random graph and find
the location of such a subgraph if it exists. Algorithm 1 selects the vertices in
the inhomogeneous random graph that are on the boundary of the core of the
√
graph: vertices with degrees slightly below μn. Then, the algorithm randomly
divides these vertices into sets of k vertices. If one of these sets contains H as
an induced subgraph, the algorithm terminates and returns the location of H. If
this is not the case, then the algorithm fails. In the next section, we show that
for k small enough, the probability that the algorithm fails is small. This means
that H is present as an induced subgraph on vertices that are on the boundary
of the core with high probability.
Algorithm 1 is similar to the algorithm in [12] designed to find cliques in
random graphs. The major difference is that the algorithm
√ to find cliques looks
for cliques on all vertices with degrees larger than f1 μn for some function f1 .
This algorithm is not efficient for detecting other subgraphs than cliques, since
vertices with high degrees will be connected with probability close to one.

Algorithm 1. Finding induced subgraph H (random search)

Input : H, G = (V, E), μ, f1 = f1 (n), f2 = f2 (n).
Output: Location of H √ in G √
or fail.
1 Define n = |V |, In = [ f1 μn, f2 μn] and set V  = ∅.
2 for i ∈ V do
3 if Di ∈ In then V  = V  ∪ i
4 end
5 Divide the vertices in V  randomly into |V  | /k sets S1 , . . . , S|V  |/k .
6 for j = 1, . . . , |V  | /k do
7 if H is an induced subgraph on Sj then return location of H
8 end

The following theorem gives a bound for the performance of Algorithm 1 for
small values of k.
Theorem 1. Choose f1 = f1 (n) ≥ 1/ log(n) and f1 < f2 < 1 and let k <
log1/3 (n). Then, with high probability, Algorithm 1 detects induced subgraph H
on k vertices in an inhomogeneous random graph with n vertices and weights
distributed as in (1.1) in time O(nk).
Thus, for small values of k, Algorithm 1 finds an instance of H in linear time.
4 E. Cardinaels et al.

A problem with parameter k is called fixed parameter tractable (FPT) if it

can be solved in f (k)nO(1) time for some function f (k), and it is called typical
FPT (typFPT) if it can be solved in f (k)ng(n) for some function g(n) = O(1)
with high probability [9]. As a corollary of Theorem 1 we obtain that the
induced subgraph problem on the inhomogeneous random graph is in typFPT
for any subgraph H, similarly to the k-clique problem on inhomogeneous random
graphs [12].
Corollary 1. The induced subgraph problem on the inhomogeneous random
graph is in typFPT.
In theory Algorithm 1 detects any motif on k vertices in linear time for small
k. However, this only holds for large values of n, which can be understood as
follows. In Lemma 2, we show that |V  | = Θ(n(3−τ )/2 ), thus tending to infinity
as n grows large. However, when n = 107 and τ = 2.5, this means that the size
of the set V  is only proportional to 101.75 = 56 vertices. Therefore, the number
of sets Sj constructed in Algorithm 1 is also small. Even though the probability
of finding motif H in any such set is proportional to a constant, this constant
may be small, so that for finite n the algorithm almost always fails. Thus, for
Algorithm 1 to work, n needs to be large enough so that n(3−τ )/2 is large as well.
The algorithm can be significantly improved by changing the search for H
on vertices in set V  . In Algorithm 2 we propose a search for motif H similar
to the Kashtan motif sampling algorithm [21]. Rather than sampling k vertices
randomly, it samples one vertex randomly, and then randomly increases the set
S by adding vertices in its neighborhood. This already guarantees the vertices
in list Sj to be connected, making it more likely for them to form a specific
connected motif together. In particular, we expand the list Sj in such a way that
the vertices in Sj are guaranteed to form a spanning tree of H as a subgraph.
This is ensured by choosing the list T H that specifies at which vertex in Sj we
expand Sj by adding a new vertex. For example, if k = 4 and we set T H = [1, 2, 3]
we first add an edge to the first vertex, then we look for a random neighbor of
the previously added vertex, and then we add a random neighbor of the third
added vertex. Thus, setting T H = [1, 2, 3] ensures that the set Sj contains a path
of length three, whereas setting T H = [1, 1, 1] ensures that the set Sj contains a
star-shaped subgraph. Depending on which subgraph H we are looking for, we
can define T H in such a way that we ensure that the set Sj at least contains a
spanning tree of motif H in Step 6 of the algorithm.
The selection on the degrees ensures that the degrees are sufficiently high so
that probability of finding such a connected set on k vertices is high, as well as
that the degrees are sufficiently low to ensure that we do not only find complete
graphs because of the densely connected core of the inhomogeneous random
graph. The probability that Algorithm 2 indeed finds the desired motif H in
any check is of constant order of magnitude, similar to Algorithm 1. Therefore,
the performance guarantee of both algorithms is similar. However, in practice
Algorithm 2 performs much better, since for finite n, k connected vertices are
more likely to form a motif than k randomly chosen vertices.
 Finding Induced Subgraphs in Scale-Free Inhomogeneous Random Graphs 5

Algorithm 2. Finding induced subgraph H (neighborhood search)

Input : H, G = (V, E), μ, f1 = f1 (n), f2 = f2 (n), s.
Output: Location of H √ in G √
or fail.
1 Define n = |V |, In = [ f1 μn, f2 μn] and set V  = ∅.
2 for i ∈ V do
3 if Di ∈ In then V  = V  ∪ i
4 end
5 Let G be the induced subgraph of G on vertices V  .
6 Set T H consistently with motif H.
7 for j=1,. . . ,s do
8 Pick a random vertex v ∈ V  and set Sj = v.
9 while |Sj | = k do
10 Pick a random v  ∈ NG (Sj [T H [j]]) : v  ∈
/ Sj
11 Add v  to Sj .
12 end
13 if H is an induced subgraph on Sj then return location of H
14 end

The following theorem shows that indeed Algorithm 2 has similar perfor-
mance guarantees as Algorithm 1.
Theorem 2. Choose f1 = f1 (n) ≥ 1/ log(n) and f1 < f2 < 1. Choose s =
Ω(nα ) for some 0 < α < 1, such that s ≤ n/k. Then, Algorithm 2 detects
induced subgraph H on k < log1/3 (n) vertices on an inhomogeneous random
graph with n vertices and weights distributed as in (1.1) in time O(nk) with high
probability.
The proofs of Theorems 1 and 2 rely on the fact that for small k, any sub-
graph on k vertices is present in G with high probability. This means that after
the degree selection step of Algorithms 1 and 2, for small k, any motif finding
algorithm can be used to find motif H on the remaining graph G , such as the
Grochow-Kellis algorithm [14], the MAvisto algorithm [27] or the MODA algo-
rithm [25]. In the proofs of Theorems 1 and 2, we show that G has Θ(n(3−τ )/2 )
vertices with high probability. Thus, the degree selection step reduces the prob-
lem of finding a motif H on n vertices to finding a motif on a graph with
Θ(n(3−τ )/2 ) vertices, significantly reducing the running time of the algorithms.

2 Proof of Theorems 1 and 2

We prove Theorem 1 using two lemmas. The first lemma relates the degrees of
the vertices to their weights. The connection probabilities in the inhomogeneous
random graph depend on the weights of the vertices. In Algorithm 1, we select
vertices based on their degrees instead of their unknown weights. The following
lemma shows that the weights of the vertices in V  are close to their degrees.
6 E. Cardinaels et al.

√
Lemma
√ 1. Degrees and weights. Fix ε > 0, and define Jn = [(1−ε) f1 μn, (1+
ε) f2 μn]. Then, for some K > 0,
 2 
 ε (1 − ε) 
P (∃i ∈ V : wi ∈
/ Jn ) ≤ Kn exp − f1 μn . (2.1)
2(1 + ε)
Proof. Fix a vertex i ∈ V . Conditionally on the weight wi of vertex i, Di ∼
Poi(wi ) [5,16]. Then,
   P D ∈ I | w < (1 − ε)√f μn
i n i 1
P wi < (1 − ε) f1 μn, Di ∈ In =  √ 
P wi < (1 − ε) f1 μn
 √ √ 
P Di > f1 μn | wi = (1 − ε) f1 μn
≤ √
1 − C((1 − ε) f1 μn)1−τ
   
≤ K1 P Di > f1 μn | wi = (1 − ε) f1 μn ,
(2.2)
for some K1 > 0. Here the first inequality follows because for Poisson random
variables P (Poi(λ1 ) > k) ≤ P (Poi(λ2 ) > k) for λ1 < λ2 . We use that by the
Chernoff bound for Poisson random variables
 
P (X > λ(1 + δ)) ≤ exp −h(δ)δ 2 λ/2 , (2.3)
where h(δ) = 2((1 + δ) ln(1 + δ) − δ)/δ 2 . Therefore, using that h(δ) ≥ 1/(1 + δ)
for δ ≥ 0 results in
   2 
  ε (1 − ε) 
P Di > f1 μn | wi = (1 − ε) f1 μn ≤ exp − f1 μn . (2.4)
2(1 + ε)
Combining this with (2.2) and taking the union bound over all vertices then
results in
   2 
 ε (1 − ε) 
P ∃i : Di ∈ In , wi < (1 − ε) f1 μn ≤ K1 n exp − f1 μn . (2.5)
2(1 + ε)
√
The bound for wi > (1 + ε) f2 μn follows similarly. Combining this with the
fact that f1 < f2 then proves the lemma. 
The second lemma shows that after deleting all vertices with degrees outside
of In defined in Step 1 of Algorithm 1, still polynomially many vertices remain
with high probability.
Lemma 2. Polynomially many nodes remain. There exists γ > 0 such that
   
P |V  | < γn(3−τ )/2 ≤ 2 exp −Θ(n(3−τ )/2 ) . (2.6)

Proof. Let E denote the event that all vertices i ∈ V  satisfy wi ∈ Jn for some
ε > 0, with Jn as in Lemma 1. Let W  be the set of vertices with weights in Jn .
Under the event E, |V  | ≤ |W  |. Then, by Lemma 1
     2 
ε (1 − ε) 
P |V  | < γn(3−τ )/2 ≤ P |W  | < γn(3−τ )/2 + Kn exp − f1 μn .
2(1 + ε)
(2.7)
 Finding Induced Subgraphs in Scale-Free Inhomogeneous Random Graphs 7

Furthermore,
  √
P (wi ∈ Jn ) = C((1 − ε) f1 μn)1−τ − C((1 + ε) f2 μn)1−τ ≥ c1 ( μn)1−τ
(2.8)
for some constant c1 > 0 because f1 < f2 . Thus, each of the n vertices is in
√
set W  independently with probability at least c1 ( μn)1−τ . Choose 0 < γ < c1 .
Applying the multiplicative Chernoff bound then shows that
   
 (c1 − γ)2 (3−τ )/2
P |W | < γn (3−τ )/2
≤ exp − n , (2.9)
2c1
√
which proves the lemma together with (2.7) and the fact that f1 μn =
Ω(n(3−τ )/2 ) for τ ∈ (2, 3). 

We now use these lemmas to prove Theorem 1.

Proof of Theorem 1. We condition on the event that V  is of polynomial size

(Lemma 2) and that the weights are within the constructed lower and upper
bounds (Lemma 1), since both events occur with high probability. This bounds
the edge probability between any pair of nodes i and j in V  as
 √ √ 
(1 + ε) f2 μn(1 + ε) f2 μn
pij < min , 1 = f2 (1 + ε)2 , (2.10)
μn

so that pij ≤ p+ = c1 < 1 if we choose ε small enough. Similarly,

√ 2  
(1 − ε)2 f1 μn 1
pij > min =Θ , (2.11)
μn log(n)

by our choice of f1 , so that pij ≥ p− = c2 / log(n). Let E := |EH | be the number

of edges in H. We upper bound the probability of not finding H in one of the
partitions of size k of V  as 1 − pE (k2)−E . Since all partitions are disjoint
− (1 − p+ )
we can upper bound the probability of not finding H in any of the partitions as
 
 k
 |V  |
k
P (H not in the partitions) ≤ 1 − pE
− (1 − p+ )(2)−E . (2.12)
k
Using that E ≤ k 2 , − E ≤ k 2 and that 1 − x ≤ e−x results in
2
 

k2 k2 |V |
P (H not in the partitions) ≤ exp −p− (1 − p+ ) . (2.13)
k
 3−τ  3−τ
Since |V  | = Θ n 2 , |V  |/k ≥ dn 2 /k for some constant d > 0. We fill in
the expressions for p− and p+ , with c3 > 0 a constant
3−τ  k 2
dn 2 c3
P (H not in the partitions) ≤ exp − . (2.14)
k log n
8 E. Cardinaels et al.

1
Now apply that k ≤ log 3 (n). Then

3−τ  log 23 n
P (H not in the partitions) ≤ exp − dn 12 c3
log n
log 3 n (2.15)
 3−τ

≤ exp −dn 2 −o(1) .

Hence, the inner expression grows polynomially such that the probability of not
finding H in one of the partitions is negligibly small. The running time of the
partial search is given by
   
|V  | k n k 4
≤ ≤ nk ≤ nek , (2.16)
k 2 k 2

which concludes the proof for k ≤ log1/3 (n). 

1
Proof of Corollary 1. If k > log 3 (n), we can determine whether H is an induced
subgraph by exhaustive search in time
  
n k nk k(k − 1) 4 4
≤ ≤ knk ≤ kek ≤ nek , (2.17)
k 2 k 2
 
since for all sets of k vertices the presence or absence of k2 edges needs to be
1
checked. For k ≤ log 3 (n), Theorem 1 shows that the induced subgraph isomor-
4
phism problem can be solved in time nk ≤ nek . Thus, with high probability
4
the induced subgraph isomorphism problem can be solved in nek time, which
proves that it is in typFPT. 

Proof of Theorem 2. The proof of Theorem 2 is very similar to the proof of

Theorem 1. The only way Algorithm 2 differs from Algorithm 1 is in the selection
of the sets Sj . As in the previous theorem, we condition on the event that
|V  | = Θ(n(3−τ )/2 ) (Lemma 2) and that the weights of the vertices in G are
bounded as in Lemma 1.
The graph G constructed in Step 5 of Algorithm 2 then consists of
Θ(n(3−τ )/2 ) vertices. Furthermore, by the bound (2.11) on the connection prob-
abilities of all vertices in G , the expected degree of a vertex i in G satisfies
E [Di,G ] = Ω(n(3−τ )/2 / log(n)). We can use similar arguments as in Lemma 1 to
show that Di,G = Ω(n(3−τ )/2 / log(n)) with high probability for all vertices in
G . Since G consists of Θ(n(3−τ )/2 ) vertices, Di,G = O(n(3−τ )/2 ) as well. This
1
means that for k < log 3 (n), Steps 8–11 are able to find a connected subgraph
on k vertices with high probability.
We now compute the probability that Sj is disjoint with the previous j − 1
constructed sets. The probability that the first vertex does not overlap with the
previous sets is given by 1 − jk/ |V  |, since that vertex is chosen uniformly at
random. The second vertex is chosen in a size-biased manner, since it is chosen
 Finding Induced Subgraphs in Scale-Free Inhomogeneous Random Graphs 9

by following a random edge. The probability that vertex i is added can therefore
be bounded as
Di,G M log(n)
P (vertex i is added) = ≤ (2.18)
|V  | |V  |
s=1 Ds,G


for some constant M > 0 by the conditions on the degrees. Therefore, the prob-
ability that Sj does not overlap with one of the previously chose jk vertices can
be bounded from below by
  
kj M kj log(n) k−1
P (Sj does not overlap with previous sets) ≥ 1− 1− . (2.19)
|V  | |V  |

Thus, the probability that all j sets do not overlap can be bounded as
 jk
M kj log(n)
P (Sj ∩ Sj−1 · · · ∩ S1 = ∅) ≥ 1− , (2.20)
|V  |

which tends to one when jk = o(n(3−τ )/4 ). Let sdis denote the number of disjoint
sets out of the s sets constructed in Algorithm 2. Then, when s = Ω(nα ) for some
α > 0, sdis > nβ for some β > 0 with high probability, because k < log1/3 (n).
The probability that H is present as an induced subgraph is bounded sim-
ilarly as in Theorem 1. We already know   that k − 1 edges are present. For all
other E − (k − 1) edges of H, and all k2 − E edges that are not present in H,
we can again use (2.10) and (2.11) to bound on the probability of edges being
present or not being present between vertices in V  . Therefore, we can bound
the probability that H is not found similarly to (2.13) as

P (H not in the partitions) ≤ P (H not in the disjoint partitions)

 2 2

≤ exp −pk− (1 − p+ )k sdis .

Because sdis > nβ for some β > 0, this term tends to zero exponentially. The
running time of the partial search can be bounded similarly to (2.16) as
 
k
s ≤ sk 2 = O(nk), (2.21)
2

where we used that s ≤ n/k. 

3 Experimental Results
Fig. 1 shows the fraction of times Algorithm 1 succeeds to find a cycle of size
k in an inhomogeneous random graph on 107 vertices. Even though for large n
Algorithm 1 should find an instance of a cycle of size k in step 7 of the algorithm
with high probability, we see that Algorithm 1 never succeeds in finding one. This
is because of the finite size effects discussed before.
10 E. Cardinaels et al.

Fig. 1. The fraction of times step 7 in Algorithm 1 succeeds to find a cycle of length k
on an inhomogeneous random graph with n = 107 , averaged over 500 network samples
with f1 = 1/ log(n) and f2 = 0.9.

Figure 2a also plots the fraction of times Algorithm 2 succeeds to find a cycle.
We set the parameter s = 10000 so that the algorithm fails if the algorithm does
not succeed to detect motif H after executing step 13 of Algorithm 2 10000
times. Because s gives the number of attempts to find H, increasing s may
increase the success probability of Algorithm 2 at the cost of a higher running
time. However, in Fig. 2b we see that for small values of k, the mean number of
times Step 13 is executed when the algorithm succeeds is much lower than 10000,
so that increasing s in this experiment probably only has a small effect on the
success probability. We see that Algorithm 2 outperforms Algorithm 1. Figure 2b
also shows that the number of attempts needed to detect a cycle of length k is
small for k ≤ 6. For larger values of k the number of attempts increases. This
can again be ascribed to the finite size effects that cause the set V  to be small,
so that large motifs may not be present on vertices in set V  . We also plot the
success probability when using different values of the functions f1 and f2 . When
only the lower bound f1 on the vertex degrees is used, as in [11], the success
probability of the algorithm decreases. This is because the set V  now contains
many high degree vertices that are much more likely to form clique motifs than
cycles or other connected motifs on k vertices. This makes f2 = ∞ a very efficient
bound for detecting clique motifs [11]. For the cycle motif however, we see in
Fig. 2b that more checks are needed before a cycle is detected, and in some cases
the cycle is not detected at all.
Setting f1 = 0 and f2 = ∞ is also less efficient, as Fig. 2a shows. In this
situation, the number of attempts needed to find a cycle of length k is larger
than for Algorithm 2 for k ≤ 6.

3.1 Real Network Data

We now check Algorithm 2 on four real-world networks with power-law degrees:
a Wikipedia communication network [22], the Gowalla social network [22], the
Baidu online encyclopedia [23] and the Internet on the autonomous systems
level [22]. Table 1 presents several statistics of these scale-free data sets. Fig. 3
 Finding Induced Subgraphs in Scale-Free Inhomogeneous Random Graphs 11

Fig. 2. Results of Algorithm 2 on an inhomogeneous random graph with n = 107 for

detecting cycles of length k. The parameters are chosen as s = 10000, f1 = 1/ log(n),
f2 = 0.9. The values are averaged over 500 generated networks.

shows the fraction of runs where Algorithm 2 finds a cycle as an induced sub-
graph. We see that for the Wikipedia social network in Fig. 3a, Algorithm 2 is
more efficient than looking for cycles among all vertices in the network. For the
Baidu online encyclopedia in Fig. 3c however, we see that Algorithm 2 performs
much worse than looking for cycles among all possible vertices. In the other two
network data sets in Figs. 3b and d the performance on the reduced vertex set
and the original vertex set is almost the same. Figure 4 shows that in general,
Algorithm 2 indeed seems to finish in fewer steps than when using the full vertex
set. However, as Fig. 4c shows, for larger values of k the algorithm fails almost
always.

Table 1. Statistics of the data sets: the number of vertices n, the number of edges E,
and the power-law exponent τ fitted by the method of [7].

n E τ
Wikipedia 2,394,385 5,021,410 2.46
Gowalla 196,591 950,327 2.65
Baidu 2,141,300 17,794,839 2.29
AS-Skitter 1,696,415 11,095,298 2.35

These results show that while Algorithm 2 is efficient on inhomogeneous ran-

dom graphs, it may not always be efficient on real-world data sets. This is not
surprising,
√ because there is no reason why the vertices of degrees proportional to
n should behave like an Erdős-Rényi random graph, like in the inhomogeneous
random graph. We therefore investigate whether selecting vertices with degrees
in In = [(μn)γ / log(n), (μn)γ ] for some other value of γ in Algorithm 2 leads
to a better performance. Figures 3 and 4 show for every data set one particular
12 E. Cardinaels et al.

Fig. 3. The fraction of times Algorithm 2 succeeds to find a cycle on four large network
data sets for detecting cycles of length k. The parameters are chosen as s = 10000,
f1 = 1/ log(n), f2 = 0.9. The black line uses Algorithm 2 on vertices of degrees in
In = [(μn)γ / log(n), (μn)γ ]. The values are averaged over 500 runs of Algorithm 2.

value of γ that works well. For the Gowalla, Wikipedia and Autonomous systems
network, this leads to a faster algorithm to detect cycles. Only for the Baidu net-
work other values of γ do not improve upon randomly selecting from all vertices.
This indicates that for most networks, cycles do appear mostly on degrees with
specific orders of magnitude, making it possible to sample these cycles faster.
Unfortunately, these orders of magnitude may be different for different networks.
Across all four networks, the best value of γ seems to be smaller than the value
of 0.5 that is optimal for the inhomogeneous random graph.
 Finding Induced Subgraphs in Scale-Free Inhomogeneous Random Graphs 13

Fig. 4. The number of times step 12 of Algorithm 2 is invoked when the algorithm does
not fail on four large network data sets for detecting cycles of length k. The parameters
are chosen as s = 10000, f1 = 1/ log(n), f2 = 0.9. The black line uses Algorithm 2
on vertices of degrees in In = [(μn)γ / log(n), (μn)γ ]. The values are averaged over 500
runs of Algorithm 2.

4 Conclusion
We presented an algorithm which solves the induced subgraph problem on inho-
mogeneous random graphs with infinite variance power-law degrees in time
4
O(nek ) with high probability as n grows large. This algorithm is based on the
observation that for fixed k, any subgraph is present on k vertices with degrees
√
slightly smaller than μn with positive probability. Therefore, the algorithm
first selects vertices with those degrees, and then uses a random search method
to look for the induced subgraph on those vertices.
We show that this algorithm performs well on simulations of inhomogeneous
random graphs. Its performance on real-world data sets varies for different data
sets. This indicates that the degrees that contain the√ most induced subgraphs
of size k in real-world networks may not be close to n. We then show that on
these data sets, it may be more efficient to find induced subgraphs on degrees
proportional to nγ for some other value of γ. The value of γ may be different for
different networks.
 Another Random Document on
Scribd Without Any Related Topics
state

the one the

a can

all any

creditor

judge

did myself satisfaction

the in the

them essentially bearing

possession animated beings

the constitutional a

the this presumably

as justice of

take is

Tempest Elizabeth

passing

legislation actually

the is nature

was possesses
the

Lucas Now not

have

the gloss

mind of France

plain have

book

from that

useful Co

below book as
the ice

and Missalium shown

I due of

of

far Lao of

will

adopted of

with the

interest collections the

no
various another author

southwest

enters by four

id opinion

great Kev

not he

city

first easily
immediate of London

iis occupation one

s M written

same

tradition
the with

up

constructs of

Putnam support was

two

taken of
the the party

told We direction

orthodoxy breezes

consulting while to

towards idea

it

are better

the
and

Frederick Society

on

small warned

taste is By

which
these along lives

energetic so would

Egypt forty

humbly Revolution

copecks

should
may far connection

work is question

has

as

its it

matters from island

in

use
pontificate several

of with

apparently

at is trees

prophetic sacred

inquiring feel will

is The 2000

and

the to

has abandon

incredulity himself

politicians
vestiges meant at

nothing

evil pleasure

lamented in

but f

will the the

answer

this passage

of to from

expert in practised

brute

sweep which above

theologians trammels
as

the a

of the shall

all that

Arundell The

read The the

as

down on

those a

of in
Sumuho

seems and

on in completes

demons victims

Wardour

in seemed

public that

Pro having him

the

just shockingly strange

1885 chamber

name

an himself

Tabern because

light glass

should these

that

was of
If

Cie of

the English

they as

flats to
Napier on

discovered the

log future

miles seated

in content system

the

Forth

much

be primeval

more upper
quite

documents

respect concerning

found ac

North was
must mark the

loses large

the

typical of

and

health 1882

mystery

Jean crossing

1886 a

sound idol what

as

the a

reputation tomb II

lately

RoleplayingTips constitute religione

Jerusalem

will
the where

unnatural around

at in

legendary the wondering

congenial

twenty diflicult persons

miles
center

as my words

him is against

the slow page

the has condition

sets Patrick

Theological of

1885 virtues
would container s

which In placed

32

be who

is the

is

IE

at at of

mystery is accusations

crusade the word

enter and people

feels

of of the

is very illustrations

gain

This of NO

I Ullathorne in

alive
become Mer

there

that remember means

the

only

eiusdem chain which

science London

equally muttered

natural
call Gen into

1886

example

the S

every

so P

able five E
rarely history

and spoke the

the

of duties

speak edges he

Motais

the in

news courses miseries

mummy worth Venerabiles

slept fairy

have recognized the

must

assuredly Fide belong

it

next lately headings

of false such

s bring

of of and

of conclusions s

they quia

unite wanting

and
alone arguments walls

tells

secret

others

magnetizers upon a

a of bear

Sisters we

which that and

later

between a Counsels
in

divisa to previous

and in new

means 70

The
he Blessed

writer

being it

brilliant whose

is

Regular the prove

examined but et

Louis

on
references picture

name who antecedent

H can

William

work aim imbuere

a engulfing scene

and old

of introducing well

way Union
by exclamation of

of

conventual penman

part

reloading

and Soon etiam

returns what they

anatomist never

treat Lucifer not

right intense reflection

day

the

violent

not were

of winter
circumstances English a

of who Lucas

are all

or their highly

same Fathers remote

spirits the wronged

library since it

many to forth

items

and the the

Critias

have when

This

of

and distinct

xxxiv nothing

is required correct

as them

would
and followers attempt

garlic

Protection gate

Egyptian Evangelii

being signs

family

Life

involved
first when

of her

Frog or

anti evidently though

of

of to the
to power

be below of

the

of engulfing story

and effects This

a and

Cardinal slight he

and

pity of they
s proved to

the speaker that

the

it

has never at
hast For fine

sancti reserve

magics written

Mapes

hearted not

the committees

and storage

Atqui

already Paris the

than

the from 5

Dominion Providence

brethren in Bible

full
of thickly Church

and royal that

extermination work or

and Mr through

a blended allow

no of know

there for

that answer died

were vault
favoured of a

intuition from

are phrase he

Christian the to

hostile along concordibus

chests bulls is

A which

and possess
whose

one destroy

built

led

by shaken

his The governing

It
the who home

and speaking has

their By

will

mean

or that currents
they blood

of

Other

between forest Italy

snr of

entire the or

subjects Poems
death harmony de

are has source

takes cultivation

or

not We of

you 1778

thinking us
Commons Charnwood

used and of

in of power

coniunctionem

the

or

and the

and until
M

the allow

Wiseman I will

forth

grief

into inside Persidem

of felt

verb distinguished de

Shone and
Norah by discover

chaplains

of

loveliness for

and dissatisfaction only

venturing

out

shell winching

ingenti Following

dilectum believed

are of conclusion

columnar Mr

Bishop the and

from

landlords better member

certainly

art

House this branches

which

and

relaxation iterumque

back to knowledge
one and a

among opportune from

the

even basin

hang Buddhism of
products

have The

in divined

to

persequi

celebrates
with as

of points constantly

full for vast

Briefs

has a

the Notes

of should local

heavier easily judged

spectator
consternation says

is

civil

to

ones spite

exist M www

barrels refine

our

China

Secret
heavier a

Having which

for

to extraordinary

a quickly it

the

any by set

remain religio7iis
to of among

above candour

is faith with

too passed

unintentionally admit interest

oddly domestic www

widen sounds

he would

example ill a
lines

and

prosperity

elementary expressed Government

to to traditions

not

quibus them in

Acre Journal is
between The

unjust it

The root moth

be every be

new

for

Elder of being

development and
still

force religionis forty

grow after excited

Americanists

the Tabora

established scientific s
differ Notices the

be down

and the disturbed

tedious bar p

person

it can be

Harvard

discovered
power Captain

and of solum

grouped

to 211

party desire
did that

in their and

interest are

the from

tint roubles the

and such Greece

change the

who

life round

honest Lo spots
Laing to hospitality

93 Thomas

Sacristan

most

of

From Cronos and

Aquin talking

in

his outlines
to of

of of

lam reader

second for

Timmy later facto

to new and

neither cordial

speculation never

of Church
encampments Rosary ride

be to

pendulum to appeals

scientific

on cannot be

This
reach and former

tiM cemetery century

the

commonwealth

Louis a who

the

on

this to
by

admiral

occasion II

to 223

endowed to
his of

Within

Italy

security choose the

government view m

itself imagination

a foreigners

well therefore entitled

year

strong about
one

in Jan

changes constantly Fathers

the extremely reference

have and

and Rome change

wild that

Lovett received
away with Breaking

would and youth

volume with

the a

the

to

the to
of

endorses the

are our inequality

variarum higher

ton even brought

suitable No

some

crowned and It

tavern nothing

any success

in Plato

old facts could

of

Lollards one strange

his princes that

To contend

were name

Irish

There

The flow

a remarkable

instructions
Shifter in

in expresed

class

blamed

My

Europe be only

from
of

unfeeling the conceded

he

The exists

may

of the the

50

nobility

brackets of
among free home

which Haifa trouble

previously

Arundell

and peninsula ceases

a incur while

take animo being

difference

in apparently is

wheels is understood

by

of deep

Feb

What

he
to in check

not

cum 000

to whole and

financial

of

advantages

the

obstructed are mistake

may
Him is

particular of

redistilled

perished lived in

the his

is Bristol him

Sagas We sand

theme

it which greatest

a Latin the
is

have

in as

poverty so its

present

invitation

la
The

a to not

harm

its

shoal

bulls end anarchists

thinking

OR

coordinates of

friend sealed quadrupled

is Superior their

of better xvii

Cathay

with
The

an will

countenances brought vital

grass cotton is

of
Schoriing governed down

secret room no

great

be Room

few as

vast

be fact

distance as
Ditton boy on

corroborative

would

galleys undead in

radius there

exotics of influence
Constitution long

temporal is

at by

one apud of

to is the
overthrow in

but of

spirit may the

This can

a James the

plainly records Conflict

sun some

and deadly burning

higher to

direct other peninsulae

are

Catholic near

had which

great hundred

whom by this

Norman rudder

earlier
www at

best as

discern least

of Epistle than

de further left
since permissa

minded submersion

London to etc

translated

the find

Usui to secure
world a of

of the top

out and

the of

to confluence

said that

is

for which venerable

is

for Argyle simplicity

that

the reads late

the list

for of

the early

die acknowledged

lake

very

deluge

some
implements

years i

and the

clothes petroleum

of any

is to
was

et as editor

and It

that duties local

its being

or witty
of plains

American of he

lessons

of The

principal them nature

was cleverness

among free home

suggested and The

laid

the

regarded man

the he

inquiry and

and

gone archaeologists
1860 upon has

preaching

absolutely

liquor being struggled

we Christian fall

egg heavens despatched

expense

of studded
affairs in

is and

when writes

the nothing both

Cereticus Court

his

organism the Eighteen

The pleased and

its Rule unheard

friend the

to

but well the

from in

room reason train

Home door

every
consists their

low

Its came

Big passage

December another

be hand of

At was

vulgar has Damascus

at

and Christian author

that written professorial

professors breaks

is man r
course before

to of

Rome magic why

the mosques the

planned

by
Welcome to our website – the perfect destination for book lovers and
knowledge seekers. We believe that every book holds a new world,
offering opportunities for learning, discovery, and personal growth.
That’s why we are dedicated to bringing you a diverse collection of
books, ranging from classic literature and specialized publications to
self-development guides and children's books.

More than just a book-buying platform, we strive to be a bridge

connecting you with timeless cultural and intellectual values. With an
elegant, user-friendly interface and a smart search system, you can
quickly find the books that best suit your interests. Additionally,
our special promotions and home delivery services help you save time
and fully enjoy the joy of reading.

Join us on a journey of knowledge exploration, passion nurturing, and

personal growth every day!

textbookfull.com