default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBuddhika Nettasinghe
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i16]Buddhika Nettasinghe, Allon G. Percus, Kristina Lerman:
Dynamics of Affective Polarization: From Consensus to Partisan Divides. CoRR abs/2403.16940 (2024)- 2023
- [c5]Rui Luo, Buddhika Nettasinghe, Vikram Krishnamurthy:
Anomalous Edge Detection in Edge Exchangeable Social Network Models. COPA 2023: 287-310 - [c4]Buddhika Nettasinghe, Samrat Chatterjee, Ramakrishna Tipireddy, Mahantesh M. Halappanavar:
Extending Conformal Prediction to Hidden Markov Models with Exact Validity via de Finetti's Theorem for Markov Chains. ICML 2023: 25890-25903 - [i15]Rui Luo, Buddhika Nettasinghe, Vikram Krishnamurthy:
Mutual Information Measure for Glass Ceiling Effect in Preferential Attachment Models. CoRR abs/2303.09990 (2023) - 2022
- [j8]Rui Luo
, Buddhika Nettasinghe, Vikram Krishnamurthy:
Echo Chambers and Segregation in Social Networks: Markov Bridge Models and Estimation. IEEE Trans. Comput. Soc. Syst. 9(3): 891-901 (2022) - [j7]Rui Luo, Buddhika Nettasinghe, Vikram Krishnamurthy:
Controlling Segregation in Social Network Dynamics as an Edge Formation Game. IEEE Trans. Netw. Sci. Eng. 9(4): 2317-2329 (2022) - [i14]Buddhika Nettasinghe, Kowe Kadoma, Mor Naaman, Vikram Krishnamurthy:
Estimating Exposure to Information on Social Networks. CoRR abs/2207.05980 (2022) - [i13]Buddhika Nettasinghe, Samrat Chatterjee, Ramakrishna Tipireddy, Mahantesh Halappanavar:
Extending Conformal Prediction to Hidden Markov Models with Exact Validity via de Finetti's Theorem for Markov Chains. CoRR abs/2210.02271 (2022) - 2021
- [j6]Buddhika Nettasinghe, Nazanin Alipourfard, Stephen Iota, Vikram Krishnamurthy, Kristina Lerman:
Scale-free degree distributions, homophily and the glass ceiling effect in directed networks. J. Complex Networks 10(2) (2021) - [j5]Geethu Joseph, Buddhika Nettasinghe, Vikram Krishnamurthy, Pramod K. Varshney:
Controllability of Network Opinion in Erdös-Rényi Graphs Using Sparse Control Inputs. SIAM J. Control. Optim. 59(3): 2321-2345 (2021) - [j4]Buddhika Nettasinghe, Vikram Krishnamurthy:
Maximum Likelihood Estimation of Power-law Degree Distributions via Friendship Paradox-based Sampling. ACM Trans. Knowl. Discov. Data 15(6): 106:1-106:28 (2021) - [j3]Buddhika Nettasinghe, Vikram Krishnamurthy:
"What Do Your Friends Think?": Efficient Polling Methods for Networks Using Friendship Paradox. IEEE Trans. Knowl. Data Eng. 33(3): 1291-1305 (2021) - [c3]Vikram Krishnamurthy, Rui Luo, Buddhika Nettasinghe:
Segregation in Social Networks: MARKOV Bridge Models and Estimation. ICASSP 2021: 5484-5488 - [i12]Buddhika Nettasinghe, Nazanin Alipourfard, Vikram Krishnamurthy, Kristina Lerman:
Emergence of Structural Inequalities in Scientific Citation Networks. CoRR abs/2103.10944 (2021) - [i11]Buddhika Nettasinghe, Nazanin Alipourfard, Vikram Krishnamurthy, Kristina Lerman:
A Directed, Bi-Populated Preferential Attachment Model with Applications to Analyzing the Glass Ceiling Effect. CoRR abs/2103.12149 (2021) - [i10]Rui Luo, Buddhika Nettasinghe, Vikram Krishnamurthy:
Controlling Segregation in Social Network Dynamics as an Edge Formation Game. CoRR abs/2108.12741 (2021) - [i9]Rui Luo, Buddhika Nettasinghe, Vikram Krishnamurthy:
Anomalous Edge Detection in Edge Exchangeable Social Network Models. CoRR abs/2109.12727 (2021) - 2020
- [j2]Buddhika Nettasinghe, Vikram Krishnamurthy, Kristina Lerman:
Diffusion in Social Networks: Effects of Monophilic Contagion, Friendship Paradox, and Reactive Networks. IEEE Trans. Netw. Sci. Eng. 7(3): 1121-1132 (2020) - [i8]Geethu Joseph, Buddhika Nettasinghe, Vikram Krishnamurthy, Pramod K. Varshney:
Controllability of Network Opinion in Erdős-Rényi Graphs using Sparse Control Inputs. CoRR abs/2003.12817 (2020) - [i7]Rui Luo, Buddhika Nettasinghe, Vikram Krishnamurthy:
Echo Chambers and Segregation in Social Networks: Markov Bridge Models and Estimation. CoRR abs/2012.13643 (2020)
2010 – 2019
- 2019
- [j1]Buddhika Nettasinghe, Vikram Krishnamurthy:
Influence Maximization Over Markovian Graphs: A Stochastic Optimization Approach. IEEE Trans. Signal Inf. Process. over Networks 5(1): 1-14 (2019) - [c2]Sujay Bhatt, Buddhika Nettasinghe, Vikram Krishnamurthy:
Efficient Polling Algorithms using Friendship Paradox and Blackwell Dominance. FUSION 2019: 1-8 - [c1]Buddhika Nettasinghe, Vikram Krishnamurthy:
The Friendship Paradox: Implications In Statistical Inference Of Social Networks. MLSP 2019: 1-6 - [i6]Nazanin Alipourfard, Buddhika Nettasinghe, Andrés Abeliuk, Vikram Krishnamurthy, Kristina Lerman:
Friendship Paradox Biases Perceptions in Directed Networks. CoRR abs/1905.05286 (2019) - [i5]Buddhika Nettasinghe, Vikram Krishnamurthy:
Maximum likelihood estimation of power-law degree distributions using friendship paradox based sampling. CoRR abs/1908.00310 (2019) - 2018
- [i4]Buddhika Nettasinghe, Vikram Krishnamurthy:
What Do Your Friends Think? Efficient Polling Methods for Networks Using Friendship Paradox. CoRR abs/1802.06505 (2018) - [i3]Buddhika Nettasinghe, Vikram Krishnamurthy, Kristina Lerman:
Contagions in Social Networks: Effects of Monophilic Contagion, Friendship Paradox and Reactive Networks. CoRR abs/1810.05822 (2018) - [i2]Vikram Krishnamurthy, Buddhika Nettasinghe:
Information Diffusion in Social Networks: Friendship Paradox based Models and Statistical Inference. CoRR abs/1812.06790 (2018) - 2017
- [i1]Buddhika Nettasinghe, Vikram Krishnamurthy:
Influence Maximization over Markovian Graphs: A Stochastic Optimization Approach. CoRR abs/1711.03327 (2017)
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-04-24 23:14 CEST 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:
