Start free trial
Trending New Genres Authors
EnglishEnglish
EspañolSpanish
简体中文Chinese
繁體中文Chinese (Traditional)
FrançaisFrench
DeutschGerman
日本語Japanese
PortuguêsPortuguese
ItalianoItalian
한국어Korean
РусскийRussian
NederlandsDutch
العربيةArabic
PolskiPolish
हिन्दीHindi
Tiếng ViệtVietnamese
SvenskaSwedish
ΕλληνικάGreek
TürkçeTurkish
ไทยThai
ČeštinaCzech
RomânăRomanian
MagyarHungarian
УкраїнськаUkrainian
IndonesiaIndonesian
DanskDanish
SuomiFinnish
БългарскиBulgarian
עבריתHebrew
NorskNorwegian
HrvatskiCroatian
CatalàCatalan
SlovenčinaSlovak
LietuviųLithuanian
SlovenščinaSlovenian
СрпскиSerbian
EestiEstonian
LatviešuLatvian
فارسیPersian
മലയാളംMalayalam
தமிழ்Tamil
اردوUrdu
Searching...
SoBrief
Linked

Linked

The New Science Of Networks
Why do a few nodes dominate networks, making whole systems both resilient and vulnerable?
by Albert-László Barabási 2002 288 pages
3.94
5k+ ratings
Listen
Immersive
V2.3
Amazon Kindle Audible
Try Full Access for 3 Days
Unlock listening & more!
Continue

Key Takeaways

Look beyond the pieces. Albert-László Barabási opens with two unlikely figures: Paul, who helped Christianity reach distant communities, and MafiaBoy, the teenager whose computer attack overwhelmed major websites. Their aims differed radically, but both relied on networks that let actions travel far beyond their starting points. The book’s central claim is that systems cannot be understood by studying their components alone. Their connections shape what they can do.

A network, or graph, is a set of nodes connected by links. The nodes might be people, websites, molecules, or companies; the links might represent friendships, hyperlinks, chemical reactions, or business ties. Mapping those relationships reveals shared patterns that separate disciplines often overlook.

Analysis

The useful shift is from asking only what a component is to asking what it can reach, influence, or depend on. That perspective can expose risks hidden by component-by-component analysis, such as a medicine affecting many connected processes or a supplier failure disrupting an entire production chain. A map, however, is not yet an explanation. The same diagram can represent relationships with very different strengths, meanings, and rules. Network thinking is most powerful when it identifies structure without pretending that structure alone explains every outcome.

Structure sets limits. In the eighteenth century, residents of Königsberg wondered whether they could cross each of the city’s seven bridges exactly once. Leonhard Euler represented the four land areas as nodes and the bridges as links. He showed that the route was impossible because all four nodes had an odd number of links, while such a route could have at most two odd-link endpoints.

The point was not simply that Euler solved a puzzle. The layout itself made the route impossible, regardless of anyone’s ingenuity. When a new bridge was built, the network changed, and the route became possible. This illustrates a central principle: a small change in network structure can remove a constraint or create a new path.

Analysis

Euler’s abstraction remains a powerful diagnostic habit: translate a messy situation into entities and relationships, then ask which outcomes the structure permits. The same logic appears in transportation planning, software design, and institutional rules. A new connection can unlock access, but it can also create a new route for disruption. The bridge story also marks a limit of the model. It captures whether a route exists, not whether people can afford to use it, whether it is safe, or whether anyone knows it is there.

Use weak ties as bridges beyond your familiar circle

Acquaintances carry fresh information. Sociologist Mark Granovetter found that people often learned about jobs through acquaintances rather than close friends. In his study of managerial workers, weak ties were cited more often than strong ties as the route to a job, 27.8 percent compared with 16.7 percent. Close friends tend to share the same circles and information; acquaintances connect different circles.

This clustered structure can still produce a small world, meaning a network with surprisingly short routes between far-apart nodes. Stanley Milgram’s letter experiment found a median of 5.5 intermediaries among completed chains. Barabási’s team estimated that the Web’s average separation was about nineteen clicks. Duncan Watts and Steven Strogatz showed how a few long-range links can sharply shorten paths without destroying local clusters.

Analysis

The practical lesson is not to collect contacts indiscriminately, but to maintain relationships across different settings. A bridge is valuable because it reaches information that a tightly knit group may not encounter. Still, a short route is not the same as a usable one. Milgram’s result came from chains that arrived, while many letters did not; social class and geography can also make some connections harder to activate. Network distance describes possibility, not equal access, trust, or willingness to help.

Expect a few hubs to command most network visibility

Popularity is highly uneven. A power law describes a distribution with many small values and a few unusually large ones. In networks, it can describe how many links each node has. Unlike a bell curve, it allows extreme hubs: a small number of nodes with vastly more connections than typical nodes. Barabási called networks with this pattern scale-free because they lack one characteristic or average-sized node that represents the whole system.

The Web offered a striking example. In one sample of 203 million pages, about 90 percent had ten or fewer incoming links, while a few pages approached a million. The familiar 80/20 rule is a rough way to express such concentration: in the book’s examples, 80 percent of Web links pointed to about 15 percent of pages. Publishing is easy; being found is not.

Analysis

A hub is not merely popular. It can shape what information travels, which businesses get attention, and which parts of a system remain connected. That makes concentration a question of power as well as mathematics. Yet a power law should be tested, not assumed whenever a distribution looks uneven. Sampling gaps, changing definitions of a link, and the age of a dataset can alter the apparent pattern. The book’s core insight survives that caution: averages can conceal the few connections that matter disproportionately.

Model growth, because popularity can attract more popularity

Networks are made over time. Many older models began with a fixed set of nodes and connected them randomly. Real networks often grow: websites appear, new actors enter film, and new companies join industries. Growth alone gives early arrivals more time to collect links, but Barabási and Réka Albert found that it does not create the observed hubs by itself.

Their scale-free model adds preferential attachment: new nodes are more likely to link to nodes that already have many links. A new website is more likely to point to a familiar, popular site than to an obscure one. The combination of growth and this popularity bias produces a hierarchy of hubs and a power-law distribution. It also explains how advantage can compound without anyone centrally planning the result.

Analysis

This is a model of path dependence: early advantages can shape later opportunities because subsequent choices respond to the current state. The idea helps explain why visibility, citations, and commercial reach can accumulate around established winners. It also cautions against treating success as a pure measure of quality. A node may gain links because it is already easy to find, not because it is objectively best. The model clarifies one mechanism, but real networks also have links removed, nodes that age, and new connections between existing nodes.

Let fitness challenge incumbency, but watch for winner-takes-all

Not every node is equal. Growth and preferential attachment give early nodes an advantage, but they do not explain why a late arrival can overtake established competitors. Barabási and Ginestra Bianconi introduced fitness, a node’s relative ability to attract links. Google entered the search market after AltaVista and Inktomi, yet its usefulness helped it gain attention rapidly. In this model, popularity matters, but so does the node’s intrinsic appeal.

The authors distinguish a fit-get-rich pattern, where several leading nodes share a hierarchy, from winner-takes-all behavior, where one node captures nearly every link. They connect the latter mathematically to Bose-Einstein condensation. Microsoft’s overwhelming share of the operating-system market, reported in the book’s period, illustrates the star-like winner-takes-all case, rather than a balanced hierarchy of competitors.

Analysis

Fitness makes the model more realistic by allowing newcomers to compete on something besides age and accumulated connections. It also raises a measurement problem: usefulness, talent, and quality are difficult to reduce to one comparable score. A company may be attractive to users while also benefiting from compatibility, switching costs, or access to distribution. Those forces are not interchangeable. The distinction between a crowded hierarchy and a single dominant winner is valuable because it prevents every successful hub from being mistaken for a monopoly.

Design for random failures, and defend against targeted attacks

Resilience has a weak point. In simulations described in the book, a scale-free Internet map remained connected after as many as 80 percent of its nodes were removed at random. Most nodes had few links, so random failures usually damaged peripheral parts; the remaining hubs could keep the network together. This is topological robustness, resilience that comes from the network’s structure.

The same structure creates vulnerability. Removing hubs deliberately had a very different effect: after enough of the largest nodes were lost, the network fragmented. The book also distinguishes this structural failure from cascading failure, in which one breakdown shifts work or traffic onto other components until they fail too. The 1996 western power blackout began with a sagging line and spread through overloaded neighboring lines and generators.

Analysis

Reliability planning should consider both what fails by chance and what an adversary would choose to target. A system that tolerates many peripheral outages may still depend heavily on a few central nodes. The lesson is not simply to eliminate hubs, since hubs often make a network efficient and connected. It is to understand their dependencies, build alternatives, and monitor load transfers. Topology also cannot predict every outage on its own: capacity, control systems, human decisions, and the timing of failures shape whether disruption becomes a cascade.

Track network structure before predicting what will spread

Spread depends on connections. Traditional threshold models say an innovation or infection takes hold only if its contagiousness exceeds a critical level. Barabási describes how scale-free networks can disrupt that expectation: highly connected hubs give even a weakly contagious virus routes to persist and spread. The Love Bug computer virus, sent through infected users’ address books, reached millions of computers and showed how ordinary social links can carry rapid contagion.

The same network logic can help explain why new products spread. In a study of doctors adopting tetracycline, physicians named by at least three colleagues as friends were three times as likely to adopt the drug as those named by nobody. Hubs can carry an innovation into many circles. But the author’s proposed strategy of prioritizing highly connected people for limited treatment raises difficult questions of fairness and consent.

Analysis

The key improvement is to model the route of transmission, not just the strength of the infection or idea. A virus passed through email contacts, a disease passed through intimate relationships, and a product passed through recommendations travel on different networks. Treating them as interchangeable can produce bad forecasts. Hub-focused prevention may be efficient, but it should not turn people into instruments of public health or reward access to already privileged groups. Good intervention combines network evidence with the specific biology, behavior, and ethics of the case.

A short path does not guarantee access or equal voice

The Web is not one open space. Because hyperlinks point in particular directions, a large Web study found four broad regions: a central core, pages that can lead into the core, pages reachable from it but not back, and disconnected tendrils or islands. The study’s sample covered about 200 million pages. The book estimates that starting from a given page, only about 24 percent of all pages could be reached by following links.

Search engines also missed much of the Web in the period studied. In 1999, the leading engines collectively covered about 40 percent of an estimated 800 million pages. Online visibility was unequal too: most political sites in one survey linked to like-minded pages, while only about 15 percent linked to opposing views. A small-world network can therefore be difficult to navigate and socially fragmented.

Analysis

This distinction separates distance from discoverability. A destination may be only a few links away in theory, yet remain invisible if links point elsewhere or search tools never index it. The Web’s structure can reinforce attention to already prominent sources, but visibility is also shaped by ranking systems, commercial incentives, and users’ choices. The historical figures in the book describe the Web around 1999 and 2000, not today’s platform landscape. Their enduring use is conceptual: connectivity does not guarantee exposure, diversity, or a fair hearing.

Map modules as well as hubs to explain living systems

Hubs do not explain everything. The human genome project identified DNA sequences, but a list of genes did not explain how a cell functions. The book argues that genes, proteins, and molecules must be studied as interacting networks. In yeast, researchers found that removing genes associated with highly connected proteins was lethal in 60 to 70 percent of cases, compared with fewer than 20 percent for weakly connected proteins. A prominent component such as p53 can matter because of the wider network around it.

The book’s afterword adds hierarchical modularity: networks contain tightly connected groups that combine into larger, looser groups. Modules let parts perform specialized tasks, while hubs connect those parts. This architecture appears in cellular metabolism and other networks. A map of connections is only a beginning; understanding life also requires tracing what happens along those links.

Analysis

Modularity helps reconcile local specialization with global coordination. It offers a way to study a cell without pretending that every molecule interacts with every other one, while still accounting for bridges between functions. The same logic applies to organizations and technologies: modules make changes more contained, but their links can transmit effects across the system. Biological network maps also require caution. Experimental interaction data can contain missing or spurious connections, and a highly connected protein is not automatically a useful drug target. Structure guides questions; experiments test answers.

Use network structures for flexibility, but account for interdependence

Business runs through relationships. Barabási contrasts the traditional corporate tree, designed for control and repeated tasks, with flatter networks of teams, partners, and suppliers. Interlocked company boards form small worlds: the book describes Vernon Jordan as a director on ten boards and within roughly three handshakes of most directors in the major corporate cluster. Such ties can circulate experience and open doors, but they also concentrate influence.

The network economy creates shared risk. Outsourcing helped companies such as Cisco and Compaq scale without building every product themselves, yet supply disruptions left Compaq with hundreds of thousands of unfilled orders and Cisco with excess inventory. A network is not a magic business plan. Its value depends on managing partners, dependencies, and the consequences of one firm’s choices for others.

Analysis

Networks can make an organization more adaptable by connecting people who hold different expertise, but flexibility is not free. More partnerships mean more dependencies, coordination demands, and routes for a local mistake to spread. Hierarchies remain useful when accountability and routine execution matter; networks excel when learning and cross-functional collaboration matter. The strongest design is often not a total conversion from one form to the other, but a deliberate match between structure and task. The book’s economic cases make connectedness a management responsibility, not just a metaphor.

Analysis

The book’s most enduring contribution is a change in the unit of explanation. Instead of treating a person, gene, website, or firm as the whole story, it asks how position and connection shape outcomes. Euler’s bridge puzzle supplies the cleanest demonstration: structure can rule out a possibility before anyone attempts it. The later examples make that insight consequential, showing how hubs can accelerate diffusion, stabilize a network against random loss, and expose it to targeted attack.

The narrative is also a history of scientific model correction. Random graphs offered a mathematically tractable baseline; clustering and hubs revealed where that baseline failed; growth, preferential attachment, and fitness supplied mechanisms. This sequence is valuable because it presents models as provisional instruments, not miniature copies of reality. Yet the book’s wide reach creates a risk of over-unification. A hyperlink, a friendship, and a chemical reaction can all be drawn as edges, but they differ in direction, strength, duration, and meaning. A common diagram does not prove that the same causal law governs each system.

That distinction matters most in applications. Network topology can identify plausible leverage points, but prediction also requires dynamics: how traffic moves, how people choose, how a pathogen transmits, or how a cell responds. The book recognizes this boundary in its closing argument that a network is a skeleton, not the living process. Its most responsible practical use is therefore to generate sharper questions: Which nodes bridge otherwise separate groups? Which failures can cascade? Which connections are missing from the map? Who benefits from the hubs, and who is rendered invisible?

The historical examples should be read as evidence for a research program, not a claim that every complex system is scale-free. The deeper lesson is methodological: map relationships, test the architecture against data, and then study behavior on the network. That combination turns connectedness from a fashionable metaphor into an explanatory tool.

Summary in 30 Seconds
Connections shape what people, genes, websites, and companies can do. Networks often concentrate links in a few hubs: in one Web sample, about 90 percent of pages had ten or fewer incoming links. New arrivals tend to connect to already popular nodes, while useful newcomers can still overtake incumbents. Hubs help networks withstand random losses but make them vulnerable to targeted attacks. Weak ties bridge social circles, and network structure influences how information, innovations, and failures spread.
Contains spoilers

Last updated:

Report Issue

Review Summary

3.94 out of 5
Average of 5k+ ratings from Goodreads and Amazon.

Linked explores network theory and its applications across various fields. Readers appreciate Barabási's clear explanations of complex concepts, though some find it repetitive or outdated. The book discusses power laws, hubs, and scale-free networks, revealing how these structures appear in diverse systems from biology to economics. While praised for its accessibility and breadth, critics note its occasional oversimplification and dated examples. Overall, it's considered an engaging introduction to network science, offering insights into the interconnected nature of our world.

Your rating:
4.44
169 ratings
Want to read the full book?

Glossary

Graph

nodes joined by links

A graph is a representation of entities as nodes and relationships between them as links. In the book, the entities can be land areas, people, websites, molecules, or companies. The abstraction allows systems with very different contents to be compared by examining their patterns of connection.

Giant component

the network's largest connected cluster

A giant component is a cluster containing a large fraction of a network’s nodes, with a path connecting its members. In the random-network example, it appears once enough links have been added. Its emergence marks a change from scattered groups to a broadly connected network.

Clustering coefficient

how interconnected neighbors are

The clustering coefficient measures how many links exist among a node’s neighbors compared with how many could exist. A high value indicates that neighbors tend to know or connect to one another, as in close-knit friendship circles. It helps distinguish clustered real networks from many random-network models.

Small-world network

clusters joined by short paths

A small-world network combines substantial local clustering with short paths between distant nodes. The book explains how a small number of long-range links can connect otherwise separate circles, sharply reducing distances without erasing local group structure. The term concerns network structure, not how easy a destination is to find.

Scale-free network

a network with a power-law degree distribution

A scale-free network has a degree distribution described approximately by a power law: many nodes have few links, while a small number have exceptionally many. These hubs create a hierarchy without a single characteristic degree. The book links this structure to network growth and preferential attachment.

Preferential attachment

new links favor connected nodes

Preferential attachment is a process in which a new node is more likely to connect to nodes that already have many links. Combined with ongoing network growth, this gives established nodes an advantage and can generate hubs and power-law degree distributions. The mechanism describes a statistical tendency, not a conscious decision by every participant.

Fitness

a node's relative link-attracting ability

Fitness represents a node’s intrinsic ability to attract links relative to other nodes in a competitive network. In the book’s model, attractiveness depends on both fitness and accumulated connections. This allows late-arriving but highly appealing nodes, such as Google in the account, to overtake older competitors.

Threshold model

a model of adoption or contagion

A threshold model assigns individuals different levels of willingness to adopt an innovation or become involved in collective behavior. A process spreads when its transmission rate exceeds a critical level determined partly by network structure. The book contrasts this conventional prediction with cases where hubs let contagion persist at very low transmission rates.

Topological robustness

resilience created by network structure

Topological robustness is a network’s ability to remain connected after random node failures, arising from its structure. In a hub-dominated network, random failures tend to remove the numerous small nodes, while remaining hubs preserve connectivity. The same structure can make the network fragile when hubs are deliberately targeted.

Bow-tie structure

four regions in a directed network

The bow-tie structure describes how a large directed network can divide into a central core, an IN region that can lead to the core, an OUT region reachable from the core, and tendrils or islands that connect incompletely or not at all. The book uses this structure to explain why the Web is not uniformly navigable.

Hierarchical modularity

nested groups connected across levels

Hierarchical modularity is an organization in which tightly linked small groups combine into larger, less tightly linked groups. Hubs help connect modules of different sizes. The book presents this structure as a way complex systems can support specialized functions while preserving communication among them.

FAQ

What's Linked: The New Science of Networks about?

  • Exploration of networks: The book delves into the science of networks, explaining their structure, dynamics, and significance across various fields like biology, sociology, and technology.
  • Interconnectedness of systems: Barabási emphasizes the interconnected nature of systems, echoing Borges' idea that "everything touches everything."
  • Emergence of patterns: It discusses how complex networks exhibit patterns and laws similar to those in physics, which can be applied to understand real-world phenomena.

Why should I read Linked: The New Science of Networks?

  • Broad applications: The insights have implications across disciplines such as medicine, ecology, and economics, making it relevant for a wide audience.
  • Accessible writing: Barabási presents complex ideas in an engaging and understandable manner, suitable for both laypersons and academics.
  • Intellectual detective story: The book is described as an intriguing read for those interested in uncovering the mysteries of networks.

What are the key takeaways of Linked: The New Science of Networks?

  • Understanding network dynamics: Readers learn how networks emerge, evolve, and the fundamental laws governing their structure, like the 80/20 rule and preferential attachment.
  • Importance of hubs: The book highlights the role of hubs in networks, explaining their dominance in connectivity and influence on the entire system.
  • Vulnerability and robustness: It discusses networks' robustness against random failures but vulnerability to targeted attacks.

What is the 80/20 rule in Linked: The New Science of Networks?

  • Pareto principle: The 80/20 rule states that a small percentage of causes (20%) often lead to a large percentage of effects (80%).
  • Application in networks: Barabási illustrates that a significant portion of links on the Web point to a small percentage of Webpages, showing uneven distribution.
  • Implications for systems: This principle helps explain why certain nodes (hubs) in networks are disproportionately influential.

How does Linked: The New Science of Networks explain the concept of hubs?

  • Central role of hubs: Hubs are nodes with significantly more connections, crucial for the network's integrity and functionality.
  • Rich-get-richer phenomenon: Hubs emerge through preferential attachment, where new nodes connect to already well-connected nodes.
  • Impact on dynamics: Hubs influence network behavior, leading to power laws in connectivity distributions.

What is the rich-get-richer phenomenon in Linked: The New Science of Networks?

  • Definition: This phenomenon describes how nodes with many connections are more likely to attract even more connections over time.
  • Implications for dynamics: It explains why some individuals or entities become central figures in networks, creating a feedback loop that reinforces inequalities.
  • Real-world examples: Barabási uses examples like popular websites gaining more links and influential individuals attracting more followers.

How does Linked: The New Science of Networks explain the concept of scale-free networks?

  • Characteristics: Scale-free networks have a power law degree distribution, with a few nodes having many connections and most having few.
  • Emergence of hubs: Hubs arise through preferential attachment, where new nodes connect to well-connected nodes, reflecting growth dynamics.
  • Examples: Barabási provides examples from the Internet, social networks, and biological systems to illustrate the model's applicability.

What role do hubs play in networks according to Linked: The New Science of Networks?

  • Central importance: Hubs are critical nodes with a high number of connections, influencing the network's structure and dynamics.
  • Impact on robustness: Hubs contribute to network robustness against random failures but make them vulnerable to targeted attacks.
  • Facilitators of communication: Hubs serve as key facilitators of information flow, essential in contexts like social networks and biological pathways.

How does Linked: The New Science of Networks address the vulnerability of networks?

  • Robustness vs. vulnerability: Networks are robust against random failures but vulnerable to targeted attacks on hubs.
  • Cascading failures: Removing key nodes can lead to cascading failures, breaking the network into isolated fragments.
  • Real-world examples: Barabási uses examples like the 1996 blackout to show how interconnected systems can fail dramatically.

What are the laws governing network formation discussed in Linked: The New Science of Networks?

  • Power laws: Many networks follow power laws, indicating a few nodes have a disproportionately high number of connections.
  • Preferential attachment: New nodes are more likely to connect to existing hubs, leading to scale-free networks.
  • Growth dynamics: Networks grow incrementally, with new nodes added over time, influencing their structure and connectivity.

What are the best quotes from Linked: The New Science of Networks and what do they mean?

  • “Everything touches everything.” This quote by Borges encapsulates the interconnectedness of all systems, a central theme of the book.
  • “The construction and structure of graphs or networks is the key to understanding the complex world around us.” Highlights the importance of network topology in analyzing real-world phenomena.
  • “The rich get richer.” Summarizes the preferential attachment principle, illustrating how well-connected nodes gain more connections over time.

How does Linked: The New Science of Networks relate network theory to real-world phenomena?

  • Interconnectedness of systems: Network theory explains phenomena like disease spread and social interactions, providing insights into complex systems.
  • Applications across disciplines: Barabási shows network theory's applicability in fields like biology, sociology, and economics.
  • Framework for analysis: Applying network theory helps develop models to predict outcomes and inform decision-making in various domains.

About the Author

Albert-László Barabási is a renowned physicist and network science pioneer. Born in Transylvania, he earned his Ph.D. at Boston University. Barabási's groundbreaking work on scale-free networks and the Barabási-Albert model revolutionized our understanding of complex systems. He holds prestigious positions at Northeastern University and Harvard Medical School, directing the Center for Complex Network Research. Barabási has authored six books and received numerous accolades, including the FEBS Anniversary Prize and the Lagrange Prize. He is a fellow of multiple scientific academies and has made significant contributions to fields ranging from physics to medicine.

Download PDF

To save this Linked summary for later, download the free PDF. You can print it out, or read offline at your convenience.
Download PDF
File size: 0.42 MB     Pages: 22

Download EPUB

To read this Linked summary on your e-reader device or app, download the free EPUB. The .epub digital book format is ideal for reading ebooks on phones, tablets, and e-readers.
Download EPUB
File size: 1.43 MB     Pages: 27
Want to read the full book?
Follow
Listen2 mins
Home
Swipe
Library
Get App
Try Full Access for 3 Days
Listen, bookmark, and more
Compare Features Free Pro
📖 Read Summaries
Read unlimited summaries. Free users get 3 per month
🎧 Listen to Summaries
Listen to unlimited summaries in 40 languages
—
❤️ Unlimited Bookmarks
Free users are limited to 4
—
📜 Unlimited History
Free users are limited to 4
—
📥 Unlimited Downloads
Free users are limited to 1
—
Risk-Free Timeline
Today: Get Instant Access
Listen to full summaries of 26,000+ books. That's 12,000+ hours of audio!
Day 2: Trial Reminder
We'll send you a notification that your trial is ending soon.
Day 3: Your subscription begins
You'll be charged on Nov 24,
cancel anytime before.
Consume 2.8× More Books
2.8× more books Listening Reading
Our users love us
1M+ readers
Trustpilot Rating
TrustPilot
4.6 Excellent
This site is a total game-changer. I've been flying through book summaries like never before. Highly, highly recommend.
— Dave G
Worth my money and time, and really well made. I've never seen this quality of summaries on other websites. Very helpful!
— Em
Highly recommended!! Fantastic service. Perfect for those that want a little more than a teaser but not all the intricate details of a full audio book.
— Greg M
Save 62%
Yearly
$119.88 $44.99/year/yr
$3.75/mo
Monthly
$9.99/mo
Start a 3-Day Free Trial
3 days free, then $44.99/year. Cancel anytime.
Unlock a world of fiction & nonfiction books
26,000+ books for the price of 2 books
Read any book in 10 minutes
Discover new books like Tinder
Request any book if it's not summarized
Read more books than anyone you know
#1 app for book lovers
Lifelike & immersive summaries
30-day money-back guarantee
Download summaries in EPUBs or PDFs
Cancel anytime in a few clicks

Why one summary?

Scanner
Find a barcode to scan

⭐
⭐
⭐
We have a special gift for you
Open
38% off
DISCOUNT FOR YOU
⭐
⭐
⭐
$79.99
$49.99/year
Only $4.16 per month
Continue
2 taps to start, super easy to cancel
Settings
General
Widget
Loading...