Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > stat > arXiv:2310.10232

Help | Advanced Search

Statistics > Applications

arXiv:2310.10232 (stat)
[Submitted on 16 Oct 2023 ]

Title: Efficient seismic reliability and fragility analysis of lifeline networks using subset simulation

Title: 基于子集模拟的线路网络高效地震可靠性和易损性分析

Authors:Dongkyu Lee, Ziqi Wang, Junho Song
Abstract: Various simulation-based and analytical methods have been developed to evaluate the seismic fragilities of individual structures. However, a community's seismic safety and resilience are substantially affected by network reliability, determined not only by component fragilities but also by network topology and commodity/information flows. However, seismic reliability analyses of networks often encounter significant challenges due to complex network topologies, interdependencies among ground motions, and low failure probabilities. This paper proposes to overcome these challenges by a variance-reduction method for network fragility analysis using subset simulation. The binary network limit-state function in the subset simulation is reformulated into more informative piecewise continuous functions. The proposed limit-state functions quantify the proximity of each sample to a potential network failure domain, thereby enabling the construction of specialized intermediate failure events, which can be utilized in subset simulation and other sequential Monte Carlo approaches. Moreover, by discovering an implicit connection between intermediate failure events and seismic intensity, we propose a technique to obtain the entire network fragility curve with a single execution of specialized subset simulation. Numerical examples demonstrate that the proposed method can effectively evaluate system-level fragility for large-scale networks.
Abstract: 各种基于仿真的和分析的方法已被开发用于评估单个结构的地震易损性。 然而,社区的地震安全性和恢复力在很大程度上受到网络可靠性的制约,这不仅由部件易损性决定,还由网络拓扑结构和物资/信息流动决定。 然而,由于复杂的网络拓扑结构、地面运动之间的相互依赖性以及低失效概率,网络的地震可靠性分析常常遇到重大挑战。 本文提出通过一种基于子集模拟的网络易损性分析方差减少方法来克服这些挑战。 在子集模拟中的二元网络极限状态函数被重新表述为更具信息量的分段连续函数。 所提出的极限状态函数量化了每个样本接近潜在网络失效域的程度,从而能够构建专门的中间失效事件,这些事件可以用于子集模拟和其他顺序蒙特卡洛方法。 此外,通过发现中间失效事件与地震强度之间的隐含联系,我们提出了一种技术,只需一次专门的子集模拟执行即可获得整个网络易损性曲线。 数值示例表明,所提出的方法可以有效地评估大规模网络的系统级易损性。
Subjects: Applications (stat.AP) ; Computation (stat.CO)
Cite as: arXiv:2310.10232 [stat.AP]
  (or arXiv:2310.10232v1 [stat.AP] for this version)
  https://doi.org/10.48550/arXiv.2310.10232
arXiv-issued DOI via DataCite
Related DOI: https://doi.org/10.1016/j.ress.2025.110947
DOI(s) linking to related resources

Submission history

From: Dongkyu Lee [view email]
[v1] Mon, 16 Oct 2023 09:42:27 UTC (5,792 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • TeX Source
  • Other Formats
license icon view license
Current browse context:
stat.AP
< prev   |   next >
new | recent | 2023-10
Change to browse by:
stat
stat.CO

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号