default search action
Nicolas Fraiman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j13]Charlie Carlson, Ewan Davies, Nicolas Fraiman, Alexandra Kolla, Aditya Potukuchi, Corrine Yap:
Algorithms for the ferromagnetic Potts model on expanders. Comb. Probab. Comput. 33(4): 487-517 (2024) - [j12]Zachary M. Boyd
, Nicolas Fraiman, Jeremy Louis Marzuola
An Escape Time Formulation for Subgraph Detection and Partitioning of Directed Graphs. SIAM J. Matrix Anal. Appl. 45(1): 685-711 (2024) - [i10]Zachary M. Boyd, Nicolas Fraiman, Jeremy L. Marzuola, Peter J. Mucha, Braxton Osting:
Targeting influence in a harmonic opinion model. CoRR abs/2407.00213 (2024) - 2022
- [j11]Shankar Bhamidi
Community modulated recursive trees and population dependent branching processes. Random Struct. Algorithms 60(2): 201-232 (2022) - [j10]Nicolas Fraiman, Lyuben Lichev, Dieter Mitsche:
On the Power of Choice for Boolean Functions. SIAM J. Discret. Math. 36(3): 1943-1954 (2022) - [c1]Charlie Carlson, Ewan Davies
Algorithms for the ferromagnetic Potts model on expanders. FOCS 2022: 344-355 - [i9]Nicolas Fraiman, Zichao Li:
Beam Search for Feature Selection. CoRR abs/2203.04350 (2022) - [i8]Charlie Carlson, Ewan Davies, Nicolas Fraiman, Alexandra Kolla, Aditya Potukuchi, Corrine Yap:
Algorithms for the ferromagnetic Potts model on expanders. CoRR abs/2204.01923 (2022) - [i7]Nicolas Fraiman, Tzu-Chi Lin, Mariana Olvera-Cravioto:
Opinion dynamics on directed complex networks. CoRR abs/2209.00969 (2022) - [i6]Zachary M. Boyd, Nicolas Fraiman, Jeremy Louis Marzuola, Peter J. Mucha, Braxton Osting:
Escape times for subgraph detection and graph partitioning. CoRR abs/2212.12839 (2022) - 2021
- [j9]Zachary M. Boyd
A Metric on Directed Graphs and Markov Chains Based on Hitting Probabilities. SIAM J. Math. Data Sci. 3(2): 467-493 (2021) - [i5]Nicolas Fraiman, Zichao Li:
Classification with Nearest Disjoint Centroids. CoRR abs/2109.10436 (2021) - [i4]Nicolas Fraiman, Lyuben Lichev, Dieter Mitsche:
On the power of choice for Boolean functions. CoRR abs/2109.13079 (2021) - 2020
- [j8]Nicolas Broutin, Luc Devroye, Nicolas Fraiman
Recursive functions on conditional Galton-Watson trees. Random Struct. Algorithms 57(2): 304-316 (2020) - [i3]Zachary M. Boyd, Nicolas Fraiman, Jeremy Louis Marzuola, Peter J. Mucha, Braxton Osting, Jonathan Weare:
A metric on directed graphs and Markov chains based on hitting probabilities. CoRR abs/2006.14482 (2020) - [i2]Nicolas Fraiman, Zichao Li:
Biclustering with Alternating K-Means. CoRR abs/2009.04550 (2020)
2010 – 2019
- 2018
- [j7]Nicolas Fraiman
The diameter of inhomogeneous random graphs. Random Struct. Algorithms 53(2): 308-326 (2018) - 2015
- [j6]Laurent Beaudou, J. Adrian Bondy, Xiaomin Chen, Ehsan Chiniforooshan, Maria Chudnovsky
A De Bruijn-Erdős Theorem for Chordal Graphs. Electron. J. Comb. 22(1): 1 (2015) - 2014
- [j5]Luc Devroye, Nicolas Fraiman
The Random Connection Model on the Torus. Comb. Probab. Comput. 23(5): 796-804 (2014) - [j4]Nicolas Broutin, Luc Devroye, Nicolas Fraiman
Connectivity threshold of Bluetooth graphs. Random Struct. Algorithms 44(1): 45-66 (2014) - [j3]Luc Devroye, Nicolas Fraiman
Connectivity of inhomogeneous random graphs. Random Struct. Algorithms 45(3): 408-420 (2014) - 2013
- [j2]Laurent Beaudou, J. Adrian Bondy, Xiaomin Chen, Ehsan Chiniforooshan, Maria Chudnovsky
Lines in hypergraphs. Comb. 33(6): 633-654 (2013) - 2012
- [j1]Luc Devroye, Omar Fawzi
Depth Properties of scaled attachment random recursive trees. Random Struct. Algorithms 41(1): 66-98 (2012) - 2011
- [i1]Nicolas Broutin, Luc Devroye, Nicolas Fraiman, Gábor Lugosi:
Connectivity threshold for Bluetooth graphs. CoRR abs/1103.0351 (2011)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-10 20:48 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: