Behnaz Moradi

Generating author description...

All published works

Action	Title	Year	Authors
+	A new method for quantifying network cyclic structure to improve community detection	2019	Behnaz Moradi Heman Shakeri Pietro Poggi‐Corradini Michael Higgins
+	New methods for incorporating network cyclic structures to improve community detection.	2018	Behnaz Moradi Heman Shakeri Pietro Poggi‐Corradini Michael Higgins

Common Coauthors

Coauthor	Papers Together
Michael Higgins	2
Heman Shakeri	2
Pietro Poggi‐Corradini	2

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+	A First Look at Rigorous Probability Theory	2000	Jeffrey S. Rosenthal	2
+ PDF Chat	Near linear time algorithm to detect community structures in large-scale networks	2007	Usha Nandini Raghavan Réka Albert Soundar Kumara	2
+ PDF Chat	The Structure and Function of Complex Networks	2003	Michael Newman	2
+ PDF Chat	Non-Backtracking Random Walks and a Weighted Ihara’s Theorem	2016	Mark Kempton	2
+	High Dimensional Spectral Graph Theory and Non- backtracking Random Walks on Graphs	2015	Mark Kempton	2
+ PDF Chat	Network clustering and community detection using modulus of families of loops	2017	Heman Shakeri Pietro Poggi‐Corradini Nathan Albin Caterina Scoglio	2
+ PDF Chat	NON-BACKTRACKING RANDOM WALKS MIX FASTER	2007	Noga Alon Itaı Benjamini Eyal Lubetzky Sasha Sodin	2
+	Consistency of community detection in networks under degree-corrected stochastic block models	2012	Yunpeng Zhao Elizaveta Levina Ji Zhu	2
+ PDF Chat	Non-backtracking Random Walk	2013	Robert Fitzner Remco van der Hofstad	2
+	Using Triangles to Improve Community Detection in Directed Networks	2014	Christine Klymko David F. Gleich Tamara G. Kolda	2
+	A Set of Measures of Centrality Based on Betweenness	1977	Linton C. Freeman	2
+ PDF Chat	Community detection algorithms: A comparative analysis	2009	Andrea Lancichinetti Santo Fortunato	2
+ PDF Chat	Cyclic topology in complex networks	2005	Hyun‐Joo Kim Jin Min Kim	2
+ PDF Chat	Enhancing community detection using a network weighting strategy	2012	Pasquale De Meo Emilio Ferrara Giacomo Fiumara Alessandro Provetti	2
+ PDF Chat	Benchmark graphs for testing community detection algorithms	2008	Andrea Lancichinetti Santo Fortunato Filippo Radicchi	2
+ PDF Chat	Statistical mechanics of community detection	2006	Juergen Reichardt Stefan Bornholdt	2
+ PDF Chat	Clustering coefficient and community structure of bipartite networks	2008	Peng Zhang Jin-Liang Wang Xiaojia Li Menghui Li Zengru Di Ying Fan	2
+	Finding community structure in very large networks	2004	Aaron Clauset M. E. J. Newman Cristopher Moore	2
+ PDF Chat	Finding and evaluating community structure in networks	2004	Michelle G. Newman Michelle Girvan	2
+ PDF Chat	Computing Communities in Large Networks Using Random Walks	2005	Pascal Pons Matthieu Latapy	2
+ PDF Chat	On Modularity Clustering	2008	Ulrik Brandes Daniel Delling Marco Gaertler Robert Görke Martin Hoefer Zoran Nikoloski Dorothea Wagner	2
+ PDF Chat	Community detection in graphs	2009	Santo Fortunato	2
+ PDF Chat	Resolution limit in community detection	2006	Santo Fortunato Marc Barthélemy	2
+ PDF Chat	Fast unfolding of communities in large networks	2008	Vincent D. Blondel Jean‐Loup Guillaume Renaud Lambiotte Etienne Lefebvre	2
+	On Consistency of Community Detection in Networks	2011	Yunpeng Zhao Elizaveta Levina Ji Zhu	1
+ PDF Chat	Equivalence between modularity optimization and maximum likelihood methods for community detection	2016	M. E. J. Newman	1
+ PDF Chat	Modulus of families of walks on graphs	2017	Nathan Albin Faryad Darabi Sahneh Max Goering Pietro Poggi‐Corradini	1
+ PDF Chat	Stochastic blockmodels and community structure in networks	2011	Brian Karrer M. E. J. Newman	1
+	Defining and identifying communities in networks	2004	Filippo Radicchi Claudio Castellano Federico Cecconi Vittorio Loreto Domenico Parisi	1
+ PDF Chat	Comparing community structure identification	2005	León Danon Albert Dı́az-Guilera Jordi Duch Àlex Arenas	1
+ PDF Chat	The distribution of first hitting times of non-backtracking random walks on Erdős–Rényi networks	2017	Ido Tishby Ofer Biham Eytan Katzav	1
+ PDF Chat	Minimal subfamilies and the probabilistic interpretation for modulus on graphs	2016	Nathan Albin Pietro Poggi‐Corradini	1