Amanote Research

Amanote Research

    RegisterSign In

Finding and Testing Network Communities by Lumped Markov Chains

PLoS ONE - United States
doi 10.1371/journal.pone.0027028
Full Text
Open PDF
Abstract

Available in full text

Categories
Multidisciplinary
Date

November 3, 2011

Authors
Carlo Piccardi
Publisher

Public Library of Science (PLoS)


Related search

Simple Procedures for Finding Mean First Passage Times in Markov Chains

Asia-Pacific Journal of Operational Research
Management ScienceOperations Research
2007English

Segregating Markov Chains

Journal of Theoretical Probability
MathematicsStatisticsUncertaintyProbability
2017English

Occupation Times for Markov and Semi-Markov Chains

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1962English

Approximation of Arbitrary Dirichlet Processes by Markov Chains

Annales de l'institut Henri Poincare (B) Probability and Statistics
UncertaintyStatisticsProbability
1998English

Appendix A. Markov Chains

Wiley Series in Probability and Statistics
English

Finite-State Markov Chains

English

Continuous Parameter Markov Chains

2008English

Shepherding Hordes of Markov Chains

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2019English

Selected Topics on Continuous-Time Controlled Markov Chains and Markov Games

ICP Advanced Texts in Mathematics
2011English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy