Pith. Sign in

RECORD

Oscillations of simple networks

Physics and Society · Submitted 14 Sep 2011

abstract compiled · 2026-09-23 · no language-model review

The authors' main claim Forcing the network at a resonant frequency reveals that damping can be ineffective if applied to the wrong node, leading to a disastrous resonance and destruction of the network.

how it is stated · asserted 0.91 read the record →

Comment (0) Read on arXiv ↗
Cite ▾
arXiv ID1109.3071 (version 2)
Pith IDBCOZQAAP, Pith's permanent record of this paper and its review
CitationArnaud Knippel, Elie Simo, Jean-Guy Caputo. "Oscillations of simple networks." arXiv:1109.3071 (2011). https://pith.science/paper/BCOZQAAP
Claim paper

The compiled record

The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.

Open the compiled record

Compiled by classifier-1.13-20260917 via OpenRouter, question bank abstract-p1-20260923, 2026-09-23: 1 request, 6,159 input tokens, $0.0003 reported.

What the abstract itself states, as probabilities: claims first 0.04 · states limitation 0.64 · human participants 0.01 · controlled comparison 0.03 · randomized assignment 0.01 · states quantitative result 0.13 · compares with prior results 0.05 · mentions code or data availability 0.02.

The abstract, sentence by sentence

arXiv listing abstract v2. Results and the main claim are underlined; .

To describe the flow of a miscible quantity on a network, we introduce the graph wave equation where the standard continuous Laplacian is replaced by the graph Laplacian. This is a natural description of an array of inductances and capacities, of fluid flow in a network of ducts and of a system of masses and springs. The structure of the graph influences strongly the dynamics which is naturally described using the basis of the eigenvectors. In particular, we show that if two outer nodes are connected to a common third node with the same coupling, then this coupling is an eigenvalue of the Laplacian. Assuming the graph is forced and damped at specific nodes, we derive the amplitude equations. These are analyzed for two simple non trivial networks: a tree and a graph with a cycle. Forcing the network at a resonant frequency reveals that damping can be ineffective if applied to the wrong node, leading to a disastrous resonance and destruction of the network. These results could be useful for complex physical networks and engineering networks like power grids.

background contribution method result interpretation main claim

What the classifier reports for each sentence. The number is the probability it gave the label.
#sentencerolethe authors' own workstates the main conclusionstrength
s0 To describe the flow of a miscible quantity on a network, we introduce the graph wave equation where the standard continuous Laplacian is replaced by the graph Laplacian. method 0.54 0.86 0.05 asserted 0.99
s1 This is a natural description of an array of inductances and capacities, of fluid flow in a network of ducts and of a system of masses and springs. background 0.39 0.16 0.03 asserted 0.99
s2 The structure of the graph influences strongly the dynamics which is naturally described using the basis of the eigenvectors. interpretation 0.39 0.39 0.12 asserted 1.00
s3 In particular, we show that if two outer nodes are connected to a common third node with the same coupling, then this coupling is an eigenvalue of the Laplacian. result 0.99 0.91 0.10 asserted 1.00
s4 Assuming the graph is forced and damped at specific nodes, we derive the amplitude equations. method 0.88 0.94 0.03 asserted 1.00
s5 These are analyzed for two simple non trivial networks: a tree and a graph with a cycle. contribution 0.58 0.91 0.05 asserted 0.91
s6 Forcing the network at a resonant frequency reveals that damping can be ineffective if applied to the wrong node, leading to a disastrous resonance and destruction of the network. result 0.95 0.88 0.53 asserted 0.91
s7 These results could be useful for complex physical networks and engineering networks like power grids. interpretation 0.83 0.16 0.11 hedged possibility 1.00

What kind of paper the classifier reports this is: theoretical result 0.96 · evidence from proof or derivation 1.00.

What was examined, and what was not

sources read
  • arXiv listing abstract v2
not examined
  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers
levels run
  • P abstract
not run
  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. Every number in the measurements table is the authors', checked by code. Record as JSON

The paper
Original abstract

To describe the flow of a miscible quantity on a network, we introduce the graph wave equation where the standard continuous Laplacian is replaced by the graph Laplacian. This is a natural description of an array of inductances and capacities, of fluid flow in a network of ducts and of a system of masses and springs. The structure of the graph influences strongly the dynamics which is naturally described using the basis of the eigenvectors. In particular, we show that if two outer nodes are connected to a common third node with the same coupling, then this coupling is an eigenvalue of the Laplacian. Assuming the graph is forced and damped at specific nodes, we derive the amplitude equations. These are analyzed for two simple non trivial networks: a tree and a graph with a cycle. Forcing the network at a resonant frequency reveals that damping can be ineffective if applied to the wrong node, leading to a disastrous resonance and destruction of the network. These results could be useful for complex physical networks and engineering networks like power grids.

Human review
How the literature uses it

1 arXiv paper cite this in 5 sentences

Each citing sentence is taken from the citing paper's LaTeX source and typed by Pith's classifier. A label appears at probability 0.8 or more (0.95 for support), a contest at 0.7 or more; the quoted words are the citing authors'. How each label was checked · JSON

Papers citing it · 4 sentences without a confident label

Uses its method or tool 1 paper
  • Since the matrix $G$ is symmetric it is natural, following [ref] , to use as a basis for $U$ the eigenvectors of $G$, such that $G z_i = -ω_i^2 z_i$.

    Synchronization in fiber lasers arrays · The model · 0.82

Discussion

Know something about this paper? Leave a comment, or highlight any passage above to comment on it.